Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 50 min ago
PreprintCC BY 4.0arXiv

Injection is all you need: parallel universal logic in high-rate concatenated self-dual codes

Abstract

We propose a quantum architecture that achieves addressable and parallel universal fault-tolerant logical in high-rate codes. The codes are obtained from the flexible concatenation of small-distance high-rate self-dual CSS codes. Addressable and parallel universal logic on the resulting K logical qubits is injected by fault-tolerantly preparing and then consuming diverse logical K-qubit CSS stabilizer states and logical lvert H ⟩⊗ K global magic states. Flag-at-origin is used to prepare the stabilizer resource states while a concatenated cultivation protocol prepares the global magic states. These resource states are consumed by Steane-QEC or Knill-QEC teleportation gadgets, which simultaneously perform quantum error correction. Any quantum algorithm with T-depth DT can be executed by consuming 12DT or fewer resource states. We benchmark the fault-tolerant preparation of the resource states for several two-level concatenations of the [[k+4,k,2]] H codes and the Hamming $[[15,7,3]]$ code. In particular, we find that the concatenated cultivation offers at least one order of magnitude spacetime reduction compared to cultivation in the surface code.

Related

  1. Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing
    Jiahui Wu, Chao Zhang, Zipeng Wu +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Noise redistribution by stabilizer codes: an organizing view of concatenated three-qubit codes
    Long Huang
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Circuit-level benchmarks of GKP-concatenated qLDPC Codes
    Yuan Yao, Ruipeng Xing, Jianshuo Gao +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. High-Rate Concatenated Quantum Error-Correcting Codes for Qudits
    Takanori Nishi, Hayato Goto
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Staying Sober: A Shot-Free Predictor of Logical Error Rates for Concatenated Quantum Error Correcting Codes
    Sayam Sethi, Aditi Awasthi, Maxwell Poster +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{sullivan2026injection,
  title = {{Injection is all you need: parallel universal logic in high-rate concatenated self-dual codes}},
  author = {Joseph Sullivan and David Amaro and Michael A. Perlin},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30087},
  eprint = {2610.30087},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30087},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Injection is all you need: parallel universal logic in high-rate concatenated self-dual codes
AU  - Joseph Sullivan
AU  - David Amaro
AU  - Michael A. Perlin
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30087
UR  - https://arxiv.org/abs/2610.30087
AB  - We propose a quantum architecture that achieves addressable and parallel universal fault-tolerant logical in high-rate codes. The codes are obtained from the flexible concatenation of small-distance high-rate self-dual CSS codes. Addressable and parallel universal logic on the resulting K logical qubits is injected by fault-tolerantly preparing and then consuming diverse logical K-qubit CSS stabilizer states and logical lvert H ⟩^⊗ K global magic states. Flag-at-origin is used to prepare the stabilizer resource states while a concatenated cultivation protocol prepares the global magic states. These resource states are consumed by Steane-QEC or Knill-QEC teleportation gadgets, which simultaneously perform quantum error correction. Any quantum algorithm with T-depth D_T can be executed by consuming 12D_T or fewer resource states. We benchmark the fault-tolerant preparation of the resource states for several two-level concatenations of the [[k+4,k,2]] H codes and the Hamming $[[15,7,3]]$ code. In particular, we find that the concatenated cultivation offers at least one order of magnitude spacetime reduction compared to cultivation in the surface code.
ER  -