Quantum refereed game

Definition

An n -turn quantum referee performs 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 n rounds, the referee processes the final state received from the players and decides the pay-off for Alice and Bob.

Mathematically, an n-turn referee is a measuring co-strategy { R a : a ∈ Σ } whose input spaces X 1 , ⋯ , X n and output spaces Y 1 , ⋯ , Y n are of the form

X k = A k ⊗ B k and Y k = C k ⊗ D k

for complex Euclidean spaces A k , B k , C k and D k ,   1 ≤ k ≤ n .

A k , B k represent the message sent by the referee to Alice and Bob during turn k , and C k , D k correspond to their responses. At the end of n turns, the referee produces an output a ∈ Σ

An n -turn quantum refereed game consists of an n-turn referee along with functions V A , V B : Σ ↦ R that maps each measurement output 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 and pseudo-telepathy games, Alice and Bob are allowed to share entanglement but are forbidden from communicating. In general, such restrictions may not apply in quantum refereed games.

Zero-sum quantum refereed game

Similar to a classical zero-sum game, a zero-sum quantum refereed game is a quantum refereed game with the additional constraint 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

A ∈ S n ( A 1 ⋯ n , C 1 ⋯ n ) and B ∈ S n ( B 1 ⋯ n , D 1 ⋯ n )

where S n ( X 1 ⋯ n , Y 1 ⋯ n ) is the set of all n-turn strategies having input space X 1 , ⋯ , X n and output space Y 1 , ⋯ , Y n .

The combined strategy is then A ⊗ B .

Min-max theorem

Define V ( a ) = V A ( a ) = − V B ( a ) , and R = ∑ a ∈ Σ V ( a ) R a , then Alice's expected pay-off is ∑ a ∈ Σ V ( a ) ⟨ A ⊗ B , R a ⟩ = ⟨ A ⊗ B , R ⟩

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

max A min B ⟨ A ⊗ B , R ⟩ = min B max A ⟨ A ⊗ B , R ⟩ .

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

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. 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 RG

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.

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

1. for each x ∈ L yes , there is a strategy for Alice to win with probability ≥ 3/4, and2. for each x ∈ L no , there is a strategy for Bob to win with probability ≥ 3/4.

It is known that RG = EXP.

QRG

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. 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 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.

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

1. if x ∈ L yes , there exists a strategy for Alice to win with probability ≥ 3/4, and2. if x ∈ L 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 { a , b } to indicate whether Alice wins ( a ) or Bob wins ( b ) .

Setting 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 { R a , R b } , Alice may pick a strategy from A ∈ S n ( A 1 ⋯ n , C 1 ⋯ n ) , and Bob from B ∈ S n ( B 1 ⋯ n , D 1 ⋯ n ) . Define

Ω a ( A ) = Tr C 1 ⋯ n ⊗ A 1 ⋯ n ⁡ ( ( A ⊗ I D 1 ⋯ n ⊗ B 1 ⋯ n ) R a ) , and Ω b ( A ) = Tr C 1 ⋯ n ⊗ A 1 ⋯ n ⁡ ( ( A ⊗ I D 1 ⋯ n ⊗ B 1 ⋯ n ) R b ) ,

where Tr X ⁡ ( Z ) is the partial trace operator.

The referee outputs a with probability ⟨ A ⊗ B , R a ⟩ = ⟨ B , Ω a ( A ) ⟩ , and b with probability ⟨ A ⊗ B , R b ⟩ = ⟨ B , Ω b ( A ) ⟩ . { Ω a ( A ) , Ω b ( A ) } can be considered as a co-strategy that merges Alice's strategy with the referee's.

For any given strategy A Alice chooses, the maximum winning probability for Bob is

max B ⟨ B , Ω b ( A ) ⟩ ,

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

min { p ≥ 0 : Ω b ( A ) ≤ p Q ,   Q ∈ co- S n ( B 1 ⋯ n , D 1 ⋯ n ) } .

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

min p subject to Ω b ( A ) ≤ p Q , A ∈ S n ( A 1 ⋯ n , C 1 ⋯ n ) , Q ∈ co- S n ( B 1 ⋯ n , D 1 ⋯ n ) .

This minimization problem can be expressed by the following SDP problem:

min Tr ⁡ ( P 1 ) subject to Ω b ( A n ) ≤ Q , Tr C k ⁡ ( A k ) = A k − 1 ⊗ I A k ( 2 ≤ k ≤ n ) , Tr C 1 ⁡ ( A 1 ) = I A 1 , Q k = P k ⊗ I D k ( 1 ≤ k ≤ n ) , Tr B k ⁡ ( P k ) = Q k − 1 ( 2 ≤ k ≤ n ) , A k ∈ Pos ⁡ ( C 1 ⋯ k ⊗ A 1 ⋯ k ) ( 1 ≤ k ≤ n ) , Q k ∈ Pos ⁡ ( D 1 ⋯ k ⊗ B 1 ⋯ k ) ( 1 ≤ k ≤ n ) , P k ∈ Pos ⁡ ( D 1 ⋯ k ⊗ B 1 ⋯ k ) ( 1 ≤ k ≤ n ) , .

The dimension of the input and output space of this SPD is exponential (from the tensor product states) in 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, it follows that QRG ⊆ EXP.