Classical codes plus SAT search yield no-go theorems limiting error detection in sub-8-qubit distillation and new minimal-qubit protocols for T-to-T (distances 4-5 on 10-11 qubits) and T-to-CCZ (distances 3-4 on 9-10 qubits).
Breaking the orthogonality barrier in quantum LDPC codes
13 Pith papers cite this work. Polarity classification is still indexing.
13
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 13roles
background 1polarities
background 1representative citing papers
GB codes are expressed as cyclic submodules of R_ℓ² to derive necessary and sufficient conditions for block-separable automorphisms and fold-transversal gates, with the new MCR family demonstrated to generate the 2-qubit Clifford group for k=2 codes up to distance 13.
Heuristic search plus explicit verification yields certified upper bounds on the minimum distance of quantum APM-LDPC codes with girth-eight Tanner graphs.
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 symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
A new RL-LS BP decoder for QLDPC codes combines learned variable-node scheduling with list-based search and cumulative path metrics, showing improved performance over standard BP on the depolarizing channel.
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
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.
Constructs a [[34542,23032,d≤310]] rate-2/3 girth-8 quantum LDPC CSS code from two-branch finite-field bases and CPM lifts with no decoder failures in 10^8 trials at p=0.01.
citing papers explorer
-
Exploring the landscape of compact magic-state distillation factories
Classical codes plus SAT search yield no-go theorems limiting error detection in sub-8-qubit distillation and new minimal-qubit protocols for T-to-T (distances 4-5 on 10-11 qubits) and T-to-CCZ (distances 3-4 on 9-10 qubits).
-
Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure
GB codes are expressed as cyclic submodules of R_ℓ² to derive necessary and sufficient conditions for block-separable automorphisms and fold-transversal gates, with the new MCR family demonstrated to generate the 2-qubit Clifford group for k=2 codes up to distance 13.
-
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.
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
-
Learning-Based List Sequential Belief Propagation Decoding of Quantum LDPC Codes
A new RL-LS BP decoder for QLDPC codes combines learned variable-node scheduling with list-based search and cumulative path metrics, showing improved performance over standard BP on the depolarizing channel.
-
Full Extractors for Logical Processing in Hypergraph Product Codes
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
-
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 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.
-
Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
Constructs a [[34542,23032,d≤310]] rate-2/3 girth-8 quantum LDPC CSS code from two-branch finite-field bases and CPM lifts with no decoder failures in 10^8 trials at p=0.01.