dorsal/arxiv
View SchemaQuantum Lower Bound for Recursive Fourier Sampling
| Authors | Scott Aaronson |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0209060 |
| URL | https://arxiv.org/abs/quant-ph/0209060 |
| Journal | Quantum Information and Computation 3(2):165-174, 2003 |
Abstract
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.
{
"annotation_id": "b16152c5-f597-4cc5-9216-d450ca8ef000",
"date_created": "2026-03-02T18:01:52.626000Z",
"date_modified": "2026-03-02T18:01:52.626000Z",
"file_hash": "1897c8bd9c6f22a1133f9832896a61ed66ff275e51927e969aeef9e4876c293c",
"private": false,
"record": {
"abstract": "One of the earliest quantum algorithms was discovered by Bernstein and\nVazirani, for a problem called Recursive Fourier Sampling. This paper shows\nthat the Bernstein-Vazirani algorithm is not far from optimal. The moral is\nthat the need to \"uncompute\" garbage can impose a fundamental limit on\nefficient quantum computation. The proof introduces a new parameter of Boolean\nfunctions called the \"nonparity coefficient,\" which might be of independent\ninterest.",
"arxiv_id": "quant-ph/0209060",
"authors": [
"Scott Aaronson"
],
"categories": [
"quant-ph",
"cs.CC"
],
"journal_ref": "Quantum Information and Computation 3(2):165-174, 2003",
"title": "Quantum Lower Bound for Recursive Fourier Sampling",
"url": "https://arxiv.org/abs/quant-ph/0209060"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "df84264e-454f-4270-9174-6394f868f4cd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}