Quantum LDPC Codes with Almost Linear Minimum Distance
arXiv:2012.04068 · doi:10.1109/TIT.2021.3119384
Abstract
We give a construction of quantum LDPC codes of dimension and distance as the code length . Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance and dimension , where . We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixed there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least with, in some sense, optimal circulant size as the code length .
arXiv comment17 pages, 2 figures. Accepted for publication in IEEE Transactions on Information Theory
References in corpus (15)
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Local stabilizer codes in three dimensions without string logical operators
- Sparse Graph Codes for Quantum Error-Correction
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Constant overhead quantum fault-tolerance with quantum expander codes
- A theory of single-shot error correction for adversarial noise
- Expansion of Random Graphs: New Proofs, New Results
- Fiber Bundle Codes: Breaking the Barrier for Quantum LDPC Codes
- Quantum Quasi-Cyclic LDPC Codes
- Higher-dimensional quantum hypergraph-product codes
Cited by in corpus (25)
- Quantum Low-Density Parity-Check Codes
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Fiber Bundle Codes: Breaking the Barrier for Quantum LDPC Codes
- Trapping Sets of Quantum LDPC Codes
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Bias-tailored quantum LDPC codes
- Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
- Tailored XZZX codes for biased noise
- Connectivity constrains quantum codes
- Fold-Transversal Clifford Gates for Quantum Codes
- Quantum LDPC Codes for Modular Architectures
- Graphical Structures for Design and Verification of Quantum Error Correction
- Towards local testability for quantum coding
- Error-correcting codes for fermionic quantum simulation
- CSS code surgery as a universal construction
- Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
- Quantum XYZ Product Codes
- Quantum Routing with Teleportation
- Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
- Circuit lower bounds for low-energy states of quantum code Hamiltonians
- Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
- A construction of Combinatorial NLTS
- Quantum Locally Testable Code with Constant Soundness
- Distilling GHZ States using Stabilizer Codes