David A. Meyer
Published 2000-04-24, updated 2000-05-03Version 2
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of games (and hence oracle problems) for which the quantum player can do better than would be possible classically. The most remarkable example is the Bernstein-Vazirani quantum search algorithm which I show creates no entanglement at any timestep.
Comments: 10 pages, plain TeX; to appear in the AMS Contemporary Mathematics volume: Quantum Computation and Quantum Information Science; revised remarks about other quantum games formalisms; for related work see http://math.ucsd.edu/~dmeyer/research.html
An exact relation between number of oracle queries required to solve an oracle problem quantally and quantum retrocausality
Quantum Algorithms and Complexity for Continuous Problems
Calculating Unknown Eigenvalues with a Quantum Algorithm
