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

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

2008-05-27

arxiv.org/abs/0805.4213v1

Physics

Quantum Physics

16 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Latency in local, two-dimensional, fault-tolerant quantum computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Latency in local, two-dimensional, fault-tolerant quantum computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Latency in local, two-dimensional, fault-tolerant quantum computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415639