Almost-Everywhere Superiority for Quantum Computing

Details Almost-Everywhere Superiority for Quantum Computing Almost-Everywhere Superiority for Quantum Computing

1999-10-08

arxiv.org/abs/quant-ph/9910033v4

Physics

Quantum Physics

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Almost-Everywhere Superiority for Quantum Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Almost-Everywhere Superiority for Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost-Everywhere Superiority for Quantum Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-654586