dorsal/arxiv
View SchemaIs Fault-Tolerant Quantum Computation Really Possible?
| Authors | M. I. Dyakonov |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0610117 |
| URL | https://arxiv.org/abs/quant-ph/0610117 |
| Journal | In: Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, and A. Zaslavsky (eds), Wiley (2007), pp. 4-18 |
Abstract
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes, and all the manipulations with qubits are not exact. The purpose of this article, intended for physicists, is to outline the ideas of quantum error correction and to take a look at the proposed technical instruction for fault-tolerant quantum computation. It seems that the mathematics behind the threshold theorem is somewhat detached from the physical reality, and that some ideal elements are always present in the construction. This raises serious doubts about the possibility of large scale quantum computations, even as a matter of principle.
{
"annotation_id": "e805d1d2-a3db-4f1b-913e-26e1c4becc19",
"date_created": "2026-03-02T18:02:30.493000Z",
"date_modified": "2026-03-02T18:02:30.493000Z",
"file_hash": "87f2e2935013d5abb3679a44706791df1c44cb219cfb737cc8e53fc3849f1ffd",
"private": false,
"record": {
"abstract": "The so-called \"threshold\" theorem says that, once the error rate per qubit\nper gate is below a certain value, indefinitely long quantum computation\nbecomes feasible, even if all of the qubits involved are subject to relaxation\nprocesses, and all the manipulations with qubits are not exact. The purpose of\nthis article, intended for physicists, is to outline the ideas of quantum error\ncorrection and to take a look at the proposed technical instruction for\nfault-tolerant quantum computation. It seems that the mathematics behind the\nthreshold theorem is somewhat detached from the physical reality, and that some\nideal elements are always present in the construction. This raises serious\ndoubts about the possibility of large scale quantum computations, even as a\nmatter of principle.",
"arxiv_id": "quant-ph/0610117",
"authors": [
"M. I. Dyakonov"
],
"categories": [
"quant-ph",
"cond-mat.other",
"cond-mat.str-el",
"physics.atom-ph"
],
"journal_ref": "In: Future Trends in Microelectronics. Up the Nano Creek, S.\n Luryi, J. Xu, and A. Zaslavsky (eds), Wiley (2007), pp. 4-18",
"title": "Is Fault-Tolerant Quantum Computation Really Possible?",
"url": "https://arxiv.org/abs/quant-ph/0610117"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "4d00970d-672d-48dc-a142-c77f900e73ca",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}