Related papers: Nonlocal Games as Cross-Platform Quantum Benchmark…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
Bell inequality violation is the phenomenon where multiple non-communicating parties can exhibit correlations using quantum resources that are impossible if they can only use classical resources. One way to enforce non-communication is to…
Interesting connection has been established between two apparently unrelated concepts, namely, quantum nonlocality and Bayesian game theory. It has been shown that nonlocal correlations in the form of advice can outperform classical…
With the rapid development of quantum hardware technologies, benchmarking the performance of quantum computers has become attractive. In this paper, we propose a new aspect of benchmarking quantum computers by evaluating the limitation of…
We introduce a two-player nonlocal game, called the $(G,H)$-isomorphism game, where classical players can win with certainty if and only if the graphs $G$ and $H$ are isomorphic. We then define the notions of quantum and non-signalling…
The multipartite correlations derived from local measurements on some composite quantum systems are inconsistent with those reproduced classically. This inconsistency is known as quantum nonlocality and shows a milestone in the foundations…
We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. The upper bound uses the famous Lov\'asz theta number and is…
We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the…
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…
It is by now well-established that there exist non-local games for which the best entanglement-assisted performance is not better than the best classical performance. Here we show in contrast that any two-player XOR game, for which the…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via a polynomial-time Karp reduction, we show that independent…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
To evaluate the performance of quantum computing systems relative to classical counterparts and explore the potential, we propose a game-solving benchmark based on Elo ratings in the game of tic-tac-toe. We compare classical convolutional…
Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…
A nonlocality anomaly in which a partially entangled state can outperform a maximally entangled state in a task exploiting nonlocality and several ways to remove the anomaly are discussed. A necessary condition for the anomaly to occur is…
Bipartite quantum states with higher Schmidt numbers have been shown to outperform those with lower Schmidt numbers in various quantum information processing tasks, highlighting the operational advantage of entanglement dimensionality.…
We generalize the quantum Prisoner's Dilemma to the case where the players share a non maximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which…
Nonlocal games with synchronous correlations are a natural generalization of functions between two finite sets. In this work we examine analogues of Bell's inequalities for such correlations, and derive a synchronous device-independent…
We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question whether every proper (tight) Bell inequality for two parties, other…