Almost-Everywhere Superiority for Quantum Computing

Simple item page
dc.creatorHemaspaandra, Edith
dc.creatorHemaspaandra, Lane A.
dc.creatorZimand, Marius
dc.date1999-10-08
dc.date2000-04-29
dc.date.accessioned2026-07-07T06:17:01Z
dc.date.available2026-07-07T06:17:01Z
dc.descriptionSimon 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/9910033
dc.identifierhttp://arxiv.org/abs/quant-ph/9910033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94265
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleAlmost-Everywhere Superiority for Quantum Computing
dc.typetext

Files

Collections

arXiv