Advice Coins for Classical and Quantum Computation
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.
KeywordsBQP finite automata finite-precision arithmetic PSPACE Quantum Computation root-finding
Unable to display preview. Download preview PDF.
- 1.Aaronson, S.: BQP and the polynomial hierarchy. In: Proc. 42nd ACM STOC (2010)Google Scholar
- 8.Braverman, M., Rao, A., Raz, R., Yehudayoff, A.: Pseudorandom generators for regular branching programs. In: Proc. 51st IEEE FOCS (2010)Google Scholar
- 9.Brody, J., Verbin, E.: The coin problem, and pseudorandomness for branching programs. In: Proc. 51st IEEE FOCS (2010)Google Scholar
- 11.Galvao, E.F., Hardy, L.: Substituting a qubit for an arbitrarily large number of classical bits. Phys. Rev. Lett. 90(087902) (2003)Google Scholar
- 12.Hellman, E.M.: Learning with finite memory. PhD thesis, Stanford University, Department of Electrical Engineering (1969)Google Scholar
- 18.Pan, V.Y.: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros. In: Proc. 27th ACM STOC, pp. 741–750 (1995)Google Scholar
- 19.Terhal, B., DiVincenzo, D.: On the problem of equilibration and the computation of correlation functions on a quantum computer. Phys. Rev. A 61(022301) (2000)Google Scholar
- 21.Viola., E.: Randomness buys depth for approximate counting. Electronic Colloquium on Computational Complexity (ECCC), TR10-175 (2010)Google Scholar