Improved quantum hypergraph-product LDPC codes

Abstract

We suggest several techniques to improve the toric codes and the finite-rate generalized toric codes (quantum hypergraph-product codes) recently introduced by Tillich and Zémor. For the usual toric codes, we introduce the rotated lattices specified by two integer-valued periodicity vectors. These codes include the checkerboard codes, and the family of minimal single-qubit-encoding toric codes with block length $n=t^2+(t+1{)}^2$ and distance $d=2t+1$, $t=1,2,...$. We also suggest several related algebraic constructions which nearly quadruple the rate of the existing hypergraph-product codes.

5 pages, 2 figures, IEEE International Symposium on Information Theory (ISIT 2012)

References in corpus (6)

• Fault-tolerant quantum computation with high threshold in two dimensions
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
• Quantum Block and Convolutional Codes from Self-orthogonal Product Codes
• Low-complexity quantum codes designed via codeword-stabilized framework
• Towards Large-Scale Quantum Computation

Cited by in corpus (24)

• Quantum Low-Density Parity-Check Codes
• Degenerate Quantum LDPC Codes With Good Finite Length Performance
• A theory of single-shot error correction for adversarial noise
• Trapping Sets of Quantum LDPC Codes
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Combining hard and soft decoders for hypergraph product codes
• Bias-tailored quantum LDPC codes
• Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
• Partitioning qubits in hypergraph product codes to implement logical gates
• Connectivity constrains quantum codes
• Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes
• High-rate quantum LDPC codes for long-range-connected neutral atom registers
• Numerical and analytical bounds on threshold error rates for hypergraph-product codes
• Fault-Tolerant Quantum Computation with Constant Overhead
• Fault-tolerant gates via homological product codes
• Universal set of scalable dynamically corrected gates for quantum error correction with always-on qubit couplings
• Efficient Formal Verification of Quantum Error Correcting Programs
• Homological Product Codes
• Fault-tolerant logical measurements via homological measurement
• A graph-based formalism for surface codes and twists
• Relation Between Surface Codes and Hypermap-Homology Quantum Codes
• Universal set of Dynamically Protected Gates for Bipartite Qubit Networks II: Soft Pulse Implementation of the [[5,1,3]] Quantum Error Correcting Code
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Hypermap-Homology Quantum Codes (Ph.D. thesis)