Sparse Graph Codes for Quantum Error-Correction
arXiv:quant-ph/0304161 · doi:10.1109/TIT.2004.834737
Abstract
We present sparse graph codes appropriate for use in quantum error-correction. Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based on sparse graphs. Second, sparse graph codes keep the number of quantum interactions associated with the quantum error correction process small: a constant number per quantum bit, independent of the blocklength. Third, sparse graph codes often offer great flexibility with respect to blocklength and rate. We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.
Version 7.3e: 42 pages. Extended version, Feb 2004. A shortened version was resubmitted to IEEE Transactions on Information Theory Jan 20, 2004
References in corpus (6)
Cited by in corpus (128)
- Correcting Quantum Errors with Entanglement
- High-threshold and low-overhead fault-tolerant quantum memory
- Sparse Graph Codes for Quantum Error-Correction
- Quantum Low-Density Parity-Check Codes
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Decoding Across the Quantum LDPC Code Landscape
- Asymmetric quantum error correcting codes
- Quantum LDPC Codes with Almost Linear Minimum Distance
- IBM Quantum Computers: Evolution, Performance, and Future Directions
- Catalytic quantum error correction
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- Convolutional and tail-biting quantum error-correcting codes
- Entanglement-assisted quantum turbo codes
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Decoding color codes by projection onto surface codes
- Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
- High performance entanglement-assisted quantum LDPC codes need little entanglement
- Quantum Quasi-Cyclic LDPC Codes
- Entanglement-assisted quantum low-density parity-check codes
- Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- Trapping Sets of Quantum LDPC Codes
- Communication Links for Distributed Quantum Computation
- Asymmetric Quantum LDPC Codes
- Decoding algorithms for surface codes
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
- A Class of Quantum LDPC Codes Constructed From Finite Geometries
- Constructions and performance of classes of quantum LDPC codes
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- Stabilizer quantum error correction toolbox for superconducting qubits
- Quantum Error Correction beyond the Bounded Distance Decoding Limit
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- Modified belief propagation decoders for quantum low-density parity-check codes
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- Fault-tolerant gates on hypergraph product codes
- Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
- Beyond single-shot fault-tolerant quantum error correction
- Polar codes for degradable quantum channels
- Quantum stabilizer codes, lattices, and CFTs
- Graphical Structures for Design and Verification of Quantum Error Correction
- Performance of surface codes in realistic quantum hardware
- Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
- Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
- Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
- Quantum codes give counterexamples to the unique pre-image conjecture of the N-representability problem
- Topological graph states and quantum error correction codes
- Log-domain decoding of quantum LDPC codes over binary finite fields
- A characterization of entanglement-assisted quantum low-density parity-check codes
- Performance enhancement of surface codes via recursive MWPM decoding
- Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
- Decoding of Quantum Data-Syndrome Codes via Belief Propagation
- Belief propagation decoding of quantum channels by passing quantum messages
- Fault-tolerant gates via homological product codes
- Universal set of scalable dynamically corrected gates for quantum error correction with always-on qubit couplings
- Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
- Fast erasure decoder for hypergraph product codes
- High-rate quantum low-density parity-check codes assisted by reliable qubits
- Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation
- Entanglement-assisted Coding Theory
- Self-dual, dual-containing and related quantum codes from group rings
- Quantum outage probability for time-varying quantum channels
- Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
- New constructions of CSS codes obtained by moving to higher alphabets
- Homological Product Codes
- Optimal quantum subsystem codes in 2-dimensions
- Multi-Qubit Joint Measurements in Circuit QED: Stochastic Master Equation Analysis
- On the probabilistic quantum error correction
- Improved Belief Propagation Decoding Algorithms for Surface Codes
- Linear-optical quantum computation with arbitrary error-correcting codes
- A linear-time benchmarking tool for generalized surface codes
- Quantum Volume for Photonic Quantum Processors
- Quantum stabilizer codes and beyond
- Dynamically corrected gates for qubits with always-on Ising couplings: Error model and fault-tolerance with the toric code
- Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Families of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets
- Constructing CSS Codes with LDPC Codes for the BB84 Quantum Key Distribution Protocol
- Lift-Connected Surface Codes
- Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices
- Quantum Capacity Approaching Codes for the Detected-Jump Channel
- Refined Belief-Propagation Decoding of Quantum Codes with Scalar Messages
- Quantum Error Correction near the Coding Theoretical Bound
- On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
- Classical product code constructions for quantum Calderbank-Shor-Steane codes
- The Need for Structure in Quantum LDPC Codes
- Family of Finite Geometry Low-Density Parity-Check Codes for Quantum Key Expansion
- Concatenated Conjugate Codes
- Degenerate quantum erasure decoding
- Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise
- Progressive-Proximity Bit-Flipping for Decoding Surface Codes
- Decoherence and Quantum Error Correction for Quantum Computing and Communications
- Coprime Bivariate Bicycle Codes and Their Layouts on Cold Atoms
- Reliable Quantum Communications based on Asymmetry in Distillation and Coding
- A Construction of Quantum LDPC Codes from Cayley Graphs
- Quantum serial turbo-codes
- Error Correction for Reliable Quantum Computing
- Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes
- Syndrome decoding by quantum approximate optimization
- An Adaptive Entanglement Distillation Scheme Using Quantum Low Density Parity Check Codes
- Channel Identification and its Impact on Quantum LDPC Code Performance
- Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes
- Photonic Hybrid Quantum Computing
- Quantum LDPC codes from intersecting subsets
- Design of Quantum Stabilizer Codes From Quadratic Residues Sets
- Quantum LDPC Codes Constructed from Point-Line Subsets of the Finite Projective Plane
- Hardness of decoding quantum stabilizer codes
- Informed Dynamic Scheduling for QLDPC Codes
- Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
- Spatially Coupled Quasi-Cyclic Quantum LDPC Codes
- Optimizing short stabilizer codes for asymmetric channels
- On the non-existence for quantum LDPC codes of type IEEE802.16e with rates 1/2 and 2/3B
- Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes"
- Distance verification for classical and quantum LDPC codes
- Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel
- Improved Quantum LDPC Decoding Strategies For The Misidentified Quantum Depolarizing Channel
- Symmetry-enriched topological order and quasifractonic behavior in stabilizer codes
- Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
- A note on the minimum distance of quantum LDPC codes
- Practical Entanglement Distillation Scheme Using Recurrence Method And Quantum Low Density Parity Check Codes
- Hypermap-Homology Quantum Codes (Ph.D. thesis)