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

2008/05/27 by Federico M. Spedalieri, Spedalieri, Federico M., Vwani Roychowdhury +2
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #quant-ph

paper · pdf · doi:10.48550/arxiv.0805.4213

16 pages, 7 figures

arxiv created 2008/05/27 · arxiv updated 2009/12/01

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 × 10^-5, when memory errors are taken to be one tenth of the gate error rates.

Related

• Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures
• Opportunities and Challenges in Fault-Tolerant Quantum Computation
• Local fault-tolerant quantum computation
• How to fault-tolerantly realize any quantum circuit with local operations
• Practical Quantum Computing: The value of local computation