相关论文: Entangled states that cannot reproduce original cl…
The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically…
When some of the parties of a multipartite entangled pure state are lost, the question arises whether the residual mixed state is also entangled, in which case the initial entangled pure state is said to be robust against particle loss. In…
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
We present a strong parallel repetition theorem for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our result is the first parallel repetition theorem for entangled games…
Looking for a quantum-mechanical implementation of duality, we formulate a relation between coherent states and complex-differentiable structures on classical phase space ${\cal C}$. A necessary and sufficient condition for the existence of…
Research in quantum games has flourished during recent years. However, it seems that opinion remains divided about their true quantum character and content. For example, one argument says that quantum games are nothing but 'disguised'…
The certification of entanglement in multipartite scenarios is crucial for the advancement of quantum technologies, particularly for the realization of large-scale quantum networks. Here, we introduce a method to certify the structure of…
We consider different settings of the task to distinguish pure orthogonal quantum states under local operations and a limited amount of classical communication. In the first setting, the spatially separated parties are allowed to perform…
We consider the class of (N+1)-partite states suitable for protocols where there is a powerful party, the authority, and the other N parties play the same role, namely the state of their system live in the symmetric Hilbert space. We show…
We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which…
A long-standing challenge in mixed quantum-classical trajectory simulations is the treatment of entanglement between the classical and quantal degrees of freedom. We present a novel approach which describes the emergence of entangled states…
There are good reasons to believe that we are classical algorithms run on (effectively) classical machines. However, the fact that a physical state of a system in a universe described by a classical deterministic model doesn't contain any…
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…
We investigate when the quantum correlations of a bipartite system, under the influence of environments with memory, are not reproducible with certainty by a classical local hidden variable model. To this purpose, we compare the dynamics of…
We introduce a family of highly symmetric bipartite quantum states in arbitrary dimensions. It consists of all states that are invariant under local phase rotations and local cyclic permutations of the basis. We solve the separability…
The explicit construction is presented of two-player game satisfying: (i) symmetry with respect to the permutation of the players; (ii) the existence of upper bound on total payoff following from Bell inequality; (iii) the existence of…
Simulating quantum algorithms with classical resources generally requires exponential resources. However, heuristic classical approaches are often very efficient in approximately simulating special circuit structures, for example with…
We obtain a necessary and sufficient condition for a finite set of states of a finite dimensional multiparticle quantum system to be amenable to unambiguous discrimination using local operations and classical communication. This condition…
In this paper we study the non-local properties of permutation symmetric states of n-qubits. We extend the bipartite Hardy paradox and the associated CH-inequality to n-party permutation symmetric states to show that all symmetric states…