arXiv · quant-ph/9910033
Almost-Everywhere Superiority for Quantum Computing
Abstract
Simon as extended by Brassard and Hø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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand. 2000-04-29. Almost-Everywhere Superiority for Quantum Computing. https://searcharxiv.com/abs/quant-ph/9910033
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.