相关论文: Embezzlement States are Universal for Non-Local St…
We derive properties of general universal embezzling families for bipartite embezzlement protocols, where any pure state can be converted to any other without communication, but in the presence of the embezzling family. Using this…
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
We describe a two-player non-local game, with a fixed small number of questions and answers, such that an $\epsilon$-close to optimal strategy requires an entangled state of dimension $2^{\Omega(\epsilon^{-1/8})}$. Our non-local game is…
Embezzlement of entanglement refers to the task of extracting entanglement from an entanglement resource via local operations and without communication while perturbing the resource arbitrarily little. Recently, the existence of embezzling…
Van Dam and Hayden introduced a concept commonly referred to as embezzlement, where, for any entangled quantum state $\phi$, there is an entangled catalyst state $\psi$, from which a high fidelity approximation of $\phi \otimes \psi$ can be…
This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee…
We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be…
Universal embezzlers are bipartite quantum systems from which any entangled state may be extracted to arbitrary precision using local operations while perturbing the state of the system arbitrarily little. Here, we show that universal…
We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be…
Departing from the usual paradigm of local operations and classical communication adopted in entanglement theory, here we study the interconversion of quantum states by means of local operations and shared randomness. A set of necessary and…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
This paper considers a special class of nonlocal games $(G,\psi)$, where $G$ is a two-player one-round game, and $\psi$ is a bipartite state independent of $G$. In the game $(G,\psi)$, the players are allowed to share arbitrarily many…
We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2+O(log n/sqrt{n}). This improves upon a recent result of…
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…
Nonlocal games yield an unusual perspective on entangled quantum states. The defining property of such games is that a set of players in joint possession of an entangled state can win the game with higher probability than is allowed by…
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other…
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…