Related papers: A bound on the quantum value of all compiled nonlo…

A cooperative multi-player quantum game played by 3 and 4 players has been studied. Quantum superposed operator is introduced in this work which solves the non-zero sum difficulty in previous treatment. The role of quantum entanglement of…

We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which…

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…

Games involving quantum strategies often yield higher payoff. Here, we study a practical realization of the three-player dilemma game using the superconductivity-based quantum processors provided by IBM Q Experience. We analyze the…

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…

Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of…

We develop a symmetric monoidal closed category of games, incorporating sums and products, to model quantum computation at higher types. This model is expressive, capable of representing all unitary operators at base types. It is compatible…

Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also serve for device-independent self-testing of states, as…

Quantum gambling --- a secure remote two-party protocol which has no classical counterpart --- is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to…

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…

This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two…

Remote entanglement enables coordinated decision making without communication and produces correlations beyond those achievable by any classical strategy, representing a practical quantum advantage in time-critical distributed…

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n…

We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…

Bell theorems of many-body nonlocality and contextuality serve as a benchmark for proving quantum advantage in that a quantum computer outperforms a classical computer for a certain problem. In practice, however, near-term quantum devices…

We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…

We formulate a series of non-trivial equalities which are satisfied by all no-signaling correlations, meaning that no faster-than-light communication is allowed with the resource of these correlations. All quantum and classical correlations…

Non-locality is a feature of quantum mechanics that cannot be explained by local realistic theory. It can be detected by the violation of Bell's inequality. In this work, we have considered the evaluation of Bell's inequality with the help…

An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes…