On subsystem codes beating the quantum Hamming or Singleton bound
From MaRDI portal
Abstract: Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field can beat the Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the Hamming bound. A number of open problems concern the comparison in performance of stabilizer and subsystem codes. One of the open problems suggested by Poulin's work asks whether a subsystem code can use fewer syndrome measurements than an optimal MDS stabilizer code while encoding the same number of qudits and having the same distance. We prove that linear subsystem codes cannot offer such an improvement under complete decoding.
Recommendations
Cites work
- A brief introduction to operator quantum error correction
- Clifford Code Constructions of Operator Quantum Error-Correcting Codes
- EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
- Noiseless subsystems for collective rotation channels in quantum information theory
- Nonbinary quantum codes
- Nonbinary Stabilizer Codes Over Finite Fields
- Operator Quantum Error Correction
- Upper bounds on the size of quantum codes
Cited in
(14)- Some constructions of optimal subsystem codes derived from GRS codes
- Constructions and noise threshold of topological subsystem codes
- Generalized multiplicative domains and quantum error correction
- Constructions of subsystem codes over finite fields
- A comparison of decoherence-free subsystem/subspace for partially broken symmetry
- New optimal subsystem codes
- Quantum Serial Turbo Codes
- Encoding classical information in gauge subsystems of quantum codes
- New MDS operator quantum error-correcting codes derived from constacyclic codes over \(\mathbb{F}_{q^2} + v\mathbb{F}_{q^2}\)
- Quantum data-syndrome codes: subsystem and impure code constructions
- Theory behind quantum error correcting codes: an overview
- Decoherence mitigation by embedding a logical qubit in a qudit
- New subsystem codes from matrix-product codes
- Subsystem codes derived from the non-chain rings
This page was built for publication: On subsystem codes beating the quantum Hamming or Singleton bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443627)
