pith. sign in

arxiv: 0805.4213 · v1 · submitted 2008-05-27 · 🪐 quant-ph

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

classification 🪐 quant-ph
keywords latencyquantumqubitqubitscodecomputingerrorfault-tolerant
0
0 comments X
read the original 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 \times 10^{-5}$, when memory errors are taken to be one tenth of the gate error rates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.