Related papers: Distinguishing maximally entangled states locally
We find that the mixed maximally entangled states exist and prove that the form of the mixed maximally entangled states is unique in terms of the entanglement of formation. Moreover, even if the entanglement is quantified by other…
We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total…
We show that there exist sets of three mutually orthogonal $d$-dimensional maximally entangled states which cannot be perfectly distinguished using one-way local operations and classical communication (LOCC) for arbitrarily large values of…
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular,…
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…
We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication.…
Absolutely Maximally Entangled (AME) states are maximally entangled for every bipartition of the system. They are crucial resources for various quantum information protocols. We present techniques for verifying either two AME states are…
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of…
We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally…
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 study the problem of distinguishing maximally entangled quantum states by using local operations and classical communication (LOCC). A question of fundamental interest is whether any three maximally entangled states in…
The transformations of $W$-type entangled states by using local operations assisted with classical communication are investigated. For this purpose, a parametrization of the $W$-type states which remains invariant under local unitary…
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 introduce an operational procedure to determine, with arbitrary probability and accuracy, optimal entanglement witness for every multipartite entangled state. This method provides an operational criterion for separability which is…
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…
We develop a novel method in classifying the multipartite entanglement state of $2\times N\times N$ under stochastic local operation and classical communication. In this method, all inequivalent classes of true entangled state can be…
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…
In this paper, we study the one-way local operations and classical communication (LOCC) problem. In $\mathbb{C}^d\otimes\mathbb{C}^d$ with $d\geq4$, we construct a set of $3\lceil\sqrt{d}\rceil-1$ one-way LOCC indistinguishable maximally…
We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show, that amazingly, classical communication between the parties can…