Quantum algorithms revisited
- 8 January 1998
- journal article
- Published by The Royal Society in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 454 (1969) , 339-354
- https://doi.org/10.1098/rspa.1998.0164
Abstract
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Semiclassical Fourier Transform for Quantum ComputationPhysical Review Letters, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Optimal Extraction of Information from Finite Quantum EnsemblesPhysical Review Letters, 1995
- Quantum Cryptanalysis of Hidden Linear FunctionsPublished by Springer Nature ,1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985