Skip to content
DraconiticResearch
Search Sources API
194,226 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

Scalable logical qubits

Abstract

Utility-scale quantum computing will require executing long, complex algorithms with end-to-end error rates far below what physical qubits can support directly. Error-corrected logical qubits are needed to achieve this goal. To make the progress on logical qubits measurable and comparable we introduce the definition of scalable logical qubits: logical qubits preserved for long computations by repeated quantum error correction, capable of fault-tolerant universal operations with low-latency real-time decoding and feedback, and replicable to the hundreds or thousands, as required by applications. We characterize these scalable logical qubits along four coupled dimensions: reliability, scale, capability, and performance, and discuss trade-offs among these dimensions.

Related

  1. Modeling Logical Gates and Readout of Superconducting Gottesman-Kitaev-Preskill Qubits
    Mackenzie H. Shaw, Andrew C. Doherty, Arne L. Grimsmo
    PRX QuantumPeer-reviewedCC BY 4.0Quantum physics & quantum informationAPS
  2. Entangled logical qubits on a superconducting quantum processor
    Robin Harper, Xanda C. Kolesnikow, Campbell K. McLauchlan +3
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Deterministic Universal Logical Gates for Finite-Energy GKP Qubits in Trapped Neutral Atoms
    Alok Kumar, Aaron N. Raja, Diksha Thapliyal +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Clifford gates with logical transversality for self-dual CSS codes
    Theerapat Tansuwannont, Yugo Takada, Keisuke Fujii
    Physical Review ResearchPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsCrossref
  5. Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification
    Kaavya Sahay, Cody Jones
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{troyer2026scalable,
  title = {{Scalable logical qubits}},
  author = {Matthias Troyer and Chetan Nayak and John Martinis},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.20549},
  eprint = {2609.20549},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.20549},
}
RIS
TY  - UNPB
TI  - Scalable logical qubits
AU  - Matthias Troyer
AU  - Chetan Nayak
AU  - John Martinis
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.20549
UR  - https://arxiv.org/abs/2609.20549
AB  - Utility-scale quantum computing will require executing long, complex algorithms with end-to-end error rates far below what physical qubits can support directly. Error-corrected logical qubits are needed to achieve this goal. To make the progress on logical qubits measurable and comparable we introduce the definition of scalable logical qubits: logical qubits preserved for long computations by repeated quantum error correction, capable of fault-tolerant universal operations with low-latency real-time decoding and feedback, and replicable to the hundreds or thousands, as required by applications. We characterize these scalable logical qubits along four coupled dimensions: reliability, scale, capability, and performance, and discuss trade-offs among these dimensions.
ER  -