Back to Search
Start Over
Efficient classical simulation of the quantum Fourier transform.
- Source :
-
New Journal of Physics . May2007, Vol. 9 Issue 5, p1-7. 7p. 2 Diagrams. - Publication Year :
- 2007
-
Abstract
- 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). Here 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 (Griffiths and Niu 1996 Phys. Rev. Lett. 76 3228). We use this to analyse the simulability properties of the QFT with a variety of classes of entangled input states. We then discuss the consequences of these results in the context of Shor's factorization algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 13672630
- Volume :
- 9
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- New Journal of Physics
- Publication Type :
- Academic Journal
- Accession number :
- 42323620
- Full Text :
- https://doi.org/10.1088/1367-2630/9/5/146