Semiclassical Fourier Transform for Quantum Computation

Details Semiclassical Fourier Transform for Quantum Computation Semiclassical Fourier Transform for Quantum Computation

1995-11-07

arxiv.org/abs/quant-ph/9511007v1

Phys.Rev.Lett. 76 (1996) 3228-3231

Physics

Quantum Physics

Latex 6 pages, two figures on one page in uuencoded Postscript

Scientific paper

10.1103/PhysRevLett.76.3228

Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a ``classical'' (macroscopic) signal resulting from the measurement of one bit (embodied in a two-state quantum system) is employed to determine the type of measurement carried out on the next bit, and so forth. In this way the two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals. Success in simplifying the Fourier transform suggests that it may be worthwhile looking for other ways of using semi-classical methods in quantum computing.

Affiliated with

Also associated with

No associations

Rating

Semiclassical Fourier Transform for Quantum Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semiclassical Fourier Transform for Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semiclassical Fourier Transform for Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67749