arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1101.5355quant-phcs.CC
收藏

经典和量子计算的建议币

Advice Coins for Classical and Quantum Computation

Scott Aaronson, Andrew Drucker

摘要:

我们研究配备非均匀建议的经典和量子算法的力量,其形式是硬币,其偏见编码有用的信息。这个问题在量子情况下特别重要,因为我们证明了一个令人惊讶的结果:只有两个状态的量子有限自动机可以对硬币偏差的任意微小变化敏感。这与经典的概率有限自动机形成了鲜明对比,后者对硬币偏差变化的敏感性受到Hellman和Cover在1970年的经典结果的限制。尽管有这一发现,但我们能够将建议币的力量限制在空间有限的经典和量子计算中。我们定义类BPPSPACE/硬币和BQPSPACE/硬币,经典和量子多项式空间机器的建议硬币的语言可判定。我们的主要定理是,这两个类符合PSPACE/poly。证明这一结果需要大量的机器。我们使用一个算法由于内夫找到根的多项式在NC;结果从代数几何,下界分离的多项式的根;和结果的不动点的超算子由于Aaronson和Watrous,最初证明的背景下,量子计算封闭的类时曲线。

英文摘要:

We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particular importance in the quantum case, due to a surprising result that we prove: a quantum finite automaton with just two states can be sensitive to arbitrarily small changes in a coin's bias. This contrasts with classical probabilistic finite automata, whose sensitivity to changes in a coin's bias is bounded by a classic 1970 result of Hellman and Cover. Despite this finding, we are able to bound the power of advice coins for space-bounded classical and quantum computation. We define the classes BPPSPACE/coin and BQPSPACE/coin, of languages decidable by classical and quantum polynomial-space machines with advice coins. Our main theorem is that both classes coincide with PSPACE/poly. Proving this result turns out to require substantial machinery. We use an algorithm due to Neff for finding roots of polynomials in NC; a result from algebraic geometry that lower-bounds the separation of a polynomial's roots; and a result on fixed-points of superoperators due to Aaronson and Watrous, originally proved in the context of quantum computing with closed timelike curves.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑