Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0311100

Distinguishing maximally entangled states locally

Dong Yang, Yi-Xin Chen

Published Nov 14, 2003• 2 citations
arXivHTMLPDF

Abstract

We demonstrate that one maximally entangled state is sufficient and necessary to distinguish a complete basis of maximally entangled states by local operation and classical communication.
DOI
10.48550/arxiv.quant-ph/0311100

Related papers

Distinguishing bipartite states by local operations and classical communication

Heng Fan

We present a general method for distinguishing bipartite states by local operations and classical communication. It unifies several available methods together. This method is applicable for arbitrary bipartite states, i.e., it works not only for entangled states but also for separable states. We also study the local distinguishability for maximally entangled states which are in an arbitrary basis.

Physical Review A•Jan 31, 2007•56 citations

Local distinguishability of maximally entangled states in canonical form

Zhichao Zhang, Fei Gao, Su‐Juan Qin +2 more

Quantum Information Processing•Aug 14, 2015•5 citations

Distinguishing Maximally Entangled States by PPT Operations and Entanglement Catalysis Discrimination

Nengkun Yu, Runyao Duan, Mingsheng Ying

In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of $d\otimes d$ PPT distinguishable MES is at most $d$, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in $4\otimes 4$ state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists $d$ MES in $d\otimes d$ state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states $K$ such that $K^{\otimes m}$ is locally distinguishable for some finite $m$. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a $2\otimes 2$ entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.

•Jul 16, 2011•1 citation

Existence of Locally Maximally Entangled Quantum States via Geometric Invariant Theory

Jim Bryan, Zinovy B. Reichstein, Mark Van Raamsdonk B

arXiv:1708.01645•Annales Henri Poincaré•May 31, 2018•18 citations

Local discrimination of lattice states via complete graph

Qianqian Liu, Ying‐Hui Yang, Pei-Ying Chen +1 more

Abstract In this paper, we use graph theory to study the distinguishability of lattice states under local operations and classical communication (LOCC) in C p 2 ⨂ C p 2 . Firstly, we present that for the basis of lattice unitary matrices, there are (p 2 + 1)(p + 1) distinct maximal commuting sets in p 2-dimensional system. Secondly, for any set  of lattice states, we can obtain a graph G which consists of some k-complete subgraphs. Using the graph G, we show that the set  can be distinguished by one-way LOCC if n ( p + 1 ) − ∑ k = 1 p + 1 s k ( k − 1 ) < ( p 2 + 1 ) ( p + 1 ) , where n is the number of vertices of a graph G and s k is the number of k-complete subgraphs. Moreover, we also proved that this conclusion is necessary and sufficient in C 2 2 ⨂ C 2 2 . For C p 2 ⨂ C p 2 system, our result can cover the results in (2015, Phys. Rev. A 92, 042 320); (2020, Sci. China-Phys. Mech. Astron. 63, 280 312).

Physica Scripta•Sep 20, 2023•2 citations

Polynomial Separation between One-Way and Two-Way LOCC in Discrimination of Maximally Entangled States

Youngrong Lim

One-way local operations and classical communication (LOCC) can fail to distinguish four orthogonal maximally entangled states in every local dimension $d\ge4$. We show that every set of $k$ pairwise orthogonal maximally entangled states in $\mathbb C^d\otimes\mathbb C^d$ is perfectly distinguishable by an $A\to B\to A$ protocol whenever $d\ge Ck^4[\log(2k)]^ν$, for universal constants $C,ν>0$. A single feedback message therefore raises the number of candidates that can always be distinguished from a constant to $Ω\!\left(d^{1/4}/(\log d)^{ν/4}\right)$, establishing a polynomial separation between one-way and two-way LOCC. In our protocol, Alice preserves exact orthogonality while reducing overlaps between Bob's conditional subspaces. Bob reduces the candidates to a singleton or an orthogonal pair and refines his outcome so that Alice can complete the discrimination. As a corollary, nine copies suffice for perfect two-way LOCC discrimination of any orthogonal maximally entangled set in all sufficiently large local dimensions.

quant-pharXiv:2610.04288•Oct 6, 2026•0 citations
In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of d⊗dd\otimes dd⊗d PPT distinguishable MES is at most ddd, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in 4⊗44\otimes 44⊗4 state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists ddd MES in d⊗dd\otimes dd⊗d state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states KKK such that K⊗mK^{\otimes m}K⊗m is locally distinguishable for some finite mmm. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a 2⊗22\otimes 22⊗2 entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.
Abstract In this paper, we use graph theory to study the distinguishability of lattice states under local operations and classical communication (LOCC) in C p 2 ⨂ C p 2 . Firstly, we present that for the basis of lattice unitary matrices, there are (p 2 + 1)(p + 1) distinct maximal commuting sets in p 2-dimensional system. Secondly, for any set  of lattice states, we can obtain a graph G which consists of some k-complete subgraphs. Using the graph G, we show that the set  can be distinguished by one-way LOCC if n ( p + 1 ) − ∑ k = 1 p + 1 s k ( k − 1 ) < ( p 2 + 1 ) ( p + 1 ) , where n is the number of vertices of a graph G and s k is the number of k-complete subgraphs. Moreover, we also proved that this conclusion is necessary and sufficient in C 2 2 ⨂ C 2 2 . For C p 2 ⨂ C p 2 system, our result can cover the results in (2015, Phys. Rev. A 92, 042 320); (2020, Sci. China-Phys. Mech. Astron. 63, 280 312).
One-way local operations and classical communication (LOCC) can fail to distinguish four orthogonal maximally entangled states in every local dimension d≥4d\ge4d≥4. We show that every set of kkk pairwise orthogonal maximally entangled states in Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd is perfectly distinguishable by an A→B→AA\to B\to AA→B→A protocol whenever d≥Ck4[log⁡(2k)]νd\ge Ck^4[\log(2k)]^νd≥Ck4[log(2k)]ν, for universal constants C,ν>0C,ν>0C,ν>0. A single feedback message therefore raises the number of candidates that can always be distinguished from a constant to Ω ⁣(d1/4/(log⁡d)ν/4)Ω\!\left(d^{1/4}/(\log d)^{ν/4}\right)Ω(d1/4/(logd)ν/4), establishing a polynomial separation between one-way and two-way LOCC. In our protocol, Alice preserves exact orthogonality while reducing overlaps between Bob's conditional subspaces. Bob reduces the candidates to a singleton or an orthogonal pair and refines his outcome so that Alice can complete the discrimination. As a corollary, nine copies suffice for perfect two-way LOCC discrimination of any orthogonal maximally entangled set in all sufficiently large local dimensions.