dorsal/arxiv
View SchemaLower Bounds on Quantum Query Complexity
| Authors | Peter Hoyer, Robert Spalek |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0509153 |
| URL | https://arxiv.org/abs/quant-ph/0509153 |
| Journal | Bulletin of the European Association for Theoretical Computer Science, Volume 87, pp. 78-103, Oct. 2005 |
Abstract
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods.
{
"annotation_id": "abdb7064-0072-4764-9218-528f1c81292c",
"date_created": "2026-03-02T18:02:20.736000Z",
"date_modified": "2026-03-02T18:02:20.736000Z",
"file_hash": "438bf1ab403e67c2c48fd0e098319fe02446c4b3fca92326140f39ff4b75e4bf",
"private": false,
"record": {
"abstract": "Shor\u0027s and Grover\u0027s famous quantum algorithms for factoring and searching\nshow that quantum computers can solve certain computational problems\nsignificantly faster than any classical computer. We discuss here what quantum\ncomputers_cannot_ do, and specifically how to prove limits on their\ncomputational power. We cover the main known techniques for proving lower\nbounds, and exemplify and compare the methods.",
"arxiv_id": "quant-ph/0509153",
"authors": [
"Peter Hoyer",
"Robert Spalek"
],
"categories": [
"quant-ph"
],
"journal_ref": "Bulletin of the European Association for Theoretical Computer\n Science, Volume 87, pp. 78-103, Oct. 2005",
"title": "Lower Bounds on Quantum Query Complexity",
"url": "https://arxiv.org/abs/quant-ph/0509153"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "67e376f3-e455-49f4-bee6-885809717393",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}