Quantum game theory
Quantum game theory is an extension of classical game theory to the quantum domain.
≈ 8 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Quantum game theory is an extension of classical game theory to the quantum domain. It differs from classical game theory in three primary ways: #Superposed initial states, #Quantum entanglement of initial states, #Superposition of strategies to be used on the initial states. This theory is based on the physics of information much like quantum computing.
Quantum game theory is an extension of classical game theory to the quantum domain. It differs from classical game theory in three primary ways: Superposed initial states, Quantum entanglement of initial states, Superposition of strategies to be used on the initial states.
This theory is based on the physics of information much like quantum computing. g_n(\alpha) = (1-\alpha)^{n-1} (2n \alpha + 1 - \alpha) - 1. In 2024, a quantum variant of the classical volunteer's dilemma is introduced with b=2 and c=1 is studied, generalizing the classical setting by allowing players to utilize quantum strategies.
This is achieved by employing the Eisert–Wilkens–Lewenstein quantization framework. In this setting, the players received an entangled n-qubit state with each player controlling one qubit. The decision of each player can be viewed as determining two angles.
Symmetric Nash equilibria that attain a payoff value of 2-1/n for each player is shown and each player volunteers at this Nash Equilibrium. Furthermore, these Nash Equilibrium are Pareto optimal. It is shown that the payoff function of Nash equilibrium in the quantum setting is higher than the payoff of Nash equilibrium in the classical setting.
Quantum Card Game A classically unfair card game can be played as follows: There are two players, Alice and Bob. Alice has three cards: one has a star on both sides, one has a diamond on both sides, and one has a star on one side and a diamond on the other side.
Alice places the three cards in a box and shakes it up, then Bob draws a card so that both players can only see one side of the card. If the card has the same markings on both sides, Alice wins. But if the card has different markings on each side, Bob wins.
Clearly, this is an unfair game, where Alice has a probability of winning of 2/3 and Bob has a probability of winning of 1/3. Alice gives Bob one chance to "operate" on the box and then allows him to withdraw from the game if he would like, but he can only classically obtain information on one card from this operation, so the game is still unfair.
However, Alice and Bob can play a version of this game adjusted to allow for quantum strategies. If we describe the state of a card with a diamond facing up as |0\rangle and the state where the star is facing up as |1\rangle , after shaking the box up, we can describe the state of the face-up part of the cards as: |r\rangle = |r_0 \ r_1 \ r_2\rangle where each r_k is either 0 or 1.
Now, Bob can take advantage of his ability to operate on the box by constructing a machine as follows: First, he has a unitary matrix defined as U_k = \begin{bmatrix} 1 & 0 \\ 0 & e ^{i \pi r_k} \end{bmatrix} . This matrix is equal to I if r_k is 0 and Z if r_k is 1.
He then creates his machine by putting this matrix between two Hadamard gates, so his machine now looks as HU_kH = \frac{1}{2} \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 0 & e ^{i \pi r_k} \end{bmatrix} \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix} = \frac{1}{2} \begin{bmatrix} 1 + e ^{i \pi r_k} & 1 - e ^{i \pi r_k} \\ 1 - e ^{i \pi r_k} & 1 + e ^{i \pi r_k} \end{bmatrix}. This machine operating on the state |0\rangle gives HU_kH |0\rangle = \frac{1 + e ^{i \pi r_k}}{2} |0\rangle + \frac{1 - e ^{i \pi r_k}}{2} |1\rangle = |r_k\rangle .
So if Bob inputs |000\rangle to his machine, he obtains (HU_kH \otimes HU_kH \otimes HU_kH) |000\rangle = |r_0 \ r_1 \ r_2\rangle and he knows the state (i.e. the mark facing up) of all three of the cards. From here, Bob can draw one card, and then choose to either withdraw, or keep playing the game.
Based on the first card that he draws, he can know from his knowledge of the face-up values of the cards whether or not he has drawn a card that will give him even chances of winning going forward (in which case he can continue to play a fair game) or if he has drawn the card that will guarantee that he loses the game. In this way, he can make the game fair for himself.
This is an example of a game where a quantum strategy can make a game fair for one player when it would be unfair for them with classical strategies. Quantum Chess Quantum Chess was first developed by a graduate student at the University of Southern California named Chris Cantwell. His motivation to develop the game was to expose non-physicists to the world of quantum mechanics.
The game uses the same pieces as classical chess (8 pawns, 2 knights, 2 bishops, 2 rooks, 1 queen, 1 king) and is won in the same manner (by capturing the opponent's king). However, the pieces are allowed to obey laws of quantum mechanics such as superposition. By allowed the introduction of superposition, it becomes possible for pieces to occupy more than one square in an instance.
The movement rules for each piece are the same as classical chess. The biggest difference between quantum chess and classical chess is the check rule. Check is not included in quantum chess because it is possible for the king, as well as all other pieces, to occupy multiple spots on the grid at once.
Another difference is the concept of movement to occupied space. Superposition also allows two pieces to share space or move through each other. Capturing an opponent's piece is also slightly different in quantum chess than in classical chess.
Quantum chess uses quantum measurement as a method of capturing. When attempting to capture an opponent's piece, a measurement is made to determine the probability of whether or not the space is occupied and if the path is blocked. If the probability is favorable, a move can be made to capture.
PQ Penny Flip Game The PQ penny flip game involves two players: Captain Picard and Q. Q places a penny in a box, then they take turns (Q, then Picard, then Q) either flipping or not flipping the penny without revealing its state to either player. After these three moves have been made, Q wins if the penny is heads up, and Picard if the penny is face down.
The classical Nash equilibrium has both players taking a mixed strategy with each move having a 50% chance of either flipping or not flipping the penny, and Picard and Q will each win the game 50% of the time using classical strategies. Allowing for Q to use quantum strategies, namely applying a Hadamard gate to the state of the penny places it into a superposition of face up and down, represented by the quantum state |\psi_{1}\rangle = \frac{1}{\sqrt{2}} (|0\rangle + |1\rangle).
In this state, if Picard does not flip the gate, then the state remains unchanged, and flipping the penny puts it into the state |\psi_{2}\rangle = \frac{1}{\sqrt{2}} (|1\rangle + |0\rangle) = |\psi_{1}\rangle. Then, no matter Picard's move, Q can once again apply a Hadamard gate to the superposition which results in the penny being face up.
In this way the quantization of Q's strategy guarantees a win against a player constrained by classical strategies. This game is exemplary of how applying quantum strategies to classical games can shift an otherwise fair game in favor of the player using quantum strategies.
Quantum minimax theorems
The concepts of a quantum player, a zero-sum quantum game and the associated expected payoff were defined by A. Boukas in 1999 (for finite games) and in 2020 by L. Accardi and A. Boukas (for infinite games) within the framework of the spectral theorem for self-adjoint operators on Hilbert spaces. Quantum versions of Von Neumann's minimax theorem were proved.
See also
Quantum tic-tac-toe: not a quantum game in the sense above, but a pedagogical tool based on metaphors for quantum mechanics Quantum pseudo-telepathy Quantum refereed game CHSH game Jan Sładkowski Jens Eisert
Text derived from https://en.wikipedia.org/w/index.php?oldid=1323199306 under CC BY-SA 4.0; modifications have been made.