Related papers: Quantum Interactive Proofs with Competing Provers
We study multiprover interactive proof systems. The power of classical multiprover interactive proof systems, in which the provers do not share entanglement, was characterized in a famous work by Babai, Fortnow, and Lund (Computational…
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and…
We demonstrate quantum advantage with several basic assumptions, specifically based on only the existence of OWFs. We introduce inefficient-verifier proofs of quantumness (IV-PoQ), and construct it from classical bit commitments. IV-PoQ is…
We study the class of languages, denoted by $\MIP[k, 1-\epsilon, s]$, which have $k$-prover games where each prover just sends a \emph{single} bit, with completeness $1-\epsilon$ and soundness error $s$. For the case that $k=1$ (i.e., for…
A setup is proposed to play a quantum version of the famous bimatrix game of Prisoners' Dilemma. Multi-slit electron diffraction with each player's pure strategy consisting of opening one of the two slits at his/her disposal are essential…
We introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game where two players are given inputs with different function values and are asked to output some index $i$ such that…
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…
The double slit experiment provides a clear demarcation between classical and quantum theory, while multi-slit experiments demarcate quantum and higher-order interference theories. In this work we show that these experiments pertain to a…
Quantum multiprover interactive proof systems with entanglement MIP* are much more powerful than its classical counterpart MIP (Babai et al. '91, Ji et al. '20): while MIP = NEXP, the quantum class MIP* is equal to RE, a class including the…
A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for perfect quantum hedging: a board game with winning probability…
In repeated interactions between individuals, we do not expect that exactly the same situation will occur from one time to another. Contrary to what is common in models of repeated games in the literature, most real situations may differ a…
We use the example of playing a 2-player game with entangled quantum objects to investigate the effect of quantum correlation. We find that for simple game scenarios it is classical correlation that is the central feature and that these…
Complex cryptographic protocols are often constructed from simpler building-blocks. In order to advance quantum cryptography, it is important to study practical building-blocks that can be used to develop new protocols. An example is…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
In this note, we observe that quantum logspace computations are verifiable by classical logspace algorithms, with unconditional security. More precisely, every language in BQL has an (information-theoretically secure) streaming proof with a…
We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…
Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. The standard definition of self-testing does not apply in…
We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that…
Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common…
This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive…