On Non Efficiency of Quantum Computer
Alicki, Robert
Original · EN
The previously proposed Heisenberg-type relation Ec tc >> ℏ 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.