s'authentifier
version française rss feed
HAL : in2p3-00115502, version 1

Fiche concise  Récupérer au format
Is Fault-Tolerant Quantum Computation Really Possible?
Dyakonov M.I.
Dans Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, and A. Zaslavsky (Ed.) (2007) pp. 4-18 - http://hal.in2p3.fr/in2p3-00115502
Physique/Matière Condensée/Autre
Physique/Physique Quantique
Is Fault-Tolerant Quantum Computation Really Possible?
M.I. Dyakonov1
1 :  LPTA - Laboratoire de Physique Théorique et Astroparticules
http://www.lpta.in2p3.fr/
CNRS : UMR5207 – IN2P3 – Université Montpellier II - Sciences et techniques
Bât 13- 1er Et. - CC 070 Place Eugène Bataillon 34095 MONTPELLIER CEDEX 5
France
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.

Chapitres d'ouvrages scientifiques
2007
Future Trends in Microelectronics. Up the Nano Creek
S. Luryi, J. Xu, and A. Zaslavsky
pp. 4-18
John Wiley & Sons

PTA/06-51
Based on a talk given at the Future Trends in Microelectronics workshop, Crete, June 2006. 8 pages, 1 figure
Quantum Physics – Condensed Matter – Strongly Correlated Electrons – Atomic Physics
Lien vers le texte intégral : 
http://fr.arXiv.org/abs/quant-ph/0610117