On Non Efficiency of Quantum Computer
arXiv:quant-ph/0006080
Abstract
The previously proposed Heisenberg-type relation 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.
4 pages, Revtex, no figures