Fourier transform (QFT). We give an upper bound of Fast

by Richard Cleve , John Watrous

Active Bibliography

45 Fast parallel circuits for the quantum Fourier transform – Richard Cleve, John Watrous - 2000
5 Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation, (A postscript preprint of this paper can be found at http://www.cs.duke.edu/ reif/paper/altcomp.ps – John H. Reif - 1998
21 Information and Computation: Classical and Quantum Aspects – A. Galindo, M. A. Martín-delgado - 2001
330 Simulating Physics with Computers – Richard Feynman, Peter W. Shor - 1982
22 An introduction to quantum complexity theory – Richard Cleve - 2000
Abstract – Robert Beals, Harry Buhrman - 1998
236 Quantum Lower Bounds by Polynomials – Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf - 1998
6 Lower bounds for quantum search and derandomization – Harry Buhrman, Ronald Wolf - 1998
85 An Introduction to Quantum Computing for Non-Physicists – Eleanor Rieffel - 2000
Abstract The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem – Lisa Ruth Hales, Lisa Ruth Hales
19 One Complexity Theorist's View of Quantum Computing – Lance Fortnow - 2000
5 Introduction to Quantum Information Processing – E. Knill, R. Laflamme, H. Barnum, D. Dalvit, J. Dziarmaga, J. Gubernatis, L. Gurvits, G. Ortiz, L. Viola, W. H. Zurek - 2004
Quantum Computing is a Two-Trick Pony – Matthew J. Marjanovic - 1999
4 Analysis of quantum functions – Tomoyuki Yamakami - 1999
Speedup of iterated quantum search by parallel performance – Yuri Ozhigov - 1999
14 Quantum Computation – Dorit Aharonov - 1999
180 Fault-tolerant quantum computation – Peter W. Shor - 1996
3 Quantum computation and quantum information – Marius Nagy, Selim G. Akl - 2006
5 Quantum hidden subgroup algorithms on free groups, (in preparation – Samuel J. Lomonaco, Jr., Louis H. Kauffman