dorsal/arxiv
View SchemaTwo Classical Queries versus One Quantum Query
| Authors | Wim van Dam |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9806090 |
| URL | https://arxiv.org/abs/quant-ph/9806090 |
Abstract
In this note we study the power of so called query-limited computers. We compare the strength of a classical computer that is allowed to ask two questions to an NP-oracle with the strength of a quantum computer that is allowed only one such query. It is shown that any decision problem that requires two parallel (non-adaptive) SAT-queries on a classical computer can also be solved exactly by a quantum computer using only one SAT-oracle call, where both computations have polynomial time-complexity. Such a simulation is generally believed to be impossible for a one-query classical computer. The reduction also does not hold if we replace the SAT-oracle by a general black-box. This result gives therefore an example of how a quantum computer is probably more powerful than a classical computer. It also highlights the potential differences between quantum complexity results for general oracles when compared to results for more structured tasks like the SAT-problem.
{
"annotation_id": "d8aecb61-0d6f-454e-9071-8d60a8add0bc",
"date_created": "2026-03-02T18:02:44.335000Z",
"date_modified": "2026-03-02T18:02:44.335000Z",
"file_hash": "b58f39a6e05884108676c5ad330badc0b49d0df3550981077470c6a9826ea892",
"private": false,
"record": {
"abstract": "In this note we study the power of so called query-limited computers. We\ncompare the strength of a classical computer that is allowed to ask two\nquestions to an NP-oracle with the strength of a quantum computer that is\nallowed only one such query. It is shown that any decision problem that\nrequires two parallel (non-adaptive) SAT-queries on a classical computer can\nalso be solved exactly by a quantum computer using only one SAT-oracle call,\nwhere both computations have polynomial time-complexity. Such a simulation is\ngenerally believed to be impossible for a one-query classical computer. The\nreduction also does not hold if we replace the SAT-oracle by a general\nblack-box. This result gives therefore an example of how a quantum computer is\nprobably more powerful than a classical computer. It also highlights the\npotential differences between quantum complexity results for general oracles\nwhen compared to results for more structured tasks like the SAT-problem.",
"arxiv_id": "quant-ph/9806090",
"authors": [
"Wim van Dam"
],
"categories": [
"quant-ph",
"cs.CC"
],
"title": "Two Classical Queries versus One Quantum Query",
"url": "https://arxiv.org/abs/quant-ph/9806090"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7a9ebbcf-a5bd-4566-b532-c7aeeca44ec5",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}