dorsal/arxiv
View SchemaAlmost-Everywhere Superiority for Quantum Computing
| Authors | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9910033 |
| URL | https://arxiv.org/abs/quant-ph/9910033 |
Abstract
Simon as extended by Brassard and H{\o}yer shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine almost everywhere.
{
"annotation_id": "8d9325d8-07c4-4d0a-98bd-94f4ec3083ec",
"date_created": "2026-03-02T18:02:48.300000Z",
"date_modified": "2026-03-02T18:02:48.300000Z",
"file_hash": "ea96730a33d6e8221faebae75c5c844977bf54f46991c96ac6600bfa1db44198",
"private": false,
"record": {
"abstract": "Simon as extended by Brassard and H{\\o}yer shows that there are tasks on\nwhich polynomial-time quantum machines are exponentially faster than each\nclassical machine infinitely often. The present paper shows that there are\ntasks on which polynomial-time quantum machines are exponentially faster than\neach classical machine almost everywhere.",
"arxiv_id": "quant-ph/9910033",
"authors": [
"Edith Hemaspaandra",
"Lane A. Hemaspaandra",
"Marius Zimand"
],
"categories": [
"quant-ph",
"cs.CC"
],
"title": "Almost-Everywhere Superiority for Quantum Computing",
"url": "https://arxiv.org/abs/quant-ph/9910033"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "507e17de-94c9-40f8-b01d-d903fa689f79",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}