Quantum Correlations Can Speed Up All Classical Computation
share
Quantum correlations can provide performance advantages in various tasks. In computation the Hamiltonians and their possibility for creating quantum correlations are often hidden behind computational models that abstract away these details. Here we present a model of computation that explicitly accounts for Hamiltonians and their correlations. Using it, we develop a method which we call coherent parallelisation, that can speed up any possible classical computation by a factor that depends on the classical algorithm. This factor is quadratic in the size of the input for a large set of interesting problems. Hence, this method provides a strong commercial application in the emergent area of quantum technologies. Coherent parallelisation also has important theoretical consequences for both quantum physics and the theory of algorithmic complexity and computability. We anticipate this to be but the first of many important results to stem from our computational model and the surrounding theoretical framework established here.
READ FULL TEXT
