Fourier transform (QFT). We give an upper bound of Fast
by
Richard Cleve
,
John Watrous
BibTeX
@MISC{Cleve_fouriertransform,
author = {Richard Cleve and John Watrous},
title = {Fourier transform (QFT). We give an upper bound of Fast},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give new bounds on the circuit complexity of the quantum
Citations
| 377 | Logical reversibility of computation - Bennett - 1973 |
| 295 | U.Vazirani, Strengths and weaknesses of quantum computing - Bennett, Brassard - 1997 |
| 179 | Elementary gates for quantum computation - Barenco, Bennett, et al. - 1995 |
| 174 | Fault-tolerant quantum computation with constant error - Aharonov, Ben-Or - 1997 |
| 106 | Log depth circuits for division and related problems - Beame, Cook, et al. - 1984 |
| 95 | Quantum counting - Brassard, Hoyer, et al. - 1998 |
| 55 | Quantum cryptanalysis of hidden linear functions - Boneh, Lipton - 1995 |
| 21 | Algorithmic Number Theory, Volume I: Efficient Algorithms - Bach, Shallit - 1996 |
