Semiclassical Fourier Transform for Quantum Computation
- 22 April 1996
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 76 (17) , 3228-3231
- https://doi.org/10.1103/physrevlett.76.3228
Abstract
It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for factorization on a quantum computer can be carried out in a semiclassical way by using the “classical” (macroscopic) signal resulting from measuring one bit to determine the type of measurement carried out on the next bit, and so forth. In this way all the two-bit gates in the Fourier transform can be replaced by a smaller number of one-bit gates controlled by classical signals. This suggests that it may be worthwhile looking for other uses of semiclassical methods in quantum computing.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Quantum ComputationScience, 1995
- Quantum Information and ComputationPhysics Today, 1995
- Almost Any Quantum Logic Gate is UniversalPhysical Review Letters, 1995
- Universality in quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Realizable Universal Quantum Logic GatesPhysical Review Letters, 1995
- Quantum Computations with Cold Trapped IonsPhysical Review Letters, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Two-bit gates are universal for quantum computationPhysical Review A, 1995
- A Potentially Realizable Quantum ComputerScience, 1993
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985