%0 Book Section
%T Is Fault-Tolerant Quantum Computation Really Possible?
%+ Laboratoire de Physique Théorique et Astroparticules (LPTA)
%A Dyakonov, M.I.
%Z Based on a talk given at the Future Trends in Microelectronics workshop, Crete, June 2006. 8 pages, 1 figure
%Z PTA/06-51
%B Future Trends in Microelectronics. Up the Nano Creek
%E S. Luryi
%E J. Xu
%E and A. Zaslavsky
%I John Wiley & Sons
%P pp. 4-18
%8 2007
%D 2007
%Z quant-ph/0610117
%K Quantum Physics
%K Condensed Matter
%K Strongly Correlated Electrons
%K Atomic Physics
%Z Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]
%Z Physics [physics]/Quantum Physics [quant-ph]Book sections
%X 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.
%G English
%L in2p3-00115502
%U https://hal.in2p3.fr/in2p3-00115502
%~ IN2P3
%~ LPTA
%~ CNRS
%~ UNIV-MONTP2
%~ UNIV-MONTPELLIER
%~ UM1-UM2