pith. sign in

arxiv: quant-ph/0411111 · v2 · submitted 2004-11-15 · 🪐 quant-ph

Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication

classification 🪐 quant-ph
keywords errorcommunicationthresholdcomputationgatepenaltyfaultquantum
0
0 comments X
read the original 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-neighbour 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.1x10^-5 without any communication burden is reduced to 1.2x10^-7 when gate errors are the dominant source of error. This ~175X penalty in error threshold translates to an ~13X penalty in the amplitude and timing of gate operation control pulses.

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.