On Non Efficiency of Quantum Computer

2000/06/19 by Robert Alicki, Alicki, Robert
Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0006080

4 pages, Revtex, no figures

arxiv created 2000/06/19 · arxiv updated 2009/12/01

Abstract

The previously proposed Heisenberg-type relation E_c t_c >> ℏ \cal C for the energy used by a quantum computer, the total computation time and the logical ("classical") complexity of the problem is verified for the following examples of quantum computations: preparation of the input state, two Hamiltonian versions of the Grover's algorithm, a model of "quantum telephone directory", a quantum-optical device factorizing numbers and the Shor's algorithm.

Related

• Can quantum computer perform better than classical?
• Remarks on the nature of quantum computation
• The Quantum Cramér-Rao lower bound (Why quantum computers won't work I)
• An Introduction to Quantum Computing for Non-Physicists
• The Argument against Quantum Computers