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

Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes

Abstract

We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.

Related

  1. Universally Certifying Partially Self-Correcting Quantum Memories in 3D Translation-Invariant Stabilizer Codes
    Chong-Yuan Xu, Yong Xu
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Logical-Class Diagnostic Layer for Stabilizer Codes and Decoders via Supercharge Structures
    Hai Lin
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes
    Asit Kumar Pradhan, Nithin Raveendran, David Declercq +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Fault-tolerant quantum error correction for constant-excitation stabilizer codes under coherent noise
    Ching-Yi Lai, Pei-Hao Liou, Yingkai Ouyang
    npj Quantum InformationPeer-reviewedCC BY 4.0Quantum physics & quantum informationCrossref
  5. Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation
    Ivan Shum, Ángela Capel
    New Journal of PhysicsPeer-reviewedCC BY 4.0Full textAtomic, molecular & optical physicsCrossref
BibTeX
@misc{selub2026local,
  title = {{Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes}},
  author = {Nathaniel Selub and Aditya Bhardwaj and Ethan Lake},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.11457},
  eprint = {2609.11457},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.11457},
}
RIS
TY  - UNPB
TI  - Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes
AU  - Nathaniel Selub
AU  - Aditya Bhardwaj
AU  - Ethan Lake
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.11457
UR  - https://arxiv.org/abs/2609.11457
AB  - We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.
ER  -