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

Scientific Reports

Entanglement as a resource to distinguish orthogonal product states

Zhichao Zhang, Fei Gao, Tian-Qing Cao, Su‐Juan Qin, Qiaoyan Wen

Published Jul 26, 2016• 36 citations
Publisher

Abstract

It is known that there are many sets of orthogonal product states which cannot be distinguished perfectly by local operations and classical communication (LOCC). However, these discussions have left the following open question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In m ⊗ n, certain classes of unextendible product bases (UPB) which can be distinguished perfectly using entanglement as a resource, had been presented in 2008. In this paper, we present protocols which use entanglement more efficiently than teleportation to distinguish some classes of orthogonal product states in m ⊗ n, which are not UPB. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.

DOI
10.1038/srep30493

Related papers

Understanding entanglement as resource: Locally distinguishing unextendible product bases

Scott M. Cohen

It is known that the states in an unextendible product basis (UPB) cannot be distinguished perfectly when the parties are restricted to local operations and classical communication (LOCC). Previous discussions of such bases have left open the following question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, I present protocols which use entanglement more efficiently than teleportation to distinguish certain classes of UPB's. The ideas underlying my approach to this problem offer rather general insight into why entanglement is useful for such tasks.

arXiv:0708.2396•Physical Review A•Jan 7, 2008•96 citations

Locally distinguish orthogonal quantum states with entanglement resources

Zhichao Zhang

It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.

IEEE International Conference on Signal, Information and Data Processing (ICSIDP)•Dec 1, 2019•0 citations

Locally distinguishing unextendible product bases by using entanglement efficiently

Zhichao Zhang, Xia Wu, Xiangdong Zhang

Any set of states which cannot be perfectly distinguished by local operations and classical communication (LOCC) alone can always be locally distinguished using quantum teleportation with a maximally entangled state as resource. However, in quantum information theory, entanglement is a very valuable resource, so it leaves the following problem: How to accomplish this task more efficiently than teleportation, that is, design the local discrimination protocol using less entanglement. In this paper, we first present two protocols to locally distinguish a particular unextendible product bases (UPB) in $5\ensuremath{\bigotimes}5$ by using different entanglement resource. Then, we generalize the distinguishing methods for a class of UPB in $d\ensuremath{\bigotimes}d$, where $d$ is odd and $d\ensuremath{\geqslant}3$. Furthermore, for a class of UPB in $d\ensuremath{\bigotimes}d$, where $d$ is even and $d\ensuremath{\geqslant}4$, we prove that these states can also be distinguished by LOCC with multiple copies of low-dimensional entanglement resource. These results offer rather general insight into how to use entanglement resource more efficiently and also reveal the phenomenon of less nonlocality with more entanglement.

arXiv:1906.12109•Physical Review A•Feb 7, 2020•28 citations

Several nonlocal sets of multipartite pure orthogonal product states

Saronath Halder

It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bases with the property that if such a basis is given then no state can be eliminated from that basis by performing orthogonality-preserving measurements. On the other hand, an uncompletable set of the present kind contains several Shifts unextendible product bases (UPBs) that belong to qubit subspaces. Identifying these subspace UPBs, it is possible to obtain a class of high-dimensional multipartite bound entangled states. Finally, it is shown that a two-qubit maximally entangled Bell state shared between any two parties is sufficient as a resource to distinguish the states of any completable set (of the above kind) perfectly by LOCC. This constitutes an example where the amount of entanglement, sufficient to accomplish the aforesaid task, depends neither on the dimension of the individual subsystems nor on the number of parties.

arXiv:1603.08438•Physical Review A•Aug 3, 2018•95 citations

Distinguishability of complete and unextendible product bases

S. De Rinaldis

It is not always possible to distinguish multipartite orthogonal states if only local operations and classical communication (LOCC) are allowed. We prove that we cannot distinguish the states of an unextendible product basis by LOCC even with infinite resources (infinite-dimensional ancillas, infinite number of operations). Moreover we give a necessary and sufficient condition for the LOCC distinguishability of a complete product basis.

arXiv:quant-ph/0304027•Physical Review A•Aug 1, 2004•104 citations

Local distinguishability of generalized Bell states with one ebit of entanglement

Ying‐Hui Yang, Jiangtao Yuan, Caihong Wang +1 more

Abstract It is an interesting topic how much entanglement resources are necessary to distinguish locally indistinguishable orthogonal quantum states by local operations and classical communication (LOCC). Using only one ebit of entanglement some locally indistinguishable orthogonal product bases can be distinguished by LOCC [2019 Phys. Rev. A 99 012343]. However, it is still an open question whether one ebit of entanglement is sufficient for distinguishing a locally indistinguishable set of orthogonal maximally entangled states. We focus on the generalized Bell states (GBSs), and firstly find that any four GBSs in a 4 ⊗ 4 quantum system are always distinguished by one-way LOCC using one ebit of entanglement. Then we consider a general case, i.e., d ⊗ d quantum system ( d is even), and show that the set L of any GBSs can be distinguished by one-way LOCC using one ebit of entanglement if S A \ S L is nonempty, where S A is the admissible solutions set of L and S L is the genuinely nonadmissible solutions set of L . This criterion is very simple and convenient since only some congruence equations are calculated. Finally, we find a curious and counterintuitive case, i.e., in a 3 ⊗ 3 quantum system there exist four GBSs which cannot be distinguished by one-way LOCC using one ebit of entanglement, although the dimension of the subsystem is less than four. These results can help us better understand the role of entanglement as a resource in local state discrimination problems.

Journal of Physics A Mathematical and Theoretical•Aug 3, 2020•3 citations
It is known that there are many sets of orthogonal product states which cannot be distinguished perfectly by local operations and classical communication (LOCC). However, these discussions have left the following open question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In m ⊗ n, certain classes of unextendible product bases (UPB) which can be distinguished perfectly using entanglement as a resource, had been presented in 2008. In this paper, we present protocols which use entanglement more efficiently than teleportation to distinguish some classes of orthogonal product states in m ⊗ n, which are not UPB. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.
It is known that the states in an unextendible product basis (UPB) cannot be distinguished perfectly when the parties are restricted to local operations and classical communication (LOCC). Previous discussions of such bases have left open the following question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, I present protocols which use entanglement more efficiently than teleportation to distinguish certain classes of UPB's. The ideas underlying my approach to this problem offer rather general insight into why entanglement is useful for such tasks.
It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.
Any set of states which cannot be perfectly distinguished by local operations and classical communication (LOCC) alone can always be locally distinguished using quantum teleportation with a maximally entangled state as resource. However, in quantum information theory, entanglement is a very valuable resource, so it leaves the following problem: How to accomplish this task more efficiently than teleportation, that is, design the local discrimination protocol using less entanglement. In this paper, we first present two protocols to locally distinguish a particular unextendible product bases (UPB) in $5\ensuremath{\bigotimes}5$ by using different entanglement resource. Then, we generalize the distinguishing methods for a class of UPB in $d\ensuremath{\bigotimes}d$, where ddd is odd and $d\ensuremath{\geqslant}3$. Furthermore, for a class of UPB in $d\ensuremath{\bigotimes}d$, where ddd is even and $d\ensuremath{\geqslant}4$, we prove that these states can also be distinguished by LOCC with multiple copies of low-dimensional entanglement resource. These results offer rather general insight into how to use entanglement resource more efficiently and also reveal the phenomenon of less nonlocality with more entanglement.
It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bases with the property that if such a basis is given then no state can be eliminated from that basis by performing orthogonality-preserving measurements. On the other hand, an uncompletable set of the present kind contains several Shifts unextendible product bases (UPBs) that belong to qubit subspaces. Identifying these subspace UPBs, it is possible to obtain a class of high-dimensional multipartite bound entangled states. Finally, it is shown that a two-qubit maximally entangled Bell state shared between any two parties is sufficient as a resource to distinguish the states of any completable set (of the above kind) perfectly by LOCC. This constitutes an example where the amount of entanglement, sufficient to accomplish the aforesaid task, depends neither on the dimension of the individual subsystems nor on the number of parties.
Abstract It is an interesting topic how much entanglement resources are necessary to distinguish locally indistinguishable orthogonal quantum states by local operations and classical communication (LOCC). Using only one ebit of entanglement some locally indistinguishable orthogonal product bases can be distinguished by LOCC [2019 Phys. Rev. A 99 012343]. However, it is still an open question whether one ebit of entanglement is sufficient for distinguishing a locally indistinguishable set of orthogonal maximally entangled states. We focus on the generalized Bell states (GBSs), and firstly find that any four GBSs in a 4 ⊗ 4 quantum system are always distinguished by one-way LOCC using one ebit of entanglement. Then we consider a general case, i.e., d ⊗ d quantum system ( d is even), and show that the set L of any GBSs can be distinguished by one-way LOCC using one ebit of entanglement if S A \ S L is nonempty, where S A is the admissible solutions set of L and S L is the genuinely nonadmissible solutions set of L . This criterion is very simple and convenient since only some congruence equations are calculated. Finally, we find a curious and counterintuitive case, i.e., in a 3 ⊗ 3 quantum system there exist four GBSs which cannot be distinguished by one-way LOCC using one ebit of entanglement, although the dimension of the subsystem is less than four. These results can help us better understand the role of entanglement as a resource in local state discrimination problems.