Rapid solution of problems by quantum computation

A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in exponentially less time than any classical deterministic computation.

[1]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[2]  R. Penrose,et al.  Quantum Concepts in Space and Time , 1986 .

[3]  R. Jozsa.  Characterizing classes of functions computable by quantum parallelism , 1991, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.