key: cord-0155927-gcj7m0yg
authors: Kairon, Pranav; Thapliyal, Kishore; Srikanth, R.; Pathak, Anirban
title: Noisy three-player dilemma game: Robustness of the quantum advantage
date: 2020-04-09
journal: nan
DOI: nan
sha: faf00b8ea57062ac792cfdd7d71992c868997c11
doc_id: 155927
cord_uid: gcj7m0yg

Games involving quantum strategies often yield higher payoff. Here, we study a practical realization of the three-player dilemma game using the superconductivity-based quantum processors provided by IBM Q Experience. We analyze the persistence of the quantum advantage under corruption of the input states and how this depends on parameters of the payoff table. Specifically, experimental fidelity and error are observed not to be properly anti correlated, i.e., there are instances where a class of experiments with higher fidelity yields a greater error in the payoff. Further, we find that the classical strategy will always outperform the quantum strategy if corruption is higher than half.

Game theory provides a way to learn about decisive communication between rational and self-seeking agents. Therefore, it plays an important role in the fields of computer science, economics, biology, psychology, etc. (see [1, 2] for review). Computationally, game theory can be used to model algorithms [3, 4] as well as check the robustness of networks and corresponding attack strategies [5] . In cryptography, the communication task can be visualized as a game between the parties trying to communicate securely and an eavesdropper ( [6] and references therein). With the advent of quantum computing, it is observed that resources used in quantum computing, such as quantum coherence and entanglement, provide alternative solutions to classical games.

We may mention, for example, the emergence of cooperation in the prisoner's dilemma game [7] and the resolution of the coordination in battle of sexes game [8] using entanglement. Specifically, as all the players wish to maximize their gain or payoff in games, for which the umpire has laid down the rule(s), players using quantum mechanical tactics are found to attain a higher payoff compared to the classical one [9] . Further, the dilemma disappears in prisoner's dilemma with the use of quantum resources under unitary operations [10, 11] . Along the same line, optimal cloning of quantum states is also studied as game [12] . Quantum games based on monogamy of entanglement are shown to be useful in device independent quantum cryptography [13] . Our understanding of several other foundational aspects of quantum mechanics is improved by considering games, such as nonlocality [14] , the uncertainty bound on nonlocality [15] , contextuality [16] , PR-boxes [17] , as well as applications in quantum reinforcement learning [18] and quantum machine learning [19] .

Over the course of time, multiplayer quantum games were also introduced that exploit quantum correlation to prevent betrayal by individual players [20] . It has been suggested that these quantum games may shed light on the interactions in many-particle systems [21] . One such multiplayer game is the three-party counterpart of the prisoner's dilemma. In the classical version, all three players prefer to choose analogous to the corresponding two-party case. The dilemma exists because the Nash equilibrium does not coincide with the Pareto optimal [20] . Specifically, a Nash equilibrium is the situation in which no participant can gain by a unilateral change of strategy, while Pareto optimal corresponds to the situation that any change in strategy would make at least one individual worse off [20] . Still in quantum case, use of tripartite entanglement shows certain advantage. Moreover, computing the Nash equilibrium in the three-and four-player games is shown to be a hard problem [22, 23] . An experimental verification of three-player dilemma game using NMR was reported in Ref. [24] . In the recent past, other games have been realized on photonic quantum computer [25] [26] [27] [28] and ion trap platform [29] .

In general, the dilemma games are relevant in several studies of biology, economics, psychology, international relations, sports to name a few. For instance, King Solomon's dilemma [30] based on the Old Testament can model prize Figure 1 : (Color online) Circuit diagram that can be used for the realization of the three-player quantum dilemma game. allocation, research grant distribution, etc. Another multiparty version of prisoner's dilemma is diner's dilemma in which each player has to choose whether to order an expensive or an inexpensive dish if they have to equally share the bill [31] . This iterated diner's dilemma is useful in the social dynamics of networks and situational awareness. Such iterated multiparty prisoner's dilemma in the context of social dynamics is discussed in the past, too [32] . Along the same line, dilemma of the players in other games is used to introduce the conditional probability [33] .

Decoherence is the Achilles' heel of quantum computing and information processing in particular, and technology in general. Similar results are shown for the quantum games [34] . Independently, the effect of errors in the initial state preparation (as corruption by a demon) on the outcome of three-player dilemma game is studied assuming that the players are unaware of corruption and that there is no decoherence [21] . Interestingly, beyond a pivotal value of corruption it can be observed that players fare off better with the classical strategies, but since players have no knowledge of the level of corruption they have to stick to their original strategies. Furthermore, a quantum game reduces to classical game if one of the parties allows his qubit to decohere under Markovian noise channels [35] , while Nash equilibria are unchanged by decoherence for prisoner's dilemma [36] .

Here, we wish to implement the three-player dilemma game [20] on IBM quantum computer [37] and study how the change in the utility function affects the point of quantum advantage. Interestingly, this is the first realization of a game with corrupt source on a superconducting qubits based quantum computer. Despite high error rate and the limited qubit connectivity, it has been shown to run a wide array of algorithms ( [38, 39] and references therein). Thus, we realize the game on IBM Q Experience and compare the experimental payoffs with previous experiments on NMR [24] . On generalizing the payoff table in the noisy game, the point where quantum advantage disappears also changes which leads to some interesting observations. In specific, they show how robust the quantum strategy is. An application of these results is that given a known corruption level, the payoff table (the relative stakes) may, in a range, be chosen to give an advantage to the quantum strategy. Finally, we show that classical strategies dominate when corruption is higher than 50% in the proposed game.

The rest of the paper is organized as follows. We introduce three-player quantum dilemma in Section 2. The noisy counterpart of the game and its experimental implementation is discussed in Section 3. We further discuss all the results in detail in the penultimate section before concluding the paper in Section 5.

A multiparty dilemma game was introduced as a multiparty counterpart of the prisoner's dilemma game, where each person has two choices: either to cooperate (0) or defect (1). The three-player dilemma resembles el-Farol bar problem that players have to decide independently whether to go or not to a bar with seating capacity for only two ( [24] and references therein).

In the three-player quantum dilemma game, each player is provided one qubit by the umpire, who performs an entangling operation on state |000 before that which increases the nonclassical correlation among the players. The entangling gate J can be defined as in Ref. [20] :

where I and X are identity and Pauli NOT gates, respectively. Without loss of generality, we choose the case when the correlation is maximum, i.e., γ = π/2. Further, it can be checked that for minimum correlation, i.e., γ = 0, the game reduces to its classical counterpart [11] .

In quantum game, each person is allowed to choose an operation from a strategy set S, consisting of 3 elements S = (S 1 , S 2 , S 3 ), where S 1 = X means the player wants to attend the party; S 2 = H corresponds to the player's choice to go with half a probability; and S 3 = I represents the player wants to stay at home. Note that the choice of S 2 does not have a counterpart in classical games. This is a restricted strategy set (as there can be an infinitely many possible quantum strategies each corresponding to a different unitary operation), but it encompasses all the nonclassical characteristics we want to demonstrate through this game. Subsequently, a disentangling operation

is performed before measuring in the computational basis. The circuit diagram of the game is shown in Fig. 1 .

Thus, when none of the players decide to go, i.e., the measurement outcome is |000 (represented by corresponding bit values 000 in Table 1 ), nobody is happy since they could not attend the party but are not sad since none of the friends Bit values corresponding to possible measurement outcome Payoffs ($) 000 0, 0, 0 001 −n, −n, p 010 −n, p, −n 011 p, n, n 100 p, −n, −n 101 n, p, n 110 n, n, p 111 q, q, q Table 1 : Generalized payoff table for three-player dilemma game depending upon the possible measurement outcomes.

In previous adaptations of the game [20] , n = 9, p = 1, and q = 2 were used.

betrayed, and thus everybody gets 0 payoff. However, if one person decides to go then the other two will be unhappy (with payoff −n), and the one attending the party does not enjoy being alone (with payoff p). When two of the friends decide to go they both fare off with n payoff each since they get to go to the party with company, while the friend left behind is not too dejected since his presence would have overcrowded the party so he gets p. If all of them decide to go, they get payoff of q each since their presence has overcrowded the party. Accordingly, we impose n > q > p > 0. This problem is also relevant in the recent pandemic coronavirus situation that may allow a restaurant to open but to avoid infection it restricts people who can sit at a table to two, say because the table is 1 m wide and only two persons can sit in the same table opposite to each other without violating the social distancing norms. Yet another example for the three-player dilemma closer to most of us would be the dilemma of three academic collaborators in applying for a research grant. If two of them apply, they are likely to receive the grant, whereas they probably would receive insufficient or no funding if all three apply for it. Also, they would not be happy if none of them apply or their collaborator gets it but not them. The dilemma shown previously was by considering n = 9, p = 1, and q = 2 [20] . Here, we study a general description of such payoff tables and show how the payoff depends on these parameters in the noisy game (subjected to constraint 0 < p < q < n). One motivation for this is to understand whether and how the game's stakes can be fixed based on knowledge of the preparation noise in the system. In [20] , it is shown that in a special case considering a different set of values of the payoffs, quantum players do not have any advantage over the classical strategy which is no longer a Nash equilibrium. Therefore, we have restricted ourselves to the aforementioned constraint which ensures that classical Nash equilibrium exists. To the best of our knowledge, this is the first attempt to generalize the payoff table for the three-player dilemma game in analogy of prisoner's dilemma [40] .

For the given strategy space S, there are 3 choices per player which gives us 3 3 = 27 arrangements which can be clustered into 10 different classes [21] . Experimental design for the implementation of all these classes is shown in Fig. 2 . Classes I, IV, and V have 3 3 = 1 configuration, while Classes II, III, VI, VII, IX and X each have 3 1 = 3 possible configurations, and there are 3! = 6 configurations in Class VIII. When each player decides to play a unique tactic, independent of the other players, we obtain class VIII as mixed strategy Nash Equilibrium. Class VII provides best response for each player but is not considered as it is biased. Suppose the umpire has provided tainted qubits from the black box, i.e., instead of |000 he introduces error (mixedness) of the form (1 − x) |000 000| + x |111 111|. The expected payoff would change quite exorbitantly as we increase the amount of preparation noise or corruption (as shown in Fig. 6 

In IBM implementation [41] of the gate [42] , we performed the entangling gate J using a R x (− π 2 ) and 4 CNOT gates as

on qubits 0, 1, and 2, respectively (also shown in the Fig. 3 ). The single qubit operation can be defined as R

In fact, many simulations of this game have modeled the entangling gate J incorrectly in the past [42] as those matrix decomposition were not the same as J. As already discussed this is followed by the players applying their operations on their respective qubits from the strategy space S. Finally, we apply a disentagling gate J † which can be modeled by the same gates as J since

To introduce the corruption in the input qubits (shown in Fig. 4) , the umpire uses an ancilla in state |ψ = U (θ, φ, λ) |0 = cos θ 2 |0 + sin θ 2 |1 prepared using single qubit unitary operation U (θ, φ = 0, λ = 0) defined as Subsequently, he uses this ancilla as control and applies CNOT gates to the rest of the qubits which he sends to three players. The amount of corruption, x is related by x = sin 2 θ 2 . Therefore, in what follows, we trace out the fourth qubit to obtain the payoffs of noisy game.

We have performed the experiments for all classes and computed payoff from the measurement outcomes in computational basis. We have also obtained the output density matrices to obtain the fidelity between theoretically desired and experimentally reconstructed states.

In quantum computation, fidelity is used to describe closeness between two states as it is one of the distance based measures. Ideally, fidelity between the experimental (ρ E ) and theoretical (σ) density matrices, defined as F (ρ E , σ) = T r ( √ σρ E σ) [39] , is desired to be 1, but due to unavoidable errors it is usually less than unity in most cases. In our case, we have calculated fidelities of all the classes and shown them in Table 2 . To obtain the experimental density matrices and fidelities we performed quantum state tomography of the outputs of all the circuits (see [43, 44] for Table 2 : Results of the experiments performed using different quantum processors in IBM Q Experience for the payoff table parameters p = 1, n = 9, q = 2 considering state x = 0. Surprisingly, fidelity and error are not properly anticorrelated, i.e., there are instances where a class of higher fidelity than another, still yields a greater error in the payoff. An example here for different processors would be Class III and Class I. Another example, for the same processor, would be, Classes IV and VI. A possible explanation could be noise during readout of payoffs. detail). The crux of the matter, is that we can reconstruct the three qubit density matrix of the output of the circuit using

where σ j are respective Pauli matrices. The values of elements of the T matrix are obtained from the expectation values of these Pauli operators. For instance, in the case of Class VII, U 7 = σ x I σ x is the strategy unitary, the experimentally reconstructed density matrix is shown with corresponding theoretical density matrix σ = |101 101| in Fig. 5 . The fidelity of the output density matrices for all the classes are summarized in Table 2 . Surprisingly, fidelity and error are not properly anti-correlated, i.e., there are instances where a class of higher fidelity than another, still yields a greater error in the payoff. Here it may be noted that the experiments are performed on different processors provided by IBM depending upon their availability.

Payoff of single player $ is obtained by multiplying their respective payoffs from Table 1 with the probabilities obtained from the output of the experiment (as in [24] ). The mean payoff per player $ is defined as the numerical mean of the payoffs of each player $ = $1+$2+$3

. It is also shown in the past that the payoffs for quantum Nash equilibrium deteriorate with noise [21] . However, in our case, assuming arbitrary values of parameters we obtained that quantum Nash equilibrium is 3$ qu = −4nx + 2n + p, and classical Nash equilibrium for (q,q,q) is $ cl = q (1 − x). As both quantum and classical Nash equilibrium values decrease with corruption level x, the quantum advantage disappears after the point of intersection of these two curves.

That intersection can be obtained as the critical value of corruption

From Fig. 6 , we obtained that experimentally x c = 0.363 whereas the theoretical value is 0.428 [21] , giving us an error of 15.18%. Note that the results obtained in [21] neglect decoherence after the initial state is prepared by the demon. However, here on top of that, gate errors in the implementation of the presently available SQUID based quantum computing facilities also play an important role in sabotaging the quantum advantage achievable in quantum games. Of course, a reduction in noise with improvement in technology will improve the outcome. Notice that for very high values of corruption, when classical strategy is a preferred choice, the experimental results show higher payoffs than theoretically expected in quantum Nash equilibrium. The experimental values of payoff can be improved using mitigated error method provided by IBM.

As we have discussed the general case of the game with arbitrary values of the individual payoff parameters, here we discuss the role of each of these parameters (assuming 0 < p < q < n) on x c . This would allow us to choose suitable payoff parameters if the noise level x is known, or if they cannot be varied, then to decide whether to employ the quantum or classical game for the problem in a practical situation.

We find that x c increases (shifts to the right of the original value) if n is increased for a constant value of p and q. It implies that when the stakes of a game are high (large n), such that reward for winnings and the amount of losses are very high, the quantum strategies are better in spite of corruption. Further increasing n saturates x c to 0.5, which signifies that no matter what, if corruption is higher than 50% classical strategy will always outperform the quantum strategy. The results obtained are shown in Fig. 7 (a) .

Note that the only quantum Nash equilibrium depends upon n, while classical Nash equilibrium is a function of q. Thus, an increase in q essentially leads to classical dominant strategy, i.e., classical strategy tends to be as efficient as the quantum strategy (cf. in Fig. 7 (b) ). However, for large values of corruption there is no evident advantage as for maximum corruption classical Nash equilibrium is always zero.

These observation lead to conclusion that quantum systems are more prone to errors and deteriorate rapidly with an increase in the amount of corruption. Hence, errors in system may lead to loss of quantum advantage originally present as observed from the experimental value in Fig. 6 as well. Thus, in case of high errors, it is always better to stick to classical strategies from an outsider's perspective.

We have discussed a multiparty quantum game by generalizing the payoff table. Our result may find interesting applications in diverse fields, such as finance, social networks. Suppose a group of companies want to invest in a particular stock and have limited knowledge of the market statistics, then the financial situation of the stock simulates a three-person dilemma. In this case, if the stakes of the investments are high such that returns are great, but so are the losses, companies perform better if they use quantum strategies, provided the amount of preparation noise is less than 50%. Otherwise the classical strategy should be preferred. Similarly, in the situation that the classical dominant strategy equilibrium (q, q, q) has relatively higher payoff than previous cases, the present results may persuade companies to opt for classical strategies even for a small amount of source error.

We have performed an experiment for the noisy three-player quantum dilemma game and observed that the obtained results were less robust against noise than the corresponding results from NMR experiments. Further, it can be observed that due to additional errors (other than source error introduced in the noisy counterpart of the game) the advantage of quantum game over corresponding classical game disappears quickly. Similar studies for the generalizations of other games where quantum players perform better or the games where classical strategies are always preferable can be performed to study the role of various payoff parameters in those cases. The present experimental implementation of the noisy quantum game on a small noisy quantum computer establishes a practical quantum advantage in game theory. However, in view of noisy intermediate-scale quantum (NISQ) technology [45] around the corner, i.e., quantum computing infrastructure with 50-100 qubits, this advantage can be exploited for several applications, such as in quantum machine learning [46] . This can be further extended to the iterated version of the game where it is performed more than once, and rational players decide their strategies depending upon their opponents' previous decision. The results from the experiment performed on NMR was more accurate, showing that the NMR-based quantum computer is less noisy. To obtain a quantitative perception of that we performed quantum state tomography here, which shows that higher fidelity of experimentally generated state does not necessarily mean smaller errors, i.e., fidelity and errors are not properly anti-correlated.

In the end, we would like to stress on the recent studies connecting Bell nonlocality [47, 48] , a quantum secure direct communication scheme [49] , and security of quantum key distribution schemes [50] with game theory. In view of these works, in principle, all quantum cryptographic schemes (see [51, 52] for a review) can be viewed from the perspective of game theory, as a game to perform cryptanalysis and obtain security proofs. For example, measurement-deviceindependent and device-independent as well as entangled state based quantum key distribution schemes, such as Ekert's scheme [53] , can be viewed as a three-party game involving Alice, Bob and Eve. A future work is planned to rigorously analyze the best strategy of Alice and Bob and that of Eve using a game theoretic approach. We hope the present results will be helpful in the application of quantum strategies in game theory, and in turn in their applications in quantum technologies in general, and quantum cryptography in particular.

The real and imaginary parts of the experimentally obtained density matrix by performing quantum state tomography are , respectively, while theoretical density matrix in the corresponding case is given by σ = |ψ ψ| = |101 101|, where |ψ = J † · U 7 · J |000 .

An introduction to quantum game theory

An invitation to quantum game theory

Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling

An intersection game-theory-based traffic control algorithm in a connected vehicle environment

Game-theoretic robustness of many-to-one networks

Cryptography and game theory

Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks

Dilemma and quantum battle of sexes

Quantum strategies

Quantum games and quantum strategies

Playing prisoner's dilemma with quantum rules

Optimal cloning of pure states

A monogamy-of-entanglement game with applications to device-independent quantum cryptography

Local orthogonality as a multipartite principle for quantum correlations

The uncertainty principle determines the nonlocality of quantum mechanics

Contextuality in multipartite pseudo-telepathy graph games

Nonlocality beyond quantum mechanics

A quantum reinforcement learning method for repeated game theory

Quantum machine learning with glow for episodic tasks and decision games

Multiplayer quantum games

Playing a quantum game with a corrupted source

Three-player games are hard

The complexity of computing a Nash equilibrium

Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quantum information processor

Aharon-Vaidman quantum game with a Young-type photonic qutrit

Vector vortex implementation of a quantum game

Experimental implementation of a four-player quantum game

Proposal for optically realizing a quantum game

Demonstration of a Bayesian quantum game on an ion-trap quantum computer

Efficient allocation of a "prize"-King Solomon's dilemma

Trust and situation awareness in a 3-player diner's dilemma game

Exploring the foundations of artificial societies: Experiments in evolving solutions to iterated N-player prisoner's dilemma

Let's make a deal: The player's dilemma

Quantum advantage does not survive in the presence of a corrupt source: optimal strategies in simultaneous move games

Noisy quantum game

Quantum prisoner dilemma under decoherence

Design and experimental realization of an optimal scheme for teleportation of an n-qubit quantum state

Circuit optimization for IBM processors: A way to get higher fidelity and higher values of nonclassicality witnesses

Monkeys in a prisoner's dilemma

Complete characterization of the directly implementable quantum gates used in the IBM quantum processors

Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate

Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer

Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer

Quantum computing in the NISQ era and beyond

Machine-learning quantum states in the NISQ era

Connection between Bell nonlocality and Bayesian game theory

The equivalence of Bell's inequality and the Nash inequality in a quantum game-theoretic setting

Game-theoretic perspective of ping-pong protocol

Game theoretic security framework for quantum key distribution

Elements of quantum computation and quantum communication

Quantum cryptography over non-Markovian channels

Quantum cryptography based on Bell's theorem