Loading [MathJax]/extensions/MathZoom.js
On the power of quantum computation | IEEE Conference Publication | IEEE Xplore

On the power of quantum computation


Abstract:

The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a qua...Show More

Abstract:

The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. We present here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class. We thus offer compelling evidence that the quantum model may have significantly more complexity theoretic power than the probabilistic Turing Machine. In fact, drawing on this work, Shor (1994) has recently developed remarkable new quantum polynomial-time algorithms for the discrete logarithm and integer factoring problems.<>
Date of Conference: 20-22 November 1994
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-8186-6580-7
Conference Location: Santa Fe, NM, USA

References

References is not available for this document.