Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

2014/01/24 by Jean-Pierre Tillich, Gilles Zemor · 62 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Error Correcting Code Techniques #Quantum Information and Cryptography

paper · doi:10.1109/tit.2013.2292061

Abstract

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.

Citations

• Fault-tolerant quantum computation by anyons

Cited by

• Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes
• Quantum LDPC Codes With Almost Linear Minimum Distance
• Learning to Decode Quantum LDPC Codes via Cluster-Based Sequential Belief Propagation
• Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
• Quantum XYZ Stabilizer Codes
• Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
• Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
• Engineering CSS surgery: compiling any CNOT in any code
• Parallel Logical Measurements via Quantum Code Surgery
• Bacon-Shor Board Games
• Translation-invariant quantum low-density parity-check codes from compactified fracton models
• Quantum Weight Reduction with Layer Codes
• Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
• High-Performance Reinforcement-Learned BP Decoding of Quantum LDPC Codes
• Small quantum Tanner codes from left--right Cayley complexes
• Beam search decoder for quantum LDPC codes
• Pseudocodewords of quantum, quasi-cyclic, and spatially-coupled LDPC codes: a fundamental cone perspective
• Cyclone: Designing Efficient and Highly Parallel QCCD Architectural Codesigns for Fault Tolerant Quantum Memory
• Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction
• Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
• Cyclic Hypergraph Product Code
• Addressable gate-based logical computation with quantum LDPC codes
• Random Construction of Quantum LDPC Codes
• HyperNQ: A Hypergraph Neural Network Decoder for Quantum LDPC Codes
• Systematic Non-Binary Extension of LDPC-CSS Codes Preserving Orthogonality
• A Spin-Optical Quantum Computing Architecture
• Phenomenological Noise Models and Optimal Thresholds of the 3D Toric Code
• Unveiling dynamical quantum error correcting codes via non-invertible symmetries
• Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes
• Transversal gates for probabilistic implementation of multi-qubit Pauli rotations
• Noisy-Syndrome Decoding of Hypergraph Product Codes
• Transversal dimension jump for product qLDPC codes
• Layer codes as partially self-correcting quantum memories
• Efficient Post-Selection for General Quantum LDPC Codes
• Cored product codes for quantum self-correction in three dimensions
• Expander qLDPC Codes against Long-range Correlated Errors in Memory
• Scalable accuracy gains from postselection in quantum error correcting codes
• Toward Uncertainty-Aware and Generalizable Neural Decoding for Quantum LDPC Codes
• Decoding quantum low density parity check codes with diffusion
• On the hardness of approximating minimum distances of quantum codes
• Pair-Partition Constructions for CPM-Based Quantum LDPC Codes
• Transversal STAR architecture for megaquop-scale quantum simulation with neutral atoms
• Fusion-based implementation of qLDPC codes with quantum emitters
• Single-Shot Decoding of Biased-Tailored Quantum LDPC Codes
• Fermion-to-Fermion Low-Density Parity-Check Codes
• Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Fault tolerant Operations in Majorana-based Quantum Codes: Gates, Measurements and High Rate Constructions
• Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
• Explicit Instances of Quantum Tanner Codes
• Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond. [europepmc]
• The XZZX surface code. [europepmc]
• High-threshold and low-overhead fault-tolerant quantum memory. [europepmc]
• On the Exploration of Quantum Polar Stabilizer Codes and Quantum Stabilizer Codes with High Coding Rate. [europepmc]
• Layer codes. [europepmc]
• Quantum memory at nonzero temperature in a thermodynamically trivial system. [europepmc]
• High-rate quantum LDPC codes for long-range-connected neutral atom registers. [europepmc]
• Yoked surface codes. [europepmc]
• Determining the Upper-Bound on the Code Distance of Quantum Stabilizer Codes Through the Monte Carlo Method Based on Fully Decoupled Belief Propagation. [europepmc]
• Decoding correlated errors in quantum LDPC codes. [europepmc]
• Fusion-based implementation of qLDPC codes with quantum emitters. [europepmc]

Related

• An efficient decoder for a linear distance quantum LDPC code
• Numerical Techniques for Finding the Distances of Quantum Codes
• Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code
• List Decodable Quantum LDPC Codes
• Decodable quantum LDPC codes beyond the √(n) distance barrier using high dimensional expanders