Semiclassical Fourier Transform for Quantum Computation

Robert B. Griffiths and Chi-Sheng Niu
Phys. Rev. Lett. 76, 3228 – Published 22 April 1996
PDFExport Citation

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.

  • Received 7 November 1995

DOI:https://doi.org/10.1103/PhysRevLett.76.3228

©1996 American Physical Society

Authors & Affiliations

Robert B. Griffiths and Chi-Sheng Niu

  • Department of Physics, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 17 — 22 April 1996

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×