量子计算的几乎处处量子性
Almost-Everywhere Superiority for Quantum Computing
摘要：
西蒙（Simon）在被贝纳德和霍耶（Høyer）扩展后指出，在某些任务上，多项式时间量子机器的速度比经典机器的速度要快得多。本文表明，在某些任务上，多项式时间量子机器几乎在任何地方都比每个经典机器快。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
