Is Fault-Tolerant Quantum Computation Really Possible?

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.
docType_s :
Book sections
S. Luryi, J. Xu, and A. Zaslavsky. Future Trends in Microelectronics. Up the Nano Creek, John Wiley & Sons, pp. 4-18, 2007


http://hal.in2p3.fr/in2p3-00115502
Contributor : Dominique Girod <>
Submitted on : Tuesday, November 21, 2006 - 3:00:39 PM
Last modification on : Wednesday, June 6, 2007 - 12:00:34 PM

Identifiers

Collections

Citation

M.I. Dyakonov. Is Fault-Tolerant Quantum Computation Really Possible?. S. Luryi, J. Xu, and A. Zaslavsky. Future Trends in Microelectronics. Up the Nano Creek, John Wiley & Sons, pp. 4-18, 2007. <in2p3-00115502>

Export

Share

Metrics

Consultation de la notice

11