dorsal/arxiv
View SchemaQubit Complexity of Continuous Problems
| Authors | A. Papageorgiou, J. F. Traub |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0512082 |
| URL | https://arxiv.org/abs/quant-ph/0512082 |
Abstract
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity
{
"annotation_id": "fca07d1a-578c-4cde-8851-d45defcd5198",
"date_created": "2026-03-02T18:02:24.249000Z",
"date_modified": "2026-03-02T18:02:24.249000Z",
"file_hash": "b298ffad317fd96f524d566f27d88b799a0a7d74fdefab6eeb7b6a731de5b5fd",
"private": false,
"record": {
"abstract": "The number of qubits used by a quantum algorithm will be a crucial\ncomputational resource for the foreseeable future. We show how to obtain the\nclassical query complexity for continuous problems. We then establish a simple\nformula for a lower bound on the qubit complexity in terms of the classical\nquery complexity",
"arxiv_id": "quant-ph/0512082",
"authors": [
"A. Papageorgiou",
"J. F. Traub"
],
"categories": [
"quant-ph"
],
"title": "Qubit Complexity of Continuous Problems",
"url": "https://arxiv.org/abs/quant-ph/0512082"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9b5bf918-185c-4b92-b9e5-880953938855",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}