dorsal/arxiv
View SchemaUniversal fault tolerant quantum computation on bilinear nearest neighbor arrays
| Authors | A. M. Stephens, A. G. Fowler, L. C. L. Hollenberg |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0702201 |
| URL | https://arxiv.org/abs/quant-ph/0702201 |
| Journal | QIC 8, 330 (2008) |
Abstract
Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7,1,3]] quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors, and readout errors are included in our analysis. In the setting where the physical memory failure rate is equal to one-tenth of the physical gate error rate, the physical readout error rate is equal to the physical gate error rate, and the duration of physical readout is ten times the duration of a physical gate, we obtain a lower bound to the asymptotic threshold of 1.96x10^-6.
{
"annotation_id": "630769aa-e565-4243-b73d-320cde049f72",
"date_created": "2026-03-02T18:02:34.664000Z",
"date_modified": "2026-03-02T18:02:34.664000Z",
"file_hash": "6b11e21993f202a67465b8cf9ccc1eb34f56f0d5cbd699ea0eee7643be58ed77",
"private": false,
"record": {
"abstract": "Assuming an array that consists of two parallel lines of qubits and that\npermits only nearest neighbor interactions, we construct physical and logical\ncircuitry to enable universal fault tolerant quantum computation under the\n[[7,1,3]] quantum code. A rigorous lower bound to the fault tolerant threshold\nfor this array is determined in a number of physical settings. Adversarial\nmemory errors, two-qubit gate errors, and readout errors are included in our\nanalysis. In the setting where the physical memory failure rate is equal to\none-tenth of the physical gate error rate, the physical readout error rate is\nequal to the physical gate error rate, and the duration of physical readout is\nten times the duration of a physical gate, we obtain a lower bound to the\nasymptotic threshold of 1.96x10^-6.",
"arxiv_id": "quant-ph/0702201",
"authors": [
"A. M. Stephens",
"A. G. Fowler",
"L. C. L. Hollenberg"
],
"categories": [
"quant-ph"
],
"journal_ref": "QIC 8, 330 (2008)",
"title": "Universal fault tolerant quantum computation on bilinear nearest neighbor arrays",
"url": "https://arxiv.org/abs/quant-ph/0702201"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7af7e1fe-8fbb-474c-a379-0968d0cdee88",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}