Efficient classical simulation of the semi-classical Quantum Fourier Transform

Details Efficient classical simulation of the semi-classical Quantum Fourier Transform Efficient classical simulation of the semi-classical Quantum Fourier Transform

2006-12-03

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

New J. Phys. 9 146 (2007).

Physics

Quantum Physics

4 pages, 2 figures. Comments welcome

Scientific paper

10.1088/1367-2630/9/5/146

A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability of the quantum Fourier transform (QFT). In this note, we show that one can demonstrate a number of simulability results for QFT circuits in a straightforward manner using Griffiths and Niu's semi-classical QFT construction [Phys. Rev. Lett. 76, 3228 (1996)]. We then discuss the consequences of these results in the context of Shor's factorisation algorithm.

Affiliated with

Also associated with

No associations

Rating

Efficient classical simulation of the semi-classical Quantum Fourier Transform 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 Efficient classical simulation of the semi-classical Quantum Fourier Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient classical simulation of the semi-classical Quantum Fourier Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-649703