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

Understanding entanglement as resource: Locally distinguishing unextendible product bases

Scott M. Cohen

Published Jan 7, 2008• 94 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.77.012304

Related papers

Entanglement as a resource to distinguish orthogonal product states

Zhichao Zhang, Fei Gao, Tian-Qing Cao +2 more

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.

Scientific Reports•Jul 26, 2016•36 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•26 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

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•102 citations

Unextendible product operator basis

Mengyao Hu, Lin Chen, Fei Shi +2 more

Quantum nonlocality is associated with the local indistinguishability of orthogonal states. Unextendible product basis (UPB), a widely used tool in quantum information, exhibits nonlocality, which is the powerful resource for quantum information processing. In this work, we extend the definitions of nonlocality and genuine nonlocality from states to operators. We also extend UPB to the notions of unextendible product operator basis, unextendible product unitary operator basis (UPUOB), and strongly UPUOB. We construct their examples and show the nonlocality of some strongly UPUOBs under local operations and classical communications. We study the phenomenon of these operators acting on quantum states. As an application, we distinguish the two-dimensional strongly UPUOB, which only consumes three ebits of entanglement. Our results imply that such UPUOBs exhibit nonlocality as UPBs, and the distinguishability of them requires entanglement resources.

arXiv:2109.13537•Journal of Mathematical Physics•Dec 1, 2022•3 citations

Graph-theoretic characterization of unextendible product bases

Fei Shi, Ge Bai, Xiande Zhang +2 more

Unextendible product bases (UPBs) play a key role in the study of quantum entanglement and nonlocality. Here we provide an equivalent characterization of UPBs in graph-theoretic terms. Different from previous graph-theoretic investigations of UPBs, which focused mostly on the orthogonality relations between different product states, our characterization includes a graph-theoretic reformulation of the unextendibility condition. Building on this characterization, we develop a constructive method for building UPBs in low dimensions and shed light on the open question of whether there exist genuinely unextendible product bases (GUPBs), that is, multipartite product bases that are unextendible with respect to every possible bipartition. We derive a lower bound on the size of any candidate GUPB, significantly improving over the state of the art. Moreover, we show that every minimal GUPB saturating our bound must be associated to regular graphs and discuss a possible path towards the construction of a minimal GUPB in a tripartite system of minimal local dimension. Finally, we apply our characterization to the problem of distinguishing UPB states under local operations and classical communication, deriving a necessary condition for reliable discrimination in the asymptotic limit.

Physical Review Research•Aug 31, 2023•4 citations
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 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.
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 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.
Quantum nonlocality is associated with the local indistinguishability of orthogonal states. Unextendible product basis (UPB), a widely used tool in quantum information, exhibits nonlocality, which is the powerful resource for quantum information processing. In this work, we extend the definitions of nonlocality and genuine nonlocality from states to operators. We also extend UPB to the notions of unextendible product operator basis, unextendible product unitary operator basis (UPUOB), and strongly UPUOB. We construct their examples and show the nonlocality of some strongly UPUOBs under local operations and classical communications. We study the phenomenon of these operators acting on quantum states. As an application, we distinguish the two-dimensional strongly UPUOB, which only consumes three ebits of entanglement. Our results imply that such UPUOBs exhibit nonlocality as UPBs, and the distinguishability of them requires entanglement resources.
Unextendible product bases (UPBs) play a key role in the study of quantum entanglement and nonlocality. Here we provide an equivalent characterization of UPBs in graph-theoretic terms. Different from previous graph-theoretic investigations of UPBs, which focused mostly on the orthogonality relations between different product states, our characterization includes a graph-theoretic reformulation of the unextendibility condition. Building on this characterization, we develop a constructive method for building UPBs in low dimensions and shed light on the open question of whether there exist genuinely unextendible product bases (GUPBs), that is, multipartite product bases that are unextendible with respect to every possible bipartition. We derive a lower bound on the size of any candidate GUPB, significantly improving over the state of the art. Moreover, we show that every minimal GUPB saturating our bound must be associated to regular graphs and discuss a possible path towards the construction of a minimal GUPB in a tripartite system of minimal local dimension. Finally, we apply our characterization to the problem of distinguishing UPB states under local operations and classical communication, deriving a necessary condition for reliable discrimination in the asymptotic limit.