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:1810.04460 · Physical Review A

Positive-partial-transpose distinguishability for lattice-type maximally entangled states

Zong-Xing Xiong, Mao-Sheng Li, Zhu‐Jun Zheng, Chuan-Jie Zhu, Shao-Ming Fei

Published Mar 28, 2019• 7 citations
arXivHTMLPDF

Abstract

We study the distinguishability of a particular type of maximally entangled states---the ``lattice states''---using an approach of a semidefinite program. With this, we successfully construct all sets of four ququad-ququad orthogonal maximally entangled states that are locally indistinguishable and find some curious sets of six states having an interesting property of distinguishability. Also, some of the problems that arose from Cosentino and Russo [Quantum Inf. Comput. 14, 1098 (2013)] about the positive-partial-transpose distinguishability of lattice maximally entangled states can be answered.

DOI
10.1103/physreva.99.032346

Related papers

Distinguishability for the ququad-ququad orthogonal maximally entangled states

Zong-Xing Xiong, Mao-Sheng Li, Zhu‐Jun Zheng +2 more

We study the distinguishability of a particular type of maximally entangled states -- the states which are tensor products of Bell states in $\mathbb{C}^4\otimes\mathbb{C}^4$. We first prove that any three orthogonal ququad-ququad maximally entangled states can be distinguished with LOCC. Then we use a new approach of semidefinite program to construct all sets of four ququad-ququad orthogonal maximally entangled states that are PPT-indistinguishable and we find some interesting sets of six states having interesting property of distinguishability. Also, we show that our approach of the optimization problem can make some computational complex problem more tractable.

•Oct 10, 2018•0 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•28 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•80 citations

Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States

Nengkun Yu, Runyao Duan, Mingsheng Ying

We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communication. Before our work, it was unknown whether there is a set of d locally indistinguishable d⊗d orthogonal maximally entangled states for some positive integer d. We further show that a 2⊗2 maximally entangled state can be used to locally distinguish this set of states without being consumed, thus demonstrate a novel phenomenon of entanglement discrimination catalysis. Based on this set of states, we construct a new set K consisting of four locally indistinguishable states such that K(⊗m) (with 4(m) members) is locally distinguishable for some m greater than one. As an immediate application, we construct a noisy quantum channel with one sender and two receivers whose local zero-error classical capacity can achieve the full dimension of the input space but only with a multi-shot protocol.

arXiv:1107.3224•Physical Review Letters•Jul 13, 2012•149 citations

Local discrimination of four or more maximally entangled states

Guojing Tian, Sixia Yu, Fei Gao +2 more

In the $4\ensuremath{\bigotimes}4$ quantum system, four qubit lattice states are found to be either locally indistinguishable or distinguishable by using one-way classical communication only, presenting a curious and counterintuitive case in which two-way classical communication has no advantage. Based on these results, we explicitly construct sets of four, five, and even more maximally entangled states that can be locally distinguished only with the help of two-way classical communication, solving partially the open problem described by Nathanson [Phys. Rev. A 88, 062316 (2013)] and highlighting in more detail the difference between local operations with and without two-way classical communication in distinguishing more than three states.

Physical Review A•May 15, 2015•33 citations

Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose

Nengkun Yu, Runyao Duan, Mingsheng Ying

We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).

arXiv:1209.4222•IEEE Transactions on Information Theory•Feb 24, 2014•71 citations
We study the distinguishability of a particular type of maximally entangled states---the ``lattice states''---using an approach of a semidefinite program. With this, we successfully construct all sets of four ququad-ququad orthogonal maximally entangled states that are locally indistinguishable and find some curious sets of six states having an interesting property of distinguishability. Also, some of the problems that arose from Cosentino and Russo [Quantum Inf. Comput. 14, 1098 (2013)] about the positive-partial-transpose distinguishability of lattice maximally entangled states can be answered.
We study the distinguishability of a particular type of maximally entangled states -- the states which are tensor products of Bell states in C4⊗C4\mathbb{C}^4\otimes\mathbb{C}^4C4⊗C4. We first prove that any three orthogonal ququad-ququad maximally entangled states can be distinguished with LOCC. Then we use a new approach of semidefinite program to construct all sets of four ququad-ququad orthogonal maximally entangled states that are PPT-indistinguishable and we find some interesting sets of six states having interesting property of distinguishability. Also, we show that our approach of the optimization problem can make some computational complex problem more tractable.
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.
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.
We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communication. Before our work, it was unknown whether there is a set of d locally indistinguishable d⊗d orthogonal maximally entangled states for some positive integer d. We further show that a 2⊗2 maximally entangled state can be used to locally distinguish this set of states without being consumed, thus demonstrate a novel phenomenon of entanglement discrimination catalysis. Based on this set of states, we construct a new set K consisting of four locally indistinguishable states such that K(⊗m) (with 4(m) members) is locally distinguishable for some m greater than one. As an immediate application, we construct a noisy quantum channel with one sender and two receivers whose local zero-error classical capacity can achieve the full dimension of the input space but only with a multi-shot protocol.
In the $4\ensuremath{\bigotimes}4$ quantum system, four qubit lattice states are found to be either locally indistinguishable or distinguishable by using one-way classical communication only, presenting a curious and counterintuitive case in which two-way classical communication has no advantage. Based on these results, we explicitly construct sets of four, five, and even more maximally entangled states that can be locally distinguished only with the help of two-way classical communication, solving partially the open problem described by Nathanson [Phys. Rev. A 88, 062316 (2013)] and highlighting in more detail the difference between local operations with and without two-way classical communication in distinguishing more than three states.
We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).