Almost-Everywhere Superiority for Quantum Computing
Quantum Physics
2007-05-23 v4 Computational Complexity
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.
Keywords
Cite
@article{arxiv.quant-ph/9910033,
title = {Almost-Everywhere Superiority for Quantum Computing},
author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Marius Zimand},
journal= {arXiv preprint arXiv:quant-ph/9910033},
year = {2007}
}
Comments
16 pages