Quantum strategies

Details Quantum strategies Quantum strategies

1998-04-03

arxiv.org/abs/quant-ph/9804010v1

Phys.Rev.Lett. 82 (1999) 1052-1055

Physics

Quantum Physics

8 pages, plain TeX, 1 figure

Scientific paper

10.1103/PhysRevLett.82.1052

We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely related to the traditional Matching Pennies game. 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, however, that in our example a player who implements a quantum strategy can increase his expected payoff, and explain the relation to efficient quantum algorithms. We prove that in general a quantum strategy is always at least as good as a classical one, and furthermore that when both players use quantum strategies there need not be any equilibrium, but if both are allowed mixed quantum strategies there must be.

Affiliated with

Also associated with

No associations

Rating

Quantum strategies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum strategies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-482374