Research Article | Open Access
Strong Isomorphism in Eisert-Wilkens-Lewenstein Type Quantum Games
The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum scheme to generate the classical game in a particular case. Now, given a quantum game scheme and two isomorphic classical games, we additionally require the resulting quantum games to be isomorphic as well. We are concerned with the Eisert-Wilkens-Lewenstein quantum game scheme and the strong isomorphism between games in strategic form.
Sixteen years of research on quantum games have given us many ideas of how quantum games could be described. For example, we have learned from  that players who are allowed to use some specific unitary operators may gain an advantage over the players who use only classical strategies. The schemes introduced in [2, 3] give us two different ways of describing quantum 2 × 2 games. Paper , in turn, provides us with a quantum scheme for the Cournot duopoly game. What connects these protocols is the capability to obtain the classical game. This appears to be a generally accepted necessary condition imposed on a quantum scheme. One can also find other and more subjective guidelines for quantum game schemes. Paper  shows how to generalize the scheme introduced in  by assuming that the new model should output the classical game (up to the order of players’ strategies) if the initial state is one of the computational basis states. In addition, the work of Bleiler  distinguishes between proper and more strict complete quantization. Roughly speaking, the first notion concerns quantum schemes where the counterparts of classical pure strategies can be found in pure quantum strategies. The second one requires the quantum strategy set to include the counterparts of the mixed classical strategies. With these notions the Marinatto-Weber (MW)  scheme turns out to be not even a proper quantization. The Eisert-Wilkens-Lewenstein (EWL)  scheme, in turn, is a complete quantization, and this is the case as long as the players’ quantum strategies include the one-parameter unitary operators (see formula (10)). In particular, we can find a lot of papers where the EWL scheme was studied with the two-parameter unitary strategies [7–10]. However, as it was noted in  the set appears not to reflect any reasonable physical constraint as this set is not closed under composition. Moreover,  showed that different two-parameter strategy spaces in the EWL scheme imply different sets of Nash equilibria. In this paper we explain why the set of two-parameter unitary operators may not be reasonable from the game theory viewpoint. Our criterion is formulated in terms of isomorphic games. If we assume that both classical games are the same with respect to game-theoretical tools, we require the corresponding quantum games to be equivalent in the same way. It is worth noting that quantum game schemes introduced in [2, 3] and the refined MW scheme defined in  preserve the so-called strategic equivalence. We recall what this means. The following definition can be found in . See Preliminaries for the definition of strategic form game and its components.
Definition 1. Two games in strategic form and with the same set of players and the same sets of pure strategies are strategically equivalent if for each player the function is a positive affine transformation of the function . In other words, there exist and such that
It is clear that, given two strategically equivalent games and , the player ’s payoff operators and in the quantum games are connected by equation . Then, by linearity of trace, the quantum payoff functions satisfy (1); that is, . Virtually, strategically equivalent games and describe the same game-theoretical problem. In particular, every equilibrium (pure or mixed) of the game is an equilibrium of the game .
The strategy equivalence can be extended to take into account different orders of players’ strategies. This type of equivalence is included in the definition of strong isomorphism. Clearly, if, for example, two bimatrix games differ only in the order of a player’s strategies we still have the games that describe the same problem from the game-theoretical viewpoint. Given a quantum scheme, it appears reasonable to assume that the resulting quantum game will not depend on the numbering of players’ strategies in the classical game. As a result, if there is a strong isomorphism between games, we require that the quantum counterparts of these games are also isomorphic.
In order to make our paper self-contained we give the important preliminaries from game theory and quantum game theory.
2.1. Strong Isomorphism
First we recall the definition of strategic form game .
Definition 2. A game in strategic form is a triple in which (i) is a finite set of players;(ii) is the set of strategies of player , for each player ;(iii) is a function associating each vector of strategies with the payoff to player , for every player .
The notion of strong isomorphism defines classes of games that are the same up to numbering of the players and the order of players’ strategies. The following definitions are taken from  (see also [16–18]). The first one defines a mapping that associates players and their actions in one game with players and their actions in the other game.
Definition 3. Given and , a game mapping from to is a tuple , where is a bijection from to , and for any , is a bijection from to .
Example 4. Let us consider two bimatrix games:Then, and , , , and . As an example of a game mapping let ,Since and , it follows that maps to . From (3) we conclude that
In general case, mapping from to identifies player with player and maps to . This means that strategy profile is mapped into profile that satisfies equation for .
The notion of game mapping is a basis for definition of game isomorphism. Depending on how rich structure of the game is to be preserved we can distinguish various types of game isomorphism. One that preserves the players’ payoff functions is called the strong isomorphism. The formal definition is as follows.
Definition 5. Given two strategic games and , a game mapping is called a strong isomorphism if relation holds for each and each strategy profile .
From the above definition it may be concluded that if there is a strong isomorphism between games and , they may differ merely by the numbering of players and the order of their strategies.
Example 6. Let be a game mapping defined in Example 4. By definition, becomes the strong isomorphism if condition is imposed on the payoffs in (2). This giveswhere, for instance, follows from equation . Substituting (5) into (2) we conclude that gamesare isomorphic. In this case, the games differ by the numbering of players and the order of strategies of player 2. Indeed, in the second game of (6) players 1 and 2 choose now between columns and rows, respectively. Moreover, player 1’s first (second) strategy still guarantees the payoff or ( or ) whereas player 2’s strategies are interchanged: the first one implies now the payoff or .
Relabeling players or their strategies does not affect a game with regard to Nash equilibria. If is a strong isomorphism between games and , one may expect that the Nash equilibria in map to ones in under . We will prove the following lemma as it is needed throughout the paper.
Lemma 7. Let be a strong isomorphism between games and . Strategy profile is a Nash equilibrium in game if and only if is a Nash equilibrium in .
Proof. The proof is based on the following observation. Since , where , it follows that may be written as . As is an isomorphism, we have for each strategy profile . Thus This allows us to conclude that the inequality holds for each and each strategy if and only if for each and each strategy . This finishes the proof.
2.2. Eisert-Wilkens-Lewenstein Scheme
Let us consider a strategic game with for each . The generalized Eisert-Wilkens-Lewenstein approach to game is defined by triple , where one has the following:(i) is a set of unitary operators from . The commonly used parametrization for is given by Then is assumed to include set . Elements play the role of player ’s strategies. The players, by choosing , determine the final state according to the following formula: ( is the identity matrix of size 2 and is the Pauli matrix ).(ii) is an observable defined by the formula The numbers are player ’s payoffs in such that . Player ’s payoff in is defined as the average value of measurement ; that is,
3. Strong Isomorphism in Eisert-Wilkens-Lewenstein Quantum Games
Having specified the notion of strong isomorphism and the generalized Eisert-Wilkens-Lewenstein scheme we will now check if the isomorphism between the classically played games makes the corresponding quantum games isomorphic. We first examine the case when the players’ unitary strategies depend on two parameters. The quantum game withis particularly interested. That setting was used to introduce the EWL scheme  and has been widely studied in recent years (see, e.g., [7–10]). We begin with an example of isomorphic games that describe the Prisoner’s Dilemma.
Example 8. The generalized Prisoner’s Dilemma game and one of its isomorphic counterparts may be given by the following bimatrices:where . Note that the games are the same up to the order of player 2’s strategies. Let us now examine the EWL approach to and defined by tripleswhereWe first compare the sets of Nash equilibria in and to check if the games may be isomorphic. We recall from  that there is the unique Nash equilibrium in that determines the payoff profile . When it comes to , we set in (11) and replace (12) by and from (17). Then we can rewrite (13) asLet be an arbitrary but fixed strategy of player 2. Then it follows from (18) that strategy specified by equationis player 1’s best reply to as it yields player 1’s payoff . Hence, a possible Nash equilibrium would generate the maximal payoff for player 1. On the other hand, given a fixed player 1’s strategy , player 2 can obtain a payoff that is strictly higher than by choosing, for example, with , . This means that player 1 would obtain strictly less than . Hence, there is no pure Nash equilibrium in the game determined by . As a result, we can conclude by Lemma 7 that games (16) are not strongly isomorphic.
The example given above shows that the EWL approach with the two-parameter unitary strategies may output different Nash equilibria depending on the order of players’ strategies in the classical game. This appears to be a strange feature since games (15) represent the same decision problem from a game-theoretical point of view.
One way to make games (16) isomorphic is to replace player ’s strategy set (14) with the alternative two-parameter strategy space every time player ’s strategies are switched in the classical game. In the case of games (16) this means that quantum gamesare isomorphic. Indeed, define a game map with for and bijections and satisfyingThe map should actually distinguish cases and to be a well-defined bijection as it was done in (19). To simplify the proof we stick to the form (22) throughout the paper bearing in mind that for we can always find the equivalent angle . We have to show for games (21) that for , where and . First, note that . Hence, we obtainApplication of (24) finally yields In similar way we can prove a more general fact. Namely, if is player 2’s strategy set in one of games (16) and is in the the other one then games (16) become strongly isomorphic. This observation suggests that the EWL scheme is robust with respect to changing the order of players’ strategies in the classical game if the players can use strategies from or equivalently from the set . Before stating the general result we study a specific example.
Example 9. Let us consider the following three-person games:The games are (strongly) isomorphic via game mapping such thatWe see from (27) that the isomorphism maps strategy profiles as follows:Let us now define the EWL quantum extensions and for the three-player game where we identify the players’ first and second strategies with values 0 and 1, respectively. That is,where , for each , where . Given let us define a mapping such that for andThen, induces a bijection from to such that According to the EWL scheme, the payoff functions for and are as follows: for . In order to prove that and are isomorphic we have to check if Without loss of generality we can assume that . Let us first evaluate state ,Note thatwhere is a permutation matrix that changes the order of qubits according to ,Using (36), the fact thatand we may write as follows:Note that . This means that is the inverse operation when acting on dual vectors. This observation together with the fact that changes the strategy order for players 1 and 3 leads us to conclusion that operator can be viewed as in the sense of the following equality:Let us now consider term for given by (35). From (39) and (40) it follows that Hence,Similar reasoning applies to the case . We have thus proved that games given by (29) are isomorphic.
The same conclusion can be drawn for games with arbitrary but finite number of players.
Proposition 10. Let and be strongly isomorphic strategic form games with and let and with be the corresponding quantum games. Then and are strongly isomorphic.
Proof. The proof follows by the same method as in Example 9. Let be a strong isomorphism between and . Depending on such that for and we construct , whereThen , where for . Since is a permutation and , we can write relation (43) asAs a result, maps onto as follows: Let us now consider a permutation matrix that rearranges the order of basis states in the tensor product . Since permutes the elements in a similar way as , it is not difficult to see that It is also clear that commutes with and and so does . Thus the final state may be written as Analysis similar to that in (40)–(42) shows that which is the desired conclusion.
As the following example shows, the converse is not true in general.
Example 11. Let us consider two 2 × 2 bimatrix games that differ only in the order of payoff profiles in the antidiagonal; that is,The EWL quantum counterparts and for these games are specified by triples (29), where in this case , , and the measurement operators take the form where . Let us set a mapping with and ) for . An easy computation shows thatwhere has the outer product representation and . Application of (51) gives As a result, games produced by and are strongly isomorphic. This fact, however, is not sufficient to guarantee the isomorphism between and . Indeed, one can check that there is no to satisfy for each and . Alternatively, given specific payoff profiles , , , , we can find three Nash equilibria in the game and just one in the game . Hence, by Lemma 7 games (49) are not isomorphic.
The theory of quantum games has no rigorous mathematical structure. There are no formal axioms, definitions that would give clear directions of how a quantum game ought to look like. In fact, only one condition is taken into consideration. It says that a quantum game ought to include the classical way of playing the game. As a result, this allows us to define a quantum game scheme in many different ways. The scheme we have studied in the paper is definitely ingenious. It has made a significant contribution to quantum game theory. However, it leaves the freedom of choice of the players’ strategy sets. Our criterion for quantum strategic game schemes requires the quantum model to preserve strong isomorphism. This specifies the strategy sets to be . We have shown that a proper subset of in the EWL scheme may imply different quantum counterparts of the same game-theoretical problem. In that case, the resulting quantum game (in particular, its Nash equilibria) depends on the order of players’ strategies in the input bimatrix game. Hence, given a classical game, for example, Prisoner’s Dilemma, we cannot say anything about the properties of the EWL approach with the two-parameter unitary strategies until we specify an explicit bimatrix for that game. This is not the case in the EWL scheme with where, given a classical bimatrix game or its isomorphic counterpart, we always obtain the same from the game-theoretical point of view quantum game.
The author declares that they have no competing interests.
This work was supported by the Ministry of Science and Higher Education in Poland under the project Iuventus Plus IP2014 010973 in the years 2015–2017.
- D. A. Meyer, “Quantum strategies,” Physical Review Letters, vol. 82, no. 5, pp. 1052–1055, 1999.
- J. Eisert, M. Wilkens, and M. Lewenstein, “Quantum games and quantum strategies,” Physical Review Letters, vol. 83, no. 15, pp. 3077–3080, 1999.
- L. Marinatto and T. Weber, “A quantum approach to static games of complete information,” Physics Letters A, vol. 272, no. 5-6, pp. 291–303, 2000.
- H. Li, J. Du, and S. Massar, “Continuous-variable quantum games,” Physics Letters. A, vol. 306, no. 2-3, pp. 73–78, 2002.
- P. Frąckiewicz, “A comment on the generalization of the Marinatto-Weber quantum game scheme,” Acta Physica Polonica B, vol. 44, no. 1, pp. 29–33, 2013.
- S. A. Bleiler, “A formalism for quantum games and an application,” http://arxiv.org/abs/0808.1389.
- J. Du, H. Li, X. Xu et al., “Experimental realization of quantum games on a quantum computer,” Physical Review Letters, vol. 88, no. 13, Article ID 137902, 2002.
- L. K. Chen, H. Ang, D. Kiang, L. C. Kwek, and C. F. Lo, “Quantum prisoner dilemma under decoherence,” Physics Letters A, vol. 316, no. 5, pp. 317–323, 2003.
- Q. Li, A. Iqbal, M. Chen, and D. Abbott, “Quantum strategies win in a defector-dominated population,” Physica A: Statistical Mechanics and its Applications, vol. 391, no. 11, pp. 3316–3322, 2012.
- A. Nawaz, “The strategic form of quantum prisoners' dilemma,” Chinese Physics Letters, vol. 30, no. 5, Article ID 050302, 2013.
- S. C. Benjamin and P. M. Hayden, “Comment on ‘Quantum games and quantum strategies’,” Physical Review Letters, vol. 87, no. 6, Article ID 069801, 2001.
- A. P. Flitney and L. C. L. Hollenberg, “Nash equilibria in quantum games with generalized two-parameter strategies,” Physics Letters A, vol. 363, no. 5-6, pp. 381–388, 2007.
- P. Frąckiewicz, “A new quantum scheme for normal-form games,” Quantum Information Processing, vol. 14, no. 6, pp. 1809–1825, 2015.
- M. Maschler, E. Solan, and S. Zamir, Game Theory, Cambridge University Press, Cambridge, UK, 2013.
- J. Gabarró, A. García, and M. Serna, “The complexity of game isomorphism,” Theoretical Computer Science, vol. 412, no. 48, pp. 6675–6695, 2011.
- J. Nash, “Non-cooperative games,” Annals of Mathematics, vol. 54, pp. 286–295, 1951.
- B. Peleg, J. Rosenmüller, and P. Sudhölter, “The canonical extensive form of a game form: part I—symmetries,” in Current Trends in Economics: Theory and Applications, A. Alkan, C. D. Aliprantis, and N. C. Yannelis, Eds., vol. 8 of Studies in Economic Theory, pp. 367–387, 1999.
- P. Sudhölter, J. Rosenmüller, and B. Peleg, “The canonical extensive form of a game form—part II—representation,” Journal of Mathematical Economics, vol. 33, no. 3, pp. 299–338, 2000.
Copyright © 2016 Piotr Frąckiewicz. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.