
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Fast parallel circuits for the quantum Fourier transform
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
R. Cleve, J. Watrous, "Fast parallel circuits for the quantum Fourier transform," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 526, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892140, author = {R. Cleve and J. Watrous}, title = {Fast parallel circuits for the quantum Fourier transform}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {526}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892140}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Fast parallel circuits for the quantum Fourier transform SN  02725428 SP EP A1  R. Cleve, A1  J. Watrous, PY  2000 KW  circuit complexity; quantum computing; theorem proving; Fourier transforms; fast parallel circuits; quantum Fourier transform; circuit complexity; QFT; upper bound; circuit depth; constant error; depth bound; factoring algorithm; quantum circuits; polynomial size; classical polynomialtime processing; lower bound; depth complexity; arbitrary modulus VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n+log log(1//spl epsiv/)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2/sup n/ with error bounded by /spl epsiv/. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations with constant error. Moreover, our circuits have size O(n log(n//spl epsiv/)). As an application of this depth bound, we show that P. Shor's (1997) factoring algorithm may be based on quantum circuits with depth only O(log n) and polynomial size, in combination with classical polynomialtime pre and postprocessing. Next, we prove an /spl Omega/(log n) lower bound on the depth complexity of approximations of the QFT with constant error. This implies that the above upper bound is asymptotically tight (for a reasonable range of values of /spl epsiv/). We also give an upper bound of O(n(log n)/sup 2/ log log n) on the circuit size of the exact QFT modulo 2/sup n/, for which the best previous bound was O(n/sup 2/). Finally, based on our circuits for the QFT with powerof2 moduli, we show that the QFT with respect to an arbitrary modulus m can be approximated with accuracy /spl epsiv/ with circuits of depth O((log log m)(log log 1//spl epsiv/)) and size polynomial in log m+log(1//spl epsiv/).
Index Terms:
circuit complexity; quantum computing; theorem proving; Fourier transforms; fast parallel circuits; quantum Fourier transform; circuit complexity; QFT; upper bound; circuit depth; constant error; depth bound; factoring algorithm; quantum circuits; polynomial size; classical polynomialtime processing; lower bound; depth complexity; arbitrary modulus
Citation:
R. Cleve, J. Watrous, "Fast parallel circuits for the quantum Fourier transform," focs, pp.526, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.