By Topic

Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

8 Author(s)
T. Szkopek ; Dept. of Electr. Eng., Univ. of California, Los Angeles, CA, USA ; P. O. Boykin ; Heng Fan ; V. P. Roychowdhury
more authors

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.

Published in:

IEEE Transactions on Nanotechnology  (Volume:5 ,  Issue: 1 )