Related papers: Quantum Interactive Proofs with Competing Provers

We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…

Suppose that a polynomial-time mixed-state quantum circuit, described as a sequence of local unitary interactions followed by a partial trace, generates a quantum state shared between two parties. One might then wonder, does this quantum…

In two-prover one-round interactive proof systems, no-signaling provers are those who are allowed to use arbitrary strategies, not limited to local operations, as long as their strategies cannot be used for communication between them. Study…

We consider the recursive Fourier sampling problem (RFS), and show that there exists an interactive proof for RFS with an efficient classical verifier and efficient quantum prover.

This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of…

Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…

Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will…

This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant…

We present a protocol that transforms any quantum multi-prover interactive proof into a nonlocal game in which questions consist of logarithmic number of bits and answers of constant number of bits. As a corollary, this proves that the…

We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling from a classical distribution on a quantum device that is…

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an…

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to…

Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair…

Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…

Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are…

Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \class{NP}, known as QMA, in…

A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary…

The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot succeed with probability greater than 1-ln2 \approx 0.31, no matter how many players are…

Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary…

Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources. In that, two or more parties collaborate to perform an information processing task to achieve the highest…