Quantum Lower Bound for Recursive Fourier Sampling
| dc.creator | Aaronson, Scott | |
| dc.date | 2002-09-09 | |
| dc.date | 2004-12-18 | |
| dc.date.accessioned | 2026-07-07T06:04:55Z | |
| dc.date.available | 2026-07-07T06:04:55Z | |
| dc.description | One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algorithm is not far from optimal. The moral is that the need to "uncompute" garbage can impose a fundamental limit on efficient quantum computation. The proof introduces a new parameter of Boolean functions called the "nonparity coefficient," which might be of independent interest. | |
| dc.description | 8 pages. Revised since appearing in QIC, both to correct an error in the definition of the nonparity coefficient and to emphasize the need to uncompute | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0209060 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0209060 | |
| dc.identifier | Quantum Information and Computation 3(2):165-174, 2003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90483 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | Quantum Lower Bound for Recursive Fourier Sampling | |
| dc.type | text |