|
| related topics |
| {algorithm, log, probability} |
| {time, systems, information} |
| {let, theorem, proof} |
| {equation, function, exp} |
|
Almost-Everywhere Superiority for Quantum Computing
Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/9910033
- categories:
- quant-ph cs.CC
- comments:
- 16 pages
- arxiv_id:
- quant-ph/9910033
- report_no:
- Revised version of URCS-TR-99-720
- created:
- 1999-10-07
- updated:
- 2000-04-29
Full article ▸
|
|
| related documents |
| 0408119v1 |
| 0703231v2 |
| 0603135v1 |
| 9904079v3 |
| 0510230v3 |
| 0510185v1 |
| 0504083v2 |
| 0408150v2 |
| 9802040v2 |
| 0008059v3 |
| 0410042v1 |
| 0612089v3 |
| 0607148v3 |
| 0403140v2 |
| 0304131v1 |
| 0010034v1 |
| 0210077v1 |
| 0207131v1 |
| 0511272v1 |
| 0505007v3 |
| 0206023v2 |
| 0504067v3 |
| 0201152v1 |
| 0206089v2 |
| 0302022v1 |
|