摘要: A class of problems is described which can be solved more efficiently by quantum computation than any classical or stochastic method. The solves the problem with certainty in exponentially less time deterministic computation.
harvard.edu
core.ac.uk
bristol.ac.uk
royalsocietypublishing.org
acm.org 
sci-hub.se 参考文章(3)
Roger Penrose, C. J. Isham, Quantum Concepts in Space and Time Clarendon Press. ,(1986)
Quantum theory, the Church-Turing principle and the universal quantum computer Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences. ,vol. 400, pp. 97- 117 ,(1985) , 10.1098/RSPA.1985.0070
Characterizing classes of functions computable by quantum parallelism Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences. ,vol. 435, pp. 563- 574 ,(1991) , 10.1098/RSPA.1991.0161