Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
Specified precision polynomial root isolation is in NC
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An efficient algorithm for the complex roots problem
Journal of Complexity
Space-bounded Quantum complexity
Journal of Computer and System Sciences
Quantum computation and quantum information
Quantum computation and quantum information
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On Approximate Majority and Probabilistic Time
Computational Complexity
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
The Coin Problem and Pseudorandomness for Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Pseudorandom Generators for Regular Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
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.