arXiv Analytics

Sign in

arXiv:quant-ph/0610117AbstractReferencesReviewsResources

Is Fault-Tolerant Quantum Computation Really Possible?

M. I. Dyakonov

Published 2006-10-14Version 1

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.

Comments: Based on a talk given at the Future Trends in Microelectronics workshop, Crete, June 2006. 8 pages, 1 figure
Journal: In: Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, and A. Zaslavsky (eds), Wiley (2007), pp. 4-18
Related articles: Most relevant | Search more
arXiv:quant-ph/9905027 (Published 1999-05-07, updated 2000-07-14)
Toward fault-tolerant quantum computation without concatenation
arXiv:2210.13406 [quant-ph] (Published 2022-10-24)
Autonomous quantum error correction and fault-tolerant quantum computation with squeezed cat qubits
arXiv:quant-ph/9705052 (Published 1997-05-28)
Stabilizer Codes and Quantum Error Correction