Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
| dc.creator | Szkopek, T. | |
| dc.creator | Boykin, P. O. | |
| dc.creator | Fan, H. | |
| dc.creator | Roychowdhury, V. | |
| dc.creator | Yablonovitch, E. | |
| dc.creator | Simms, G. | |
| dc.creator | Gyure, M. | |
| dc.creator | Fong, B. | |
| dc.date | 2004-11-15 | |
| dc.date | 2005-09-08 | |
| dc.date.accessioned | 2026-07-07T06:25:25Z | |
| dc.date.available | 2026-07-07T06:25:25Z | |
| dc.description | 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. | |
| dc.description | minor correction | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0411111 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0411111 | |
| dc.identifier | IEEE Trans. Nano., Vol. 5, No. 1, pp 42-49, 2006 | |
| dc.identifier | doi:10.1109/TNANO.2005.861402 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/96825 | |
| dc.subject | Quantum Physics | |
| dc.title | Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication | |
| dc.type | text |