Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes

Abstract

We discuss error-correction properties for families of quantum low-density parity check (LDPC) codes with relative distance that tends to zero in the limit of large blocklength. In particular, we show that any family of LDPC codes, quantum or classical, where distance scales as a positive power of the block length, $d\propto n^{\alpha }$, $\alpha >0$, can correct all errors with certainty if the error rate per (qu)bit is sufficiently small. We specifically analyze the case of LDPC version of the quantum hypergraph-product codes recently suggested by Tillich and Zémor. These codes are a finite-rate generalization of the toric codes, and, for sufficiently large quantum computers, offer an advantage over the toric codes.

arXiv comment4.5 pages, 1 figure

References in corpus (28)

• 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
• Topological quantum memory
• Quantum Computing with Very Noisy Devices
• A Theory of Fault-Tolerant Quantum Computation
• 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
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Quantum orders in an exact soluble model
• Sparse Graph Codes for Quantum Error-Correction
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Stabilizer Formalism for Operator Quantum Error Correction
• Fault-Tolerant Error Correction with Efficient Quantum Codes
• Active stabilisation, quantum computation and quantum state synthesis
• Towards practical classical processing for the surface code
• Tradeoffs for reliable quantum information storage in 2D systems
• Efficient fault-tolerant quantum computing
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Strong Resilience of Topological Codes to Depolarization
• Long-distance spin-spin coupling via floating gates
• A Proposed Quantum Low Density Parity Check Code
• Subsystem codes with spatially local generators
• Fault-Tolerant Logical Gate Networks for CSS Codes
• Low-complexity quantum codes designed via codeword-stabilized framework

Cited by in corpus (60)

• Quantum Error Correction for Quantum Memories
• Quantum Low-Density Parity-Check Codes
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• 3D integrated superconducting qubits
• Flag fault-tolerant error correction with arbitrary distance codes
• Quantum "hyperbicycle" low-density parity check codes with finite rate
• Constant overhead quantum fault-tolerance with quantum expander codes
• Fault-tolerant logical gates in quantum error-correcting codes
• Early Fault-Tolerant Quantum Computing
• A theory of single-shot error correction for adversarial noise
• Quantum Expander Codes
• Single-shot error correction of three-dimensional homological product codes
• Quantum coding with low-depth random circuits
• Cellular-automaton decoders for topological quantum memories
• Tight lower bound for percolation threshold on a quasi-regular graph
• Trapping Sets of Quantum LDPC Codes
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Combining hard and soft decoders for hypergraph product codes
• Higher-dimensional quantum hypergraph-product codes
• Quantifying nonlocality: how outperforming local quantum codes is expensive
• Flag fault-tolerant error correction, measurement, and quantum computation for cyclic CSS codes
• Fault-tolerant gates on hypergraph product codes
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• Connectivity constrains quantum codes
• Beyond single-shot fault-tolerant quantum error correction
• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• A simple decoder for topological codes
• Numerical and analytical bounds on threshold error rates for hypergraph-product codes
• Fault-Tolerant Quantum Computation with Constant Overhead
• Topological graph states and quantum error correction codes
• Fault-tolerant gates via homological product codes
• QDistRnd: A GAP package for computing the distance of quantum error-correcting codes
• Hierarchical memories: Simulating quantum LDPC codes with local gates
• Fast erasure decoder for hypergraph product codes
• Sparse Quantum Codes from Quantum Circuits
• Distance-preserving stabilizer measurements in hypergraph product codes
• Tantalum airbridges for scalable superconducting quantum processors
• Extracting Error Thresholds through the Framework of Approximate Quantum Error Correction Condition
• Minimal distances for certain quantum product codes and tensor products of chain complexes
• Optimal quantum subsystem codes in 2-dimensions
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• A linear-time benchmarking tool for generalized surface codes
• Dynamically corrected gates for qubits with always-on Ising couplings: Error model and fault-tolerance with the toric code
• Concatenate codes, save qubits
• Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
• Lift-Connected Surface Codes
• Progressive-Proximity Bit-Flipping for Decoding Surface Codes
• Fundamental thresholds for computational and erasure errors via the coherent information
• Vulnerability of fault-tolerant topological quantum error correction to quantum deviations in code space
• Single-shot preparation of hypergraph product codes via dimension jump
• Efficient decoding of random errors for quantum expander codes
• Targeted Clifford logical gates for hypergraph product codes
• Stable quantum memories with limited measurement
• Unified Framework for Quantum Code Embedding
• Approximate Quantum Error Correction with 1D Log-Depth Circuits
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Distance verification for classical and quantum LDPC codes