Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication
Szkopek, T.
Boykin, P.O.
Heng Fan
Roychowdhury, V.P.
Yablonovitch, E.
Simms, G.
Gyure, M.
Fong, B.
Dept. of Electr. Eng., Univ. of California, Los Angeles, CA, USA;
This paper appears in: Nanotechnology, IEEE Transactions on
Publication Date: Jan. 2006
Volume: 5,
Issue: 1
On page(s): 42- 49
ISSN: 1536-125X
INSPEC Accession Number: 8730711
Digital Object Identifier: 10.1109/TNANO.2005.861402
Current Version Published: 2006-01-16
Abstract
The error threshold for fault-tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest neighbor communication, which requires excess gate operations. For a qubit stripe with a width of L+1 physical qubits implementing L levels of concatenation, we find that the error threshold of 2.1×10-5 without any communication burden is reduced to 1.2×10-7 when gate errors are the dominant source of error. This ∼175× penalty in error threshold translates to an ∼13× penalty in the amplitude and timing of gate operation control pulses.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
