English

Latency in local, two-dimensional, fault-tolerant quantum computing

Quantum Physics 2008-05-29 v1

Abstract

We analyze the latency of fault-tolerant quantum computing based on the 9-qubit Bacon-Shor code using a local, two-dimensional architecture. We embed the data qubits in a 7 by 7 array of physical qubits, where the extra qubits are used for ancilla preparation and qubit transportation by means of a SWAP chain. The latency is reduced with respect to a similar implementation using Steane's 7-qubit code (K. M. Svore, D. P. DiVincenzo, and B. M. Terhal, Quantum Information & Computation {\bf 7}, 297 (2007)). Furthermore, the error threshold is also improved to 2.02×1052.02 \times 10^{-5}, when memory errors are taken to be one tenth of the gate error rates.

Keywords

Cite

@article{arxiv.0805.4213,
  title  = {Latency in local, two-dimensional, fault-tolerant quantum computing},
  author = {Federico M. Spedalieri and Vwani P. Roychowdhury},
  journal= {arXiv preprint arXiv:0805.4213},
  year   = {2008}
}

Comments

16 pages, 7 figures

R2 v1 2026-06-21T10:44:42.701Z