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

Authors:
Federico M. Spedalieri;Vwani P. Roychowdhury
Affiliations:
Department of Electrical Engineering, University of California, Los Angeles, Los Angeles, CA;Department of Electrical Engineering, University of California, Los Angeles, Los Angeles, CA
Venue:
Quantum Information & Computation
Year:
2009

Citing 5
Cited 0

Fault-tolerant quantum computation with constant error

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum accuracy threshold for concatenated distance-3 codes

Quantum Information & Computation
Noise threshold for a fault-tolerant two-dimensional lattice architecture

Quantum Information & Computation
Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication

IEEE Transactions on Nanotechnology

Quantified Score

Hi-index	0.00

Visualization

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 [1]. 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.