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:2611.05317

Simple proof of conditions requiring maximal entanglement for local state verification and discrimination

Somshubhro Bandyopadhyay

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

For deterministic state verification by separable measurements, the Schmidt rank of an entangled resource must be at least that of the state being verified [N. Yu, R. Duan, and M. Ying, IEEE Trans. Inf. Theory 60, 2069 (2014)], and if the two are equal, the resource must be maximally entangled [S. Akibue, J. Miyazaki, and H. Osaka, Lett. Math. Phys. 116, 110 (2026)]. The latter was derived from a general theorem proved using algebraic geometry. In this paper, we give a simple, self-contained proof of both statements using only linear algebra. We then use these results to show that among pure entangled resources of local dimension at most $d$, a maximally entangled state of $\mathbb{C}^d\otimes\mathbb{C}^d$ is necessary and sufficient for perfect local discrimination of a generic orthogonal basis of $\mathbb{C}^d\otimes\mathbb{C}^d$, however weakly entangled. The same holds for local implementation of a generic orthogonal measurement.

DOI
10.48550/arxiv.2611.05317

Related papers

Local distinguishability with preservation of entanglement

Scott M. Cohen

I consider the 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 that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.

arXiv:quant-ph/0602026•Physical Review A•May 10, 2007•86 citations

Small sets of locally indistinguishable orthogonal maximally entangled states

Alessandro Cosentino, Vincent Russo

We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in $\complex^{d}\otimes\complex^{d}$ that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012)] gives an affirmative answer for the case $k = d$. We give, for the first time, a proof that such sets of states indeed exist even in the case $k < d$. Our result is constructive and holds for an even wider class of operations known as positive-partial-transpose measurements (PPT). The proof uses the characterization of the PPT-distinguishability problem as a semidefinite program.

arXiv:1307.3232•Quantum Information and Computation•Oct 1, 2014•30 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

Local cloning of entangled states

Vlad Gheorghiu, Li Zhi Yu, Scott M. Cohen

We investigate the conditions under which a set $\mathcal{S}$ of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in $\mathcal{S}$ must be full Schmidt rank and equally entangled under the $G$-concurrence measure, and (ii) the set $\mathcal{S}$ can be extended to a larger clonable set generated by a finite group $G$ of order $|G|=N$, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides $D$ exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all $D$; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in $D=3$ we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in $\mathcal{S}$. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.

arXiv:1004.5126•Physical Review A•Aug 11, 2010•12 citations

Positive-partial-transpose-indistinguishable states via semidefinite programming

Alessandro Cosentino

We present a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under partial transpose). When the states to be distinguished are given by the tensor product of Bell states, the semidefinite program simplifies to a linear program. In Phys. Rev. Lett. 109, 020506 (2012), Yu, Duan, and Ying exhibit a set of four maximally entangled states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, which is distinguishable by any PPT measurement only with probability strictly less than 1. Using semidefinite programming, we show a tight bound of $7/8$ on this probability ($3/4$ for the case of unambiguous PPT measurements). We generalize this result by demonstrating a simple construction of a set of $k$ states in ${\mathbb{C}}^{k}\ensuremath{\bigotimes}{\mathbb{C}}^{k}$ with the same property, for any $k$ that is a power of 2. By running numerical experiments, we show the local indistinguishability of certain sets of generalized Bell states in ${\mathbb{C}}^{5}\ensuremath{\bigotimes}{\mathbb{C}}^{5}$ and ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ previously considered in the literature.

arXiv:1205.1031•Physical Review A•Jan 18, 2013•84 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
For deterministic state verification by separable measurements, the Schmidt rank of an entangled resource must be at least that of the state being verified [N. Yu, R. Duan, and M. Ying, IEEE Trans. Inf. Theory 60, 2069 (2014)], and if the two are equal, the resource must be maximally entangled [S. Akibue, J. Miyazaki, and H. Osaka, Lett. Math. Phys. 116, 110 (2026)]. The latter was derived from a general theorem proved using algebraic geometry. In this paper, we give a simple, self-contained proof of both statements using only linear algebra. We then use these results to show that among pure entangled resources of local dimension at most ddd, a maximally entangled state of Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd is necessary and sufficient for perfect local discrimination of a generic orthogonal basis of Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd, however weakly entangled. The same holds for local implementation of a generic orthogonal measurement.
I consider the 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 that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.
We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of k≤dk \leq dk≤d orthogonal maximally entangled states in $\complex^{d}\otimes\complex^{d}$ that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012)] gives an affirmative answer for the case k=dk = dk=d. We give, for the first time, a proof that such sets of states indeed exist even in the case k<dk < dk<d. Our result is constructive and holds for an even wider class of operations known as positive-partial-transpose measurements (PPT). The proof uses the characterization of the PPT-distinguishability problem as a semidefinite program.
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.
We investigate the conditions under which a set S\mathcal{S}S of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in S\mathcal{S}S must be full Schmidt rank and equally entangled under the GGG-concurrence measure, and (ii) the set S\mathcal{S}S can be extended to a larger clonable set generated by a finite group GGG of order ∣G∣=N|G|=N∣G∣=N, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides DDD exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all DDD; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in D=3D=3D=3 we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in S\mathcal{S}S. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.
We present a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under partial transpose). When the states to be distinguished are given by the tensor product of Bell states, the semidefinite program simplifies to a linear program. In Phys. Rev. Lett. 109, 020506 (2012), Yu, Duan, and Ying exhibit a set of four maximally entangled states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, which is distinguishable by any PPT measurement only with probability strictly less than 1. Using semidefinite programming, we show a tight bound of 7/87/87/8 on this probability (3/43/43/4 for the case of unambiguous PPT measurements). We generalize this result by demonstrating a simple construction of a set of kkk states in ${\mathbb{C}}^{k}\ensuremath{\bigotimes}{\mathbb{C}}^{k}$ with the same property, for any kkk that is a power of 2. By running numerical experiments, we show the local indistinguishability of certain sets of generalized Bell states in ${\mathbb{C}}^{5}\ensuremath{\bigotimes}{\mathbb{C}}^{5}$ and ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ previously considered in the literature.
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.