Phys. Rev. Lett. 76, 3228–3231 (1996)Semiclassical Fourier Transform for Quantum ComputationReceived 7 November 1995; published in the issue dated 22 April 1996 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. © 1996 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.76.3228
DOI:
10.1103/PhysRevLett.76.3228
PACS:
89.80.+h, 03.65.Bz
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.