Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
Breaking the orthogonality barrier in quantum LDPC codes
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 7years
2026 7roles
background 1polarities
background 1representative citing papers
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
A finite-field two-branch coset construction generates regular CSS LDPC bases for multiple (J,L) pairs, with a (3,10) example lifted 64-fold to a [[10240,4108,10≤d≤32]] code and post-processed FER of 1e-7 at p=0.058.
PIQC proposes a distributed FTQC architecture based on molecular quantum nodes with photonic integration, nuclear registers, loss-tolerant entanglement, and Floquetified qLDPC codes.
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.
A new [[16384,4142,≤40]] quantum LDPC code family is obtained by CPM-lifting a girth-8 base CSS code, achieving frame error rate ~10^{-8} at depolarizing noise p=0.085.
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
citing papers explorer
-
Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
-
Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation
Neural decoder for quantum LDPC codes achieves ~10^{-10} logical error at 0.1% physical error with 17x improvement and high throughput, enabling practical fault tolerance at modest code sizes.
-
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
A finite-field two-branch coset construction generates regular CSS LDPC bases for multiple (J,L) pairs, with a (3,10) example lifted 64-fold to a [[10240,4108,10≤d≤32]] code and post-processed FER of 1e-7 at p=0.058.
-
PIQC: Scalable Distributed Quantum Computing via Photonic Integration of Designed Molecular Quantum Nodes
PIQC proposes a distributed FTQC architecture based on molecular quantum nodes with photonic integration, nuclear registers, loss-tolerant entanglement, and Floquetified qLDPC codes.
-
High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts
Constructs explicit regular high-girth quantum LDPC codes from square-base hypergraph products and CPM lifts, including a [[28800,62]] (3,6)-regular code with zero observed decoding failures in 2.993e8 trials at p=0.1402.
-
High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures
A new [[16384,4142,≤40]] quantum LDPC code family is obtained by CPM-lifting a girth-8 base CSS code, achieving frame error rate ~10^{-8} at depolarizing noise p=0.085.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.