2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/94265Simon 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.16 pagesQuantum PhysicsComputational Complexitytext