Rapid solution of problems by quantum computation
- 8 December 1992
- journal article
- Published by The Royal Society in Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
- Vol. 439 (1907) , 553-558
- https://doi.org/10.1098/rspa.1992.0167
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.Keywords
This publication has 2 references indexed in Scilit:
- Characterizing classes of functions computable by quantum parallelismProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1991
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985