dorsal/arxiv
View SchemaThreshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
| Authors | T. Szkopek, P. O. Boykin, H. Fan, V. Roychowdhury, E. Yablonovitch, G. Simms, M. Gyure, B. Fong |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0411111 |
| URL | https://arxiv.org/abs/quant-ph/0411111 |
| DOI | 10.1109/TNANO.2005.861402 |
| Journal | IEEE Trans. Nano., Vol. 5, No. 1, pp 42-49, 2006 |
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.
{
"annotation_id": "cb53ab73-b0a7-4654-b2f0-8243185694d3",
"date_created": "2026-03-02T18:02:13.563000Z",
"date_modified": "2026-03-02T18:02:13.563000Z",
"file_hash": "6618637f1726fcfeb222c680694505a778186ee1b76b0aaa543c3240c0a45cf9",
"private": false,
"record": {
"abstract": "The error threshold for fault tolerant quantum computation with concatenated\nencoding of qubits is penalized by internal communication overhead. Many\nquantum computation proposals rely on nearest-neighbour communication, which\nrequires excess gate operations. For a qubit stripe with a width of L+1\nphysical qubits implementing L levels of concatenation, we find that the error\nthreshold of 2.1x10^-5 without any communication burden is reduced to 1.2x10^-7\nwhen gate errors are the dominant source of error. This ~175X penalty in error\nthreshold translates to an ~13X penalty in the amplitude and timing of gate\noperation control pulses.",
"arxiv_id": "quant-ph/0411111",
"authors": [
"T. Szkopek",
"P. O. Boykin",
"H. Fan",
"V. Roychowdhury",
"E. Yablonovitch",
"G. Simms",
"M. Gyure",
"B. Fong"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TNANO.2005.861402",
"journal_ref": "IEEE Trans. Nano., Vol. 5, No. 1, pp 42-49, 2006",
"title": "Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication",
"url": "https://arxiv.org/abs/quant-ph/0411111"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d54d1f76-ea43-41d7-85a1-3038edb7c949",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}