Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code
arXiv:1302.1845
Abstract
We present a linked-cluster technique for calculating the distance of a quantum LDPC code. It offers an advantage over existing deterministic techniques for codes with small relative distances (which includes all known families of quantum LDPC codes), and over the probabilistic technique for codes with sufficiently high rates.
5.5 pages
References in corpus (10)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Quantum Teleportation is a Universal Computational Primitive
- Fault-tolerant quantum computation with high threshold in two dimensions
- Demonstration of conditional gate operation using superconducting charge qubits
- Towards fault-tolerant quantum computing with trapped ions
- Tradeoffs for reliable quantum information storage in 2D systems
- New constructions of CSS codes obtained by moving to higher alphabets