Social Advantage with Mixed Entangled States


It has been extensively shown in past literature that Bayesian game theory and quantum non-locality have strong ties between them. Pure entangled states have been used, in both common and conflict interest games, to gain advantageous payoffs, both at the individual and social level. In this paper, we construct a game for a mixed entangled state such that this state gives higher payoffs than classically possible, both at the individual level and the social level. Also, we use the I-3322 inequality so that states that aren’t useful advice for the Bell-CHSH1 inequality can also be used. Finally, the measurement setting we use is a restricted social welfare strategy (given this particular state).

Share and Cite:

Das, A. and Chowdhury, P. (2020) Social Advantage with Mixed Entangled States. Journal of Quantum Information Science, 10, 11-22. doi: 10.4236/jqis.2020.102002.

1. Introduction

Quantum theory emerged when most physicists realized that physics at the atomic level could not be completely described by classical mechanics. Planck was the first to propose the notion of “quanta”, which was further developed by Einstein. Though Heisenberg and Bohr, the further luminaries of the theory believed in the innate uncertainty in the behavior of atoms, Einstein never accepted it. He fundamentally opposed the Copenhagen interpretation of Quantum Mechanics (QM). Thus Einstein-Podolsky-Rosen (EPR) put forward the EPR paradox in their paper in 1935 [1], which claimed QM was incomplete, that is, it did not provide a complete picture of our physical reality.

To resolve this, in their paper, Einstein-Podolsky-Rosen argued for the inclusion of a Hidden Variable Theory which would remove all the indeterminism in QM. This led Bohr to publish a paper in the same journal, under the same name, where he stated that the criterion of physical reality given by EPR contains an essential ambiguity when applied to quantum phenomenon [2]. Hence there continued a debate between Einstein and Bohr regarding the fundamental nature of reality.

In 1964, Bell formulated an inequality [3] which was satisfied by all local realistic theories. Eventually, the quantum violation of Bell’s inequality proved that no local realistic hidden variable Theory can exist from which QM can be derived. The value by which QM violates a particular Bell inequality is called the Tsirelson bound for that particular Bell Inequality. The Tsirelson bound for Bell-CHSH [4] is 2 2 .

Quantum states that violate Bell’s inequality are all non-local states (entangled). However, this leads to the question:

Is Bell’s inequality sufficient to show non-locality (or entanglement)?

It turns out that Bell’s inequality is not sufficient to prove non-locality. The states that violate Bell’s inequality are definitely non-local, but there are other states that do not violate a particular Bell inequality but are still non-local. For example, the mixed entangled state in Equation (5) that we consider as the shared resource, does not violate the Bell-CHSH inequality. However, the state is still non-local as can be seen from its violation of the I-3322 inequality. This violation is due to the fact that the I-3322 inequality [5] is inequivalent to any CHSH-like inequality and thus may be used to detect such non-separable states that are not witnessed by any CHSH-like inequality.

By constructing a proof-of-principle non-local game using this inequality and this particular mixed entangled state, we demonstrate that non-pure but non-separable states are also useful as quantum advice (QSWA, defined in Sec. 3.4). By contrast, we know that any two-qubit pure entangled state can be used as QSWA in some non-local game. This result has interesting implications for quantum game theory in general, and quantum cryptographic protocols in particular. The utility of arbitrary (undistillable) bound entangled states in this context, however, remains an open problem that requires further study.

2. Game Theory

Game theory is mathematical modeling of strategic interaction among rational beings, used widely in economics [6], political sciences [7], biological phenomena [8], as well as logic, computer science and psychology [9]. It is the study of human conflict and cooperation, or in other words the study of optimal decision making of different players, each with a set of action having particular payoffs. It is the payoff which decides the preference of an action over another. Von Neumann and Morgenstern [10] were the pioneers of game theory.

Games can be cooperative (common interest) or non-cooperative (conflict interest). Cooperative games include competition between groups whereas non-cooperative game includes analyzing strategies and payoffs of individual players using the concept of Nash equilibrium [11]. In a game, if a player chooses a unique action from a set of available action it is called pure strategy, but if a probability distribution over a set of action is available it is called mixed strategy. Nash proved that in any game with finite number of action for each player there is always a mixed strategy Nash equilibrium. Later the concept of Bayesian games i.e., games of incomplete information was introduced [12] and Aumann proved the existence of correlated equilibria [13] in these games, as opposed to Nash equilibria.

3. Quantum Game Theory

3.1. Non-Locality and Bayesian Game Theory

Non-locality is one of the most counterintuitive aspects of QM. The principle of locality states that an object can be instantaneously affected only by its immediate surroundings and not remote or distant objects. However, quantum theory is not consistent with this and is inherently non-local in nature, unlike the rest of classical physics. For example, two entangled particles placed far apart, can display correlations in simultaneous measurements inexplicable in classical physics. These correlations can not be a result of a signal transfer as that would imply superluminal communication whereas in 1964 Bell [3] showed that they could not arise from predetermined strategies either.

In 2013, Brunner and Linden [14] demonstrated strong links between quantum non-locality and Bayesian game theory. Specifically, they showed that the normal form of a Bayesian game is equivalent to a Bell inequality test scenario. They showed that when the two players in the game share non-local resources such as an entangled pair of quantum particles, they can outperform players using any sort of classical resources. This can happen, for example, when the payoff function of the players corresponds to a Bell inequality, like the CHSH inequality [4], as first discussed by Cheon and Iqbal [15] but also when the payoff function doesn’t correspond to any Bell inequality. They showed that more generally, for Bayesian games, QM provides a clear and indisputable advantage over all classical resources.

3.2. Non-Locality in Conflict Interest Games

Brunner and Linden showed that QM indeed provides an advantage over classical resources for all Bayesian games, but the examples they provided were all common interest games (games where it is beneficial for both the players to cooperate rather than oppose each other). In fact, until 2012, all other known non-local games, including the GHZ-Mermin game [16], the Bell-CHSH game [4], and the hidden matching game [17] [18] were all examples of common interest games (mostly, because the average payoff functions for both Alice and Bob were the same).

In 2012, Zu et al. [19] proposed a zero-sum (conflict) game where a player using proper quantum strategies could always win. However, for zero-sum games, all strategies are Pareto optimal, meaning, the sum of payoffs is the same for all strategies. In 2015, Anna Pappa et al. [20] demonstrated that quantum advice can offer an advantage compared to classical advice even in conflicting interest games. They explicitly constructed an incomplete information game with conflicting interests, where quantum strategies yielded fair equilibria with average payoffs strictly higher than those achievable by classical means, for both the players. Hence, Anna Pappa’s work [ibid] was the first where the sum of payoffs was being increased above the classical maximum by using quantum strategies.

3.3. Fair and Unfair Strategies

Classical equilibria can be of two types:

· Fair equilibria, where the average payoffs for both the players are equal;


· Unfair equilibria, where the payoffs for the players are unequal.

Up until 2016, most of the games (both common interest and conflicting interest) proposed, dealt with fair equilibria—that is, they showed that quantum fair payoffs surpass classical fair equilibrium payoffs. In 2016, Roy et al. [21] showed that quantum strategies can outperform not only fair classical equilibrium strategies but unfair strategies too. They analytically characterized some non-local correlations, that would yield unfair average payoffs strictly higher than the classical ones in Anna Pappa’s game.

3.4. Social Welfare Solutions and Pure Entangled States

Until now, we’ve been concerned only with equilibria for individual players—states where the players can’t increase their payoffs further by unilaterally changing their individual strategies. Such equilibria are called correlated equilibria (as opposed to Nash equilibria). Psychological factors indicate that sometimes, instead of focusing solely on their individual payoffs, players may also consider additional social goals—one such idea is the Social Welfare Solution (SWS). In such a strategy, players aim to maximize the sum of their individual payoffs. Out of all the possible quantum strategies, the ones that increase the sum of the payoffs (above the classical value) are called Quantum Social Welfare Solution (QSWS) and the quantum state producing this strategy is called Quantum Social Welfare Advice (QSWA).

In 2019, Banik et al. [22] showed that any two-qubit pure entangled state can act as QSWA for some Bayesian game. Hence given any pure entangled state between two qubits, there exists at least one game where this state provides QSWS.

4. Mixed Entangled States and the I-3322 Inequality

A mixed entangled state is a convex combination of pure states that cannot be produced by local operations and classical communication. The decomposition of a mixed entangled state (with density matrix ρ = k p k ρ 1 k ρ 2 k ρ n k where 0 < p k < 1 are the probabilities and ρ i k is the k-th pure state density matrix for the i-th party) into the corresponding pure states ( ρ i k ) is not unique however, and there is no direct way to extend Banik’s result [22] to create games where a mixed entangled state can provide QSWS.

The above discussion raises the question:

Can mixed entangled states be used as QSWA for Bayesian games at all?

We answer this question in the affirmative, by explicitly constructing a proof-of-principle Bayesian game, where a mixed entangled state gives higher unfair payoffs and higher social payoffs than classical equilibria.

4.1. The Premise

We consider two players Alice (A) and Bob (B) playing a Bayesian game while being refereed by Charlie. Both Alice and Bob have 3 possible measurement settings ({A1, A2, A3} and {B1, B2, B3}) which result in one of two outcomes {0, 1} each. Charlie asks A and B to implement one of these measurements each (i.e. Ai, Bj) and they reply with their respective measurement outcomes (x, y). In this scenario, we define P ( x , y | A i , B j ) to be the probability that when A is asked Ai and B is asked Bj, they reply with x and y as their measurement outcomes, respectively, with x , y { 0 , 1 } .

First, we construct the classical game. Here the measurement settings can be thought of as questions asked by Charlie to Alice and Bob, and the measurement outcomes as their answers to the questions.

4.2. The Classical Game

4.2.1. Classical Strategies

A classical strategy means A and B both locally decide their answers to the questions. For each question, A or B can answer either 0 or 1. So for the entire set of 3 questions, there are 23 = 8 different sets of answers. Each such set of answers is called a strategy for that particular player. For example, if A decides to answer 0 to all questions (that is 0 for A1, 0 for A2 and 0 for A3) then her strategy is 000.

We label these strategies {gi} by converting the binary answer sequence (for A1, A2, A3 or B1, B2, B3, in this order) into its decimal equivalent. For example, 000 becomes g0 and 010 becomes g2 and so on. The ordered pair of Alice and Bob’s individual strategies ( g i A , g j B ) called a strategy pair for A and B.

4.2.2. Probability Boxes

The probability box (also called local box) is a table which shows how the strategy relates the questions to the answers. It shows for each question, with what probability a player chooses a particular answer. There is a one-to-one relation between the strategy ordered pair ( g i A , g j B ) and the probability box.

Local boxes respect locality, that is the probability that A gives a particular answer to some question is independent of what B is asked and what his response is. For the sake of convenience, a general classical probability box is usually written in the form shown in Table 1. {Cij, Mi, Nj} are all probabilities and hence ∈ {0, 1}.

Row AiBj and column xy represents probability of answering (x, y) for the

Table 1. Form of a general probability box.

question AiBj, that is P ( x , y | A i , B j ) . It is easy to see that this is a local box, since, for example, the probability that A answers 0 to A1B1 is P ( 00 | A 1 B 1 ) + P ( 01 | A 1 B 1 ) = M 1 which is the same as the probability that A answers 0 to A1B2 or A1B3, etc. So the probability that A given question A1 answers 0 is the same independent of what question B is asked.

4.2.3. Utility Boxes

For a particular game, each player chooses one out of these 8 strategies available to them. While the strategy dictates the move or answers that the player gives upon being asked the question, the reward or payoff he gets from that answer is described by the utility box. Given the strategy pair ( g i A , g j B ), each player’s individual payoffs can be calculated from the utility boxes.

A’s answers are listed along the columns and B’s along the rows. For a question pair (Ai, Bj), the ordered pair (u1, u2) in the row x and column y of the corresponding utility box represents the payoffs A and B get, respectively, on answering with x and y. We designate A’s reward as u 1 = u A ( x , y | A i , B j ) and B’s as u 2 = u B ( x , y | A i , B j ) . The utility boxes we use are listed below.

For questions A1B1, A1B2, A1B3 0 1 0 2 3 , 1 1 3 , 0 1 0 , 1 3 0 , 1 3

For questions A2B1 and A3B2 0 1 0 1 2 , 0 1 2 , 0 1 1 2 , 1 1 2 , 0

For questions A2B3 and A3B2 0 1 0 2 3 , 1 3 1 3 , 2 3 1 1 3 , 2 3 1 3 , 2 3

For questions A2B2 0 1 0 1 3 , 2 3 1 3 , 2 3 1 2 3 , 1 3 1 3 , 2 3

For questions A3B3 0 1 0 0 , 0 1 3 , 1 3 1 1 3 , 1 3 0 , 0

4.2.4. Classical Payoffs

For each strategy pair ( g i A , g i B ) that Alice and Bob choose, they get a payoff, which can be calculated by using the strategy (probability box) to find the players answer and then using the utility box to find the corresponding payoff. The expected payoffs (FA, FB) are then calculated by averaging over all possible questions as follows:

F B = x , y , i , j p ( i , j ) P ( x , y | A i , B j ) u B ( x , y , A i , B j )

where, p ( i , j ) is the probability that the question pair (Ai, Bj) is asked. In our game, Charlie asks Alice and Bob each question pair with equal probability. Then, p ( i , j ) = 1 N 2 ( i , j ) where N is the number of questions. Here, there are 3 questions for each party so p ( i , j ) = 1 9 ( i , j ) .

The classical payoffs, using the probability box for P ( x , y | A i , B j ) and the utility boxes for uA and uB, are then:

F A = 1 9 ( C 11 + C 12 + C 13 + C 21 + C 31 C 23 C 32 + C 22 M 1 2 N 1 N 2 M 3 3 + N 3 3 + 2 ) F B = 1 9 ( C 11 + C 12 + C 13 + C 21 + C 31 C 23 C 32 + C 22 M 1 2 N 1 N 2 + M 3 3 N 3 3 + 3 ) (1)

The Cij, Mi, Nj values (∈{0, 1} for classical strategies) are completely determined by the strategy pair ( g i A , g j B ). Moreover, since the expressions for FA and FB are different, the payoffs are in general unfair.

4.2.5. Classical Equilibria

Since each of the players has a choice of 8 different strategies ( g 0 , g 1 , , g 7 ), the final payoff box is an 8 × 8 table (see Table 2) of ordered pairs, with the first entry being the payoff for Alice and the second one being the payoff for Bob. A

Table 2. Payoff table.

factor of 1 27 has been ignored in Table 2, to keep things cleaner.

The equilibria (all are biased/unfair) have been indicated in bold font. These are the stable states for this game. Also, social welfare solution payoff is 15 27 . Our next task is to check whether a quantum strategy can increase payoffs of the individual parties above the classical values.

4.3. Quantum Game

Now, we devise the means to play this game using a quantum state. In this scenario, the two players share a Mixed Entangled State. They are asked questions A1, A2, A3 and B1, B2, B3 respectively, and they get their answer by performing suitable measurements on the shared state. The objective is to generate a payoff for both players that exceed the classical equilibrium payoffs.

We do this by implanting a quantum inequality in the payoff function so that quantum processes can exceed the upper bound for classical processes and hence produce payoffs higher than all classical payoffs.

4.3.1. The Inequality

We choose the I-3322 inequality. This inequality was discovered in 2003 by Collins and Gisin [5], but little work was done on it, other than finding it’s maximal violation value using infinite dimensional quantum systems in 2010 [23].

The important thing about this inequality is that it is inequivalent to the Bell-CHSH inequality. This means that there are states that don’t violate Bell-CHSH inequality but violate this.

The inequality is usually represented in the following way:

1 0 0 2 1 1 1 1 1 1 1 0 1 1 0

where the numbers correspond to the coefficients of:

P ( A 1 ) P ( A 2 ) P ( A 3 ) P ( B 1 ) P ( A 1 B 1 ) P ( A 2 B 1 ) P ( A 3 B 1 ) P ( B 2 ) P ( A 1 B 2 ) P ( A 2 B 2 ) P ( A 3 B 2 ) P ( B 3 ) P ( A 1 B 3 ) P ( A 2 B 3 ) P ( A 3 B 3 )

in the expression. Here, for succinctness, we write P (00|AiBj) as P (AiBj) and P (0|Ai) as P (Ai).

Rewriting the inequality in our chosen nomenclature, we get

S = 1 3 P ( 01 | A 1 B 1 ) 2 3 P ( 10 | A 1 B 1 ) + 1 3 P ( 00 | A 1 B 2 ) 1 3 P ( 01 | A 1 B 2 ) 1 3 P ( 10 | A 1 B 2 ) + 2 3 P ( 00 | A 1 B 3 ) 1 3 P ( 01 | A 1 B 3 ) + 1 3 P ( 00 | A 2 B 1 ) 2 3 P ( 10 | A 2 B 1 ) + 2 3 P ( 00 | A 2 B 2 ) 1 3 P ( 10 | A 2 B 2 ) P ( 00 | A 2 B 3 ) + 1 3 P ( 00 | A 3 B 1 ) 2 3 P ( 10 | A 3 B 1 ) 4 3 P ( 00 | A 3 B 2 ) 1 3 P ( 10 | A 3 B 2 ) (2)

After plugging in the variables from the probability box, Equation (2) becomes

S = C 11 + C 12 + C 13 + C 21 + C 22 C 23 + C 31 C 32 M 1 2 N 1 N 2 . (3)

4.3.2. Maximum Violation of the Inequality

For all classical systems, I-3322 satisfies S ≤ 0. For quantum mechanical systems however, a numerical optimization suggests that the maximum value is 0.25 [5]. The same is suggested by another approach using infinite dimensional quantum systems [23].

The state that produces this maximum value is the maximally entangled Bell state | ψ ¯

| ψ ¯ = 1 2 ( | 01 | 10 ) (4)

Choosing appropriate measurements for A and B, gives the value of the inequality

S | ψ ¯ = 0.25 .

Also, since F A + F B = 1 9 ( 2 S + 5 ) and this state gives the maximum possible value of S, this state is automatically the SWS for this game.

However, since this inequality is in-equivalent to the Bell-CHSH inequality, there exist states that violate this inequality but not the Bell-CHSH inequality. We choose one such mixed entangled state and corresponding measurements, with the aim to increase the payoffs beyond classical limits.

4.3.3. The Quantum State

The state shared between the A and B is the following mixed entangled state:

ρ A B = 0.85 | Φ Φ | + 0.15 | 01 01 |


| Φ = 1 5 ( 2 | 00 + | 11 ) (5)

The density matrix for the state ρAB is then:

ρ A B = [ 0.68 0 0 0.34 0 0.15 0 0 0 0 0 0 0.34 0 0 0.17 ]

4.3.4. The Measurements

The 6 questions in the classical game have their corresponding measurements for the quantum version. These are all projective measurements, specified by their polar and azimuthal angles (θ, φ). The probabilities for these measurements are calculated by applying the density matrix of the proper eigenvalue of the measurement operator on the density matrix of the quantum state and then taking its trace.

A 1 ( η , 0 ) , A 2 ( η , 0 ) , A 3 ( π 2 , 0 )

B 1 ( χ , 0 ) , B 2 ( χ , 0 ) , B 3 ( π 2 , 0 )

Such that cos η = 7 8 and cos χ = 2 3 .

Applying the measurements, with the appropriate eigenvalues, we find out all the elements of the probability box as follows:

M 1 = 0.808687 , M 2 = 0.808687 , M 3 = 0.5

N 1 = 0.646969 , N 2 = 0.646969 , N 3 = 0.5

C 11 = 0.576785 , C 12 = 0.646188 , C 13 = 0.464447 , C 21 = 0.646188 , C 22 = 0.576785 , C 23 = 0.344239 , C 31 = 0.421634 , C 32 = 0.225335 , C 33 = 0.08

4.3.5. Quantum Payoffs

The quantum payoffs are then calculated using the same formulae as those for classical payoffs. Putting the values in Equation (1), we get:

F A = 6.03858 27 and F B = 9.03858 27 (6)

The quantum payoff values from Equation (6), that is ( 6.03858 27 , 9.03858 27 ) is greater than the classical equilibrium value ( 6 27 , 9 27 ).

Also, the quantum social welfare value 15.0772 27 exceeds that for all classical equilibria ( 15 27 ).

5. Discussions and Conclusions

We have, hence, constructed a game where a mixed entangled state provides higher individual payoffs than the classical equilibria. The social welfare payoff is also increased beyond the upper limit for the classical scenario. Note that the quantum strategy that we chose generated higher payoffs than one particular classical equilibrium but by modifying the utility boxes, it is possible to dominate any particular classical equilibrium without disrupting the social welfare value, thus preserving the QSWA. It is also possible to increase the social welfare

value to its upper limit (strict inequality still holds) for quantum systems, 16.5 27

by modifying the coefficients of the mixed entangled state. Finally, we point out that given this particular quantum advice from the referee, the measurement settings chosen maximize the Social Welfare Value and thus is a restricted SWS.

However it still remains an open question whether similar to pure entangled states, every mixed entangled state can be used as QSWA for some Bayesian game.


Authors are thankful to Prof. G. Kar, ISI, Kolkata for his guidance.


1Bell-Clauser-Horne-Shimony-Holt inequality, 1969.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.


[1] Einstein, A., Podolsky, B. and Rosen, N. (1935) Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? Physical Review, 47, 777-780.
[2] Bohr, N. (1935) Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? Physical Review, 48, 696-702.
[3] Bell, J.S. (1987) Speakable and Unspeakable in Quantum Mechanics: Collected Papers on Quantum Philosophy. Cambridge University Press, Cambridge.
[4] Clauser, J.F., Horne, M.A., Shimony, A. and Holt, R.A. (1969) Proposed Experiment to Test Local Hidden-Variable Theories. Physical Review Letters, 23, 880-884.
[5] Collins, D. and Gisin, N. (2003) A Relevant Two Qubit Bell Inequality Equivalent to the CHSH Inequality. Journal of Physics A, 37, 6.
[6] Gibbons, R. (1992) Game Theory for Applied Economists. Princeton University Press, Princeton.
[7] Ordeshook, P. (1986) Game Theory and Political Theory: An Introduction. Cambridge University Press, Cambridge.
[8] Colman, A. (1995) Game Theory and Its Applications: In the Social and Biological Sciences. Psychology Press, East Sussex.
[9] Osborne, M.J. (2003) An Introduction to Game Theory. Oxford University Press, Oxford.
[10] Neumann, V. and Morgenstern, O. (1994) Theory of Games and Economic Behavior. Princeton University Press, Princeton.
[11] Nash, J.F. (1950) Equilibrium Points in n-Person Games. PNAS, 36, 48-49.
[12] John, C.H. (1968) Games with Incomplete Information Played by “Bayesian” Players, I-III. Part II. Bayesian Equilibrium. Management Science, 14, 320-334.
[13] Robert, J.A. (1974) Subjectivity and Correlation in Randomized Strategies. Journal of Mathematical Economics, 1, 67-96.
[14] Nicolas, B. and Noah, L. (2013) Bell Nonlocality and Bayesian Game Theory. Nature Communications, 4, 2057.
[15] Taksu, C. and Azhar, I. (2008) Bayesian Nash Equilibria and Bell Inequalities. Journal of the Physical Society of Japan, 77, Article ID: 024801.
[16] Mermin, N.D. (1990) Quantum Mysteries Revisited. American Journal of Physics, 58, 731-734.
[17] Mermin, N.D. (1990) Simple Unified Form for the Major No-Hidden-Variables Theorems. Physical Review Letters, 65, 3373-3376.
[18] Asher, P. (1990) Incompatible Results of Quantum Measurements. Physics Letters A, 151, 107-108.
[19] Zu, C., Wang, Y.-X., Chang, X.-Y., Wei, Z.-H., Zhang, S.-Y. and Duan, L.-M. (2012) Experimental Demonstration of Quantum Gain in a Zero-Sum Game. New Journal of Physics, 3, Article ID: 033002.
[20] Pappa, A., Kumar, N., Lawson, T., Santha, M., Zhang, S., Diamanti, E. and Kerenidis, I. (2015) Nonlocality and Conflicting Interest Games. Physical Review Letters, 114, Article ID: 020401.
[21] Roy, A., Mukherjee, A., Guha, T., Ghosh, S., Bhattacharya, S. and Banik, M. (2016) Nonlocal Correlations: Fair and Unfair Strategies in Bayesian Games. Physical Review A, 94, Article ID: 032120.
[22] Banik, M., Bhattacharya, S., Ganguly, N., Guha, T., Ghosh, S., Mukherjee, A., Rai, A. and Roy, A. (2019) Bayesian Games, Social Welfare Solutions and Quantum Entanglement. Quantum, 3, 185.
[23] Pal, K.F. and Vertesi, T. (2010) Maximal Violation of the I3322 Inequality Using Infinite Dimensional Quantum Systems. Physical Review A, 82, Article ID: 022116.

Copyright © 2022 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.