Devon Hjelm Notes/070910

From OpenWetWare

Jump to: navigation, search

=The Prisoner Dilemma

Following this paper on the arxiv.

The classical prisoner dilemma goes as follows: the prisoners have hatched a plan to escape (or some similar situation but this is the one i'll use). Each prisoner has the option either to cooperate (C) or defect (D). The plan only succeeds if both cooperate, but with <1 probability. However, if one rats the other out they are freed while the other gets a greatly increased sentence. If they both rat each other out, then they both receive slightly worse sentences. An example payoff martix could be:

Payoff matrix
Bob:C Bob:D
Alice:C (3,3) (0,5)
Alice:D (5,0) (1,1)

where the entries in the parenthesis are the payoffs to Alice and Bob respectively.
The dilemma goes as follows. Say both Alice and Bob agree to cooperate with a payoff of 3 for each. In reality, since either can defect the state of the system is some combination of both. Each prisoner quickly figures out that whatever state the other prisoner is in, they're better off if they defect. So the Nash equilibrium of the system is for each to defect with a payoff of 1 each. However, the better situation (they both cooperate) is not equilibrium, therefore it is inefficient.

In the quantum equivalent, both players share an entangled pair of qubits. Say the initial state of the system is  |\Psi_0 \rangle = |C \rangle |C \rangle . The states are then entangled by some operator \mathcal{J} over both qubits. To make the game fair, \mathcal{J} should be symmetric over both players. Each player is then allowed to do a unitary transformation on their qubit:

\hat{U(\theta , \phi)} = 
\left( \begin{array}{cc}
e^{i \phi} cos(\theta / 2) & sin(\theta / 2) \\
sin(\theta / 2) & e^{-i \phi} cos(\theta / 2) \\
\end{array} 
\right)

The state is then unentangled with a Failed to parse (unknown function\dag): \mathcal{J}^\dag

operation and then the qubits are measured with Stern-Gerlaker device:

Failed to parse (unknown function\dag): |\Psi_f \rangle = \mathcal{J}^\dag \hat{U}_A \otimes \hat{U}_B \mathcal{J} |C \rangle |C \rangle


To ensure that the problem still corresponds to the classical case, the unitary operators should commute with the classical choices, that is

\hat{C} = \hat{U(0 , 0)} = 
\left( \begin{array}{cc}
1 & 0 \\
0 & 1 \\
\end{array} 
\right)


\hat{D} = \hat{U(\pi , 0)} = 
\left( \begin{array}{cc}
0 & 1 \\
-1 & 0 \\
\end{array} 
\right)

and  \left[ \mathcal{J}, \hat{D} \otimes \hat{D} \right] = \left[ \mathcal{J}, \hat{C} \otimes \hat{D} \right] = \left[ \mathcal{J}, \hat{D} \otimes \hat{C} \right] = 0

Because quantum mechanics is probabilistic, the expected payoff for Alice is $ = rPCC + pPDD + tPDC + sPCD where r,p,t,and s are the payoffs 3,1,5,and 0 respectively. This is Alice's strategy, and she needs to maximize her expected payoff in the problem.

Personal tools