Phys. Rev. Lett. 82, 1052–1055 (1999)

Quantum Strategies

Abstract

References

Citing Articles (136)

Download: PDF (111 kB) Buy this article Export: BibTeX or EndNote (RIS)

David A. Meyer^*
Project in Geometry and Physics, Department of Mathematics, University of California/San Diego, La Jolla, California 92093-0112 and Center for Social Computation/Institute for Physical Sciences, Los Alamos, New Mexico 87545

Received 4 August 1998; published in the issue dated 1 February 1999

We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). While not every two-person zero-sum finite game has an equilibrium in the set of pure strategies, von Neumann showed that there is always an equilibrium at which each player follows a mixed strategy. A mixed strategy deviating from the equilibrium strategy cannot increase a player's expected payoff. We show by example, however, that a player who implements a quantum strategy can increase his expected payoff, and explain the relation to efficient quantum algorithms.

URL:

http://link.aps.org/doi/10.1103/PhysRevLett.82.1052

DOI:

10.1103/PhysRevLett.82.1052

PACS:

03.67.-a, 02.50.Le, 03.65.-w, 89.80.+h

^*Electronic address: dmeyer@chonji.ucsd.edu

Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.

Citation Search:

Phys. Rev. Lett. 82, 1052–1055 (1999)

Quantum Strategies

See Also