Spacetime lifting constructs fault complexes with almost-linear fault distance in spacetime cost, outperforming prior constructions and supporting fault-tolerant logical teleportation via cluster-state protocols.
arXiv preprint arXiv:2603.02157 , year=
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 7years
2026 7roles
background 2polarities
background 2representative citing papers
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.
Concatenating quantum Reed-Solomon codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.
citing papers explorer
-
A framework for low-overhead quantum fault tolerance via spacetime lifting
Spacetime lifting constructs fault complexes with almost-linear fault distance in spacetime cost, outperforming prior constructions and supporting fault-tolerant logical teleportation via cluster-state protocols.
-
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.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Concatenating quantum Reed-Solomon codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
-
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
-
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.