Quantum refereed game

Quantum refereed game in quantum information processing is a class of games in the general theory of quantum games. ^[1] It is played between two players, Alice and Bob, and arbitrated by a referee. The referee outputs the pay-off for the players after interacting with them for a fixed number of rounds, while exchanging quantum information.

Definition

An ${\displaystyle n}$-turn quantum referee performs ${\displaystyle n}$ rounds of interaction with the player Alice and Bob. Each interaction involves receiving some quantum states from Alice and Bob, processing the quantum states together with the "left-over" state from the previous interaction, producing some output state, and sending part of the output state to the players. At the end of the ${\displaystyle n}$ rounds, the referee processes the final state received from the players and decides the pay-off for Alice and Bob. The role of the referee is to pass along qubits to players Alice and Bob. It is the referee's job to entangle the qubits, which is argued to be essential in quantum games. When Alice and Bob return the qubits to the referee, the referee then checks their final states. ^[2]

Quantum Refereed Games

Mathematically, an n-turn referee is a measuring co-strategy ${\displaystyle \{R_{a}:a\in \Sigma \}}$ whose input spaces ${\displaystyle {\mathcal {X}}_{1},\cdots ,{\mathcal {X}}_{n}}$ and output spaces ${\displaystyle {\mathcal {Y}}_{1},\cdots ,{\mathcal {Y}}_{n}}$ are of the form

${\displaystyle {\mathcal {X}}_{k}={\mathcal {A}}_{k}\otimes {\mathcal {B}}_{k}}$ and ${\displaystyle {\mathcal {Y}}_{k}={\mathcal {C}}_{k}\otimes {\mathcal {D}}_{k}}$

for complex Euclidean spaces ${\displaystyle {\mathcal {A}}_{k},{\mathcal {B}}_{k},{\mathcal {C}}_{k}}$ and ${\displaystyle {\mathcal {D}}_{k},\ 1\leq k\leq n}$.

${\displaystyle {\mathcal {A}}_{k},{\mathcal {B}}_{k}}$ represent the message sent by the referee to Alice and Bob during turn ${\displaystyle k}$, and ${\displaystyle {\mathcal {C}}_{k},{\mathcal {D}}_{k}}$ correspond to their responses. At the end of ${\displaystyle n}$ turns, the referee produces an output ${\displaystyle a\in \Sigma }$

An ${\displaystyle n}$-turn quantum refereed game consists of an n-turn referee along with functions ${\displaystyle V_{A},V_{B}:\Sigma \mapsto \mathbb {R} }$ that maps each measurement output ${\displaystyle a}$ to Alice's and Bob's pay-off.

Individual quantum refereed games may place specific restrictions on strategies Alice and Bob can choose from. For example, in nonlocal games ^[3] and pseudo-telepathy games, ^[4] Alice and Bob are allowed to share entanglement but are forbidden from communicating. In general, such restrictions may not apply in quantum refereed games.

A language L is considered to have a refereed game with error ε if it has a polynomial time verifier satisfying these conditions: for each string x∈L Alice (the yes prover) can convince the referee to accept x with probability of at least 1-ε regardless of Bob's strategy (the no prover) and for each string x∉L Bob can convince the referee to reject x with a probability of at least 1-ε regardless of Alice's strategy. ^[5]

Zero-sum games

Similar to a classical zero-sum game, a zero-sum quantum refereed game ^[1] is a quantum refereed game with the additional constraint ${\displaystyle V_{A}(a)+V_{B}(a)=0}$.

It is natural to assume Alice and Bob play independent strategies in a zero-sum quantum refereed game, since it cannot simultaneously be to both players' advantage to communicate directly with one another or to initially share an entanglement state {reference}. In this case, Alice's and Bob's strategy can be represented by

${\displaystyle A\in {\mathcal {S}}_{n}({\mathcal {A}}_{1\cdots n},{\mathcal {C}}_{1\cdots n})}$ and ${\displaystyle B\in {\mathcal {S}}_{n}({\mathcal {B}}_{1\cdots n},{\mathcal {D}}_{1\cdots n})}$

where ${\displaystyle {\mathcal {S}}_{n}({\mathcal {X}}_{1\cdots n},{\mathcal {Y}}_{1\cdots n})}$ is the set of all n-turn strategies having input space ${\displaystyle {\mathcal {X}}_{1},\cdots ,{\mathcal {X}}_{n}}$ and output space ${\displaystyle {\mathcal {Y}}_{1},\cdots ,{\mathcal {Y}}_{n}}$.

The combined strategy is then ${\displaystyle A\otimes B}$.

Min-max theorem

Define ${\displaystyle V(a)=V_{A}(a)=-V_{B}(a)}$, and ${\displaystyle R=\sum _{a\in \Sigma }V(a)R_{a}}$, then Alice's expected pay-off is ${\displaystyle \sum _{a\in \Sigma }V(a)\langle A\otimes B,R_{a}\rangle =\langle A\otimes B,R\rangle }$

The optimal strategy for Alice then lies in the min-max problem

${\displaystyle \max _{A}\min _{B}\langle A\otimes B,R\rangle =\min _{B}\max _{A}\langle A\otimes B,R\rangle }$.

The above equality holds because ${\displaystyle A,B}$ are drawn from compact and convex sets ${\displaystyle {\mathcal {S}}_{n}({\mathcal {A}}_{1\cdots n},{\mathcal {C}}_{1\cdots n})}$ and ${\displaystyle {\mathcal {S}}_{n}({\mathcal {B}}_{1\cdots n},{\mathcal {D}}_{1\cdots n})}$. It is called the min-max theorem for zero-sum quantum games.

One turn games

One turn quantum refereed games are a sub set of quantum refereed games (QRG) where there are two unbounded players (Alice and Bob) and a computationally bounded referee. They are called one turn games or QRG1 because there is only one turn per game. The game works by having each player send a density matrix to the referee who then plugs those states into his quantum circuit. The winner of the game is decided by the outcome of the circuit where, Alice wins the majority of times when a "yes" or |1> state is produced by the circuit and Bob wins the majority of the time when a "no" or |0> state is produced by the circuit. ^[6]  A turn consists of the referee sending a message to the prover (Alice or Bob) and then Alice or Bob sending a response back to the referee. ^[5] The order of the game goes as follows: Alice sends the referee her density matrix, then the referee processes Alice's state and sends a state to Bob, Bob then measures the state and sends a classical result back to the referee, the referee then checks Bob's measurement and either produces a "yes" meaning Alice wins or produces a "no" and Bob wins. ^[5]

Bell state games

In a Bell State quantum refereed game, there are three participants, Alice, Bob, and the Referee. The game consists of three doors. Behind each door is either an x or an o (spin up state or spin down state). The referee gives Alice and Bob three conditions about what is behind each of the doors. For example, the conditions could be: 1) Doors1 and 2 have the same. 2) Doors 2 and 3 have the same. 3) Door 1 and 3 are different.

The aim of this game is for Alice and Bob to find a matching pair behind the doors. In quantum terms, this means that Alice and Bob produce matching density states. During the game, Alice and Bob are not allowed to communicate, but they are allowed to strategize before the game begins. They do this by sharing an entangled pair of photons. Strategizing allows for Alice and Bob to maximize their changes of winning. Without strategizing, Alice and Bob have a 2/3 chance of winning. By strategizing, Alice and Bob's probability of producing matching quantum states increases from 2/3 to 3/4. ^[7]

Quantum interactive proof with competing provers

A quantum interactive proof with two competing provers is a generalization of the single prover quantum interactive proof system. ^{[8] [9]} It can be modelled by zero-sum refereed games where Alice and Bob are the competing provers, and the referee is the verifier. The referee is assumed to be computationally bounded (polynomial size quantum circuit), whereas Alice and Bob can be computationally unrestricted. Alice, Bob and the referee receive a common string, and after fixed rounds of interactions (exchanging quantum information between the provers and the referee), the referee decides whether Alice wins or Bob wins.

Classical games

In the classical setting, RG can be viewed as the following problem. Alice, Bob, and the referee is given some statement. Alice is trying to convince the referee that the statement is true while Bob is trying to convince the referee that the statement is false. The referee, who has limited computing power, will look at the proofs provided by Alice and Bob, ask them questions, and at the end of the day decide which player is correct (wins). The goal is for the referee to find an algorithm such that if the statement is true, there is a way for Alice to win with probability greater than 3/4, and if the statement is false, there is a way for Bob to win with probability greater than 3/4. This probability is equal to 1-ε. ^[5]

In the language of complexity theory, a promise problem ${\displaystyle L=(L_{\text{yes}},L_{\text{no}})}$ has a classical refereed game (classical RG) if there exists a referee described by polynomial time randomized computation, such that

1. for each ${\displaystyle x\in L_{\text{yes}}}$, there is a strategy for Alice to win with probability ≥ 3/4, and

2. for each ${\displaystyle x\in L_{\text{no}}}$, there is a strategy for Bob to win with probability ≥ 3/4.

It is known that RG = EXP. ^{[10] [11]}

Quantum games

Quantum interactive proof systems with competing provers is a generalization of the classical RG where the referee is now restricted to polynomial-time generated quantum circuits and may exchange quantum information with the players. ^[1] Therefore, QRG can be seen as the following problem. Alice, Bob and the referee is given some statement (it may involve a quantum state). Alice is trying to convince the referee the statement is true while Bob is trying to convince the referee the statement is false. The referee can ask the provers questions via quantum states, receive answers in quantum states, and analyse the received quantum states using a quantum computer. After communicating with Alice and Bob for ${\displaystyle n}$ rounds, the referee decides whether the statement is true or false. If there is a way for the referee to make a correct decision with probability ≥ 3/4, the game is in QRG. This probability is ≥ 1-ε. ^[5]

More formally, QRG denotes the complexity class for all promise problems having quantum refereed games defined as follows. Given a string ${\displaystyle x}$, a promise problem ${\displaystyle L=(L_{\text{yes}},L_{\text{no}})}$ is in QRG if there is a referee represented by a polynomial time generated quantum circuit such that

1. if ${\displaystyle x\in L_{\text{yes}}}$, there exists a strategy for Alice to win with probability ≥ 3/4, and

2. if ${\displaystyle x\in L_{\text{no}}}$, there exists a strategy for Bob to win with probability ≥ 3/4.

It turns out that QRG = EXP — allowing the referee to use quantum circuit and send or receive quantum information does not give the referee any extra power. EXP ⊆ QRG follows from the fact that EXP = RG ⊆ QRG. proved QRG ⊆ EXP by a formulation of QRG using semidefinite programs (SDP).

Semidefinite program formulation

For a quantum refereed game, at the end of all the interactions, the referee outputs one of the two possible outcomes ${\displaystyle \{a,b\}}$ to indicate whether Alice wins ${\displaystyle (a)}$ or Bob wins ${\displaystyle (b)}$.

Setting ${\displaystyle V(a)=1,V(b)=0}$ results in a quantum refereed game whose value is the maximum winning probability for Alice.

Using the same notation as the zero sum quantum refereed game as above, the referee is represented by operators ${\displaystyle \{R_{a},R_{b}\}}$, Alice may pick a strategy from ${\displaystyle A\in {\mathcal {S}}_{n}({\mathcal {A}}_{1\cdots n},{\mathcal {C}}_{1\cdots n})}$, and Bob from ${\displaystyle B\in {\mathcal {S}}_{n}({\mathcal {B}}_{1\cdots n},{\mathcal {D}}_{1\cdots n})}$. Define

${\displaystyle \Omega _{a}(A)=\operatorname {Tr} _{{\mathcal {C}}_{1\cdots n}\otimes {\mathcal {A}}_{1\cdots n}}((A\otimes I_{{\mathcal {D}}_{1\cdots n}\otimes B_{1\cdots n}})R_{a})}$ , and

${\displaystyle \Omega _{b}(A)=\operatorname {Tr} _{{\mathcal {C}}_{1\cdots n}\otimes {\mathcal {A}}_{1\cdots n}}((A\otimes I_{{\mathcal {D}}_{1\cdots n}\otimes B_{1\cdots n}})R_{b})}$,

where ${\displaystyle \operatorname {Tr} _{\mathcal {X}}(Z)}$ is the partial trace operator.

The referee outputs ${\displaystyle a}$ with probability ${\displaystyle \langle A\otimes B,R_{a}\rangle =\langle B,\Omega _{a}(A)\rangle }$, and ${\displaystyle b}$ with probability ${\displaystyle \langle A\otimes B,R_{b}\rangle =\langle B,\Omega _{b}(A)\rangle }$. ${\displaystyle \{\Omega _{a}(A),\Omega _{b}(A)\}}$ can be considered as a co-strategy that merges Alice's strategy with the referee's.

For any given strategy ${\displaystyle A}$ Alice chooses, the maximum winning probability for Bob is

${\displaystyle \max _{B}\langle B,\Omega _{b}(A)\rangle }$,

which, by the property of the strategy representation, is equal to

${\displaystyle \min\{p\geq 0:\Omega _{b}(A)\leq pQ,\ Q\in {\text{co-}}{\mathcal {S}}_{n}({\mathcal {B}}_{1\cdots n},{\mathcal {D}}_{1\cdots n})\}}$.

Therefore, to maximize Alice's winning probability, ${\displaystyle p}$, the maximum winning probability for Bob, needs to be minimized over all possible strategies. The goal is then to compute

${\displaystyle {\begin{array}{rl}\min &p\\{\text{subject to}}&\Omega _{b}(A)\leq pQ,\\&A\in {\mathcal {S}}_{n}({\mathcal {A}}_{1\cdots n},{\mathcal {C}}_{1\cdots n}),\\&Q\in {\text{co-}}{\mathcal {S}}_{n}({\mathcal {B}}_{1\cdots n},{\mathcal {D}}_{1\cdots n})\end{array}}}$.

This minimization problem can be expressed by the following SDP problem: ^[1]

${\displaystyle {\begin{array}{rll}\min &\operatorname {Tr} (P_{1})\\{\text{subject to}}&\Omega _{b}(A_{n})\leq Q,\\&\operatorname {Tr} _{{\mathcal {C}}_{k}}(A_{k})=A_{k-1}\otimes I_{{\mathcal {A}}_{k}}&(2\leq k\leq n),\\&\operatorname {Tr} _{{\mathcal {C}}_{1}}(A_{1})=I_{{\mathcal {A}}_{1}},\\&Q_{k}=P_{k}\otimes I_{{\mathcal {D}}_{k}}&(1\leq k\leq n),\\&\operatorname {Tr} _{{\mathcal {B}}_{k}}(P_{k})=Q_{k-1}&(2\leq k\leq n),\\&A_{k}\in \operatorname {Pos} ({\mathcal {C}}_{1\cdots k}\otimes A_{1\cdots k})&(1\leq k\leq n),\\&Q_{k}\in \operatorname {Pos} ({\mathcal {D}}_{1\cdots k}\otimes B_{1\cdots k})&(1\leq k\leq n),\\&P_{k}\in \operatorname {Pos} ({\mathcal {D}}_{1\cdots k}\otimes B_{1\cdots k})&(1\leq k\leq n),\\\end{array}}}$.

The dimension of the input and output space of this SPD is exponential (from the tensor product states) in ${\displaystyle n}$, and the SDP has a size polynomial in the dimension of its input and output space. Since there are efficient algorithms that can solve SDP in polynomial-time, ^{[12] [13] [14]} it follows that QRG ⊆ EXP.

See also

• Min-max theorem
• Semidefinite programming
• QIP (complexity)

References

1. Gutoski, G; Watrous J (2007). "Toward a general theory of quantum games". Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. pp. 565–574. arXiv: quant-ph/0611234 . Bibcode:2006quant.ph.11234G. doi:10.1145/1250790.1250873. ISBN   9781595936318. S2CID   2329605.
2. "Let the quantum games begin". Physics World. 2002-10-02. Retrieved 2020-11-11.
3. Cleve, R; Hoyer P.; Toner B.; Watrous J. (2004). "Consequences and limits of nonlocal strategies". Proceedings of the 19th Annual IEEE Conference on Computational Complexity: 236–249. arXiv: quant-ph/0404076 . Bibcode:2004quant.ph..4076C.
4. Brassard, G.; Broadbent A.; Tapp A. (2005). "Quantum pseudo-telepathy". Foundations of Physics. 35 (11): 1877–1907. arXiv: quant-ph/0407221 . Bibcode:2005FoPh...35.1877B. doi:10.1007/s10701-005-7353-4. S2CID   7395322.
5. Gutoski, Gus; Watrous, John (2005). "Quantum Interactive Proofs with Competing Provers". Stacs 2005. Lecture Notes in Computer Science. Vol. 3404. pp. 605–616. arXiv: cs/0412102 . doi:10.1007/978-3-540-31856-9_50. ISBN   978-3-540-24998-6. S2CID   15662983.
6. Ghosh, Soumik (2020). "A study of one-turn quantum refereed games" (PDF). U Waterloo. Retrieved 2020-10-11.
7. Web.Stanford.Edu, 2020, http://web.stanford.edu/~oas/SI/QM/notes/SIQMWeek3.pdf .
8. Kitaev, A; Watrous J (2000). "Parallelization, amplification, and exponential time simulation of quantum interactive proof system". Proceedings of the 32nd AMC Symposium on Theory of Computing: 608–617.
9. Watrous, J (2003). "PSPACE has constant-round quantum interactive proof systems". Theoretical Computer Science. 292 (3): 575–588. doi: 10.1016/s0304-3975(01)00375-9 .
10. Koller, D; Megiddo N (1992). "The complexity of two-person zero-sum games in extensive form". Games and Economic Behavior. 4 (4): 528–552. CiteSeerX   10.1.1.30.7625 . doi:10.1016/0899-8256(92)90035-q.
11. Feige, U; Kilian J (1997). "Making games short (Extended abstract)". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. pp. 506–516. CiteSeerX   10.1.1.5.1990 . doi:10.1145/258533.258644. ISBN   978-0897918886. S2CID   15664449.
12. KHACHIYAN, L (1979). "A polynomial time algorithm in linear programming". Soviet Mathematics - Doklady. 20: 191–194.
13. Grötschel, M; Lovász L.; Schrijver, A. (1988). Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer. ISBN   978-3-642-97883-8.
14. Nesterov, Yurii; Nemirovskii, Arkadii (1994). Interior-Point Polynomial Algorithms in Convex Programming (PDF). SIAM Studies in Applied Mathematics. Vol. 13. doi:10.1137/1.9781611970791. ISBN   978-0-89871-319-0. S2CID   117194167.