Abstract
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.
Reference4 articles.
1. Quantum theory, the Church–Turing principle and the universal quantum computer
2. Deutsch D. 1986 In Quantum concepts in space and time (ed. C. J. Isham & R. Penrose). Oxford University Press.
3. Garey M. R. & Johnson D. S. 1979 Computers and intractability. New York: W. H. Freeman.
4. Characterizing classes of functions computable by quantum parallelism
Cited by
1591 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献