Related papers: Maximally entangled states in pseudo-telepathy gam…
An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate…
Bipartite entangled quantum states with a positive partial transpose (PPT), i.e., PPT entangled states, are usually considered very weakly entangled. Since no pure entanglement can be distilled from them, they are also called bound…
We give an $\dfrac{1}{54}$ separation between 5-party pseudo-telepathy games and two-local theories. We define the notion of strategy in a k-local theory for a game, and extend the method of Chao and Reichardt. We also study variation of…
We consider one-round games between a classical referee and two players. One of the main questions in this area is the parallel repetition question: Is there a way to decrease the maximum winning probability of a game without increasing the…
Absolutely maximally entangled, AME, states are pure multipartite states that give rise to the maximally mixed states when half or more of the parties are traced out. AME states find applications in fields like teleportation or quantum…
We propose genuine ($k$, $m$)-threshold controlling schemes for controlled teleportation via multi-particle entangled states, where the teleportation of a quantum state from a sender (Alice) to a receiver (Bob) is under the control of $m$…
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely satisfiable…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
Bound entangled states are states that are entangled but from which no entanglement can be distilled if all parties are allowed only local operations and classical communication. However, in creating these states one needs nonzero…
Within the context of semiquantum nonlocal games, the trust can be removed from the measurement devices in an entanglement-detection procedure. Here we show that a similar approach can be taken to quantify the amount of entanglement. To be…
To date all self-tests for high dimensional systems are confined to many-qubit states. This is due to two restrictions in the literature: the standard techniques for proving self-testing results apply only to qubits, and there are few…
We give conditions under which general bipartite entangled nonorthogonal states become maximally entangled states. By the conditions we construct a large class of entangled nonorthogonal states with exact one ebit of entanglement in both…
The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by…
A necessary and sufficient condition for the maximal entanglement of bipartite nonorthogonal pure states is found. The condition is applied to the maximal entanglement of coherent states. Some new classes of maximally entangled coherent…
We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are…
We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…
We show that {\it one} single-mode squeezed state distributed among $N$ parties using linear optics suffices to produce a truly $N$-partite entangled state for any nonzero squeezing and arbitrarily many parties. From this $N$-partite…
In imperfect-information games, agents must make decisions based on partial knowledge of the game state. The Belief Stochastic Game model addresses this challenge by delegating state estimation to the game model itself. This allows agents…
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…
Entanglement is a resource in quantum information theory when state manipulation is restricted to Local Operations assisted by Classical Communication (LOCC). It is therefore of paramount importance to decide which LOCC transformations are…