Theory of the Quantum Speed Up

Abstract

Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum measurement performs a computation that dynamical computation cannot accomplish as efficiently.

10 pages, RevTex, 1 page of 3 figures

References in corpus (1)

• Quantum Algorithms Revisited

Cited by in corpus (10)

• The quantum correlation between the selection of the problem and that of the solution sheds light on the mechanism of the quantum speed up
• Quantum algorithms know in advance 50% of the solution they will find in the future
• The 50% advanced information rule of the quantum algorithms
• Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
• A relational time-symmetric framework for analyzing the quantum computational speedup
• The quantum speed up as advanced knowledge of the solution
• Scattering solution of interacting Hamiltonian for electronic control of molecular spin qubits
• Quantum computation and the physical computation level of biological information processing
• Completing the physical representation of quantum algorithms provides a retrocausal explanation of their speedup
• Unobservable causal loops as a way to explain both the quantum computational speedup and quantum nonlocality