Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 34 min ago
PreprintarXiv licencearXiv

Constant-Overhead Injection into Quantum Codes

Abstract

We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of constant-rate quantum error-correcting codes for which a set of bare physical qubits can be injected, i.e. fault-tolerantly encoded, into a code block. Similarly, a code state can be ejected, i.e. fault-tolerantly decoded, back into bare physical qubits. We show that these injection and ejection procedures succeed under circuit-level locally stochastic noise, while incurring just a small constant probability of corrupting each qubit, which is unavoidable for bare physical qubits. We also show how to perform fault-tolerant error correction and code-state preparation under locally stochastic noise. All of our gadgets can be implemented with constant quantum circuit depth (i.e. are single-shot), and with a number of physical qubits growing linearly with the number of logical qubits, assuming the ability to run polynomial-sized noiseless classical circuits on the side. We construct our quantum codes by taking a high-dimensional hypergraph product of classical LDPC codes, which in turn are a simplified version of Spielman's linear-time encodable codes (STOC'95). As our resulting product codes are only resilient to physical errors occurring with non-uniform probabilities across qubits, we then show how to concatenate with inner codes of various sizes to obtain fault-tolerance against uniform noise.

Related

  1. Sipser-Spielman meets Dijkgraaf-Witten: non-Abelian qLDPC codes via twisted sheaf gauge theory and almost-constant-overhead magic state fountain
    Guanyu Zhu, Shi Jie Samuel Tan, Ryohei Kobayashi +1
    arXivPreprintarXiv licenceFull textMathematical physicsCondensed matterarXiv
  2. New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds
    Chris Dzoba
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes
    Artur Akhiiarov, Peter Boyvalenkov, Danila Cherkashin +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Improved bounds for constant-power and low-power error-correcting cooling codes
    Tingting Tong, Sihuang Hu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
    Neehar Verma, Camilla Hollanti, Razane Tajeddine
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{golowich2026constantoverhead,
  title = {{Constant-Overhead Injection into Quantum Codes}},
  author = {Louis Golowich and Venkatesan Guruswami},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39345},
  eprint = {2609.39345},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39345},
}
RIS
TY  - UNPB
TI  - Constant-Overhead Injection into Quantum Codes
AU  - Louis Golowich
AU  - Venkatesan Guruswami
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39345
UR  - https://arxiv.org/abs/2609.39345
AB  - We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of constant-rate quantum error-correcting codes for which a set of bare physical qubits can be injected, i.e. fault-tolerantly encoded, into a code block. Similarly, a code state can be ejected, i.e. fault-tolerantly decoded, back into bare physical qubits. We show that these injection and ejection procedures succeed under circuit-level locally stochastic noise, while incurring just a small constant probability of corrupting each qubit, which is unavoidable for bare physical qubits. We also show how to perform fault-tolerant error correction and code-state preparation under locally stochastic noise. All of our gadgets can be implemented with constant quantum circuit depth (i.e. are single-shot), and with a number of physical qubits growing linearly with the number of logical qubits, assuming the ability to run polynomial-sized noiseless classical circuits on the side. We construct our quantum codes by taking a high-dimensional hypergraph product of classical LDPC codes, which in turn are a simplified version of Spielman's linear-time encodable codes (STOC'95). As our resulting product codes are only resilient to physical errors occurring with non-uniform probabilities across qubits, we then show how to concatenate with inner codes of various sizes to obtain fault-tolerance against uniform noise.
ER  -