You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Rapid Solution of Problems by Quantum Computation
David Deutsch and Richard Jozsa
Proceedings: Mathematical and Physical Sciences
Vol. 439, No. 1907 (Dec. 8, 1992), pp. 553-558
Published by: Royal Society
Stable URL: http://www.jstor.org/stable/52182
Page Count: 6
You can always find the topics here!Topics: Quantum computers, Oracles, Mathematical problems, Algorithms, Quantum efficiency, Polynomials, Approximation, Stochastic methods, Turing machines, Computer technology
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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.
Proceedings: Mathematical and Physical Sciences © 1992 Royal Society