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

Locally distinguishing unextendible product bases by using entanglement efficiently

Zhichao Zhang, Xia Wu, Xiangdong Zhang

Published Feb 7, 2020• 26 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.101.022306

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

Efficient discrimination schemes for unextendible product bases with strong quantum nonlocality

Qiqi Feng, Huaqi Zhou, Limin Gao

Entanglement is a central resource in quantum information science, and it is therefore important to design local discrimination protocols that minimize entanglement cost. In this paper, we propose several entanglement-assisted discrimination schemes for the local discrimination of a representative strongly nonlocal unextendible product basis (UPB) in a \(3\otimes 3\otimes 3\) system. By exploiting the structure of the UPB and the properties of maximally entangled resources, we generalize the protocols to a family of strongly nonlocal UPBs in \(d\otimes d\otimes d\) systems. In particular, we show that these UPBs can be perfectly distinguished using two bipartite maximally entangled states, distributed between different pairs of parties, without employing quantum teleportation. We further compare the total supplied and average consumed entanglement under a clearly specified accounting convention. The results demonstrate that avoiding teleportation can reduce the required entanglement in suitable resource-allocation scenarios and clarify the operational role of low-dimensional maximally entangled resources.

quant-pharXiv:2602.13545•Quantum Information Processing•Feb 17, 2026•0 citations

Local distinguishability of orthogonal quantum states with multiple copies of 2 ⊗ 2 maximally entangled states

Zhichao Zhang, Yan-Qi Song, Tingting Song +3 more

For general quantum systems, many sets of locally indistinguishable orthogonal quantum states have been constructed so far. However, it is interesting how much entanglement resources are sufficient and/or necessary to distinguish these states by local operations and classical communication (LOCC). Here we first present a method to locally distinguish a set of orthogonal product states in $5\ensuremath{\bigotimes}5$ by using two copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. Then we generalize the distinguishing method for a class of orthogonal product states in $d\ensuremath{\bigotimes}d$ ($d$ is odd). Furthermore, for a class of nonlocality of orthogonal product states in $d\ensuremath{\bigotimes}d$ ($d\ensuremath{\ge}5$), we prove that these states can be distinguished by LOCC with two copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. Finally, for some multipartite orthogonal product states, we also present a similar method to locally distinguish these states with multiple copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. These results also reveal the phenomenon of less nonlocality with more entanglement.

Physical Review A•Feb 23, 2018•42 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

Strong quantum nonlocality for unextendible product bases in heterogeneous systems

Fei Shi, Mao-Sheng Li, Lin Chen +1 more

Abstract A set of multipartite orthogonal product states is strongly nonlocal if it is locally irreducible in every bipartition, which shows the phenomenon of strong quantum nonlocality without entanglement. It is known that unextendible product bases (UPBs) can show the phenomenon of quantum nonlocality without entanglement. Thus it is interesting to investigate the strong quantum nonlocality for UPBs. Most of the UPBs with the minimum size cannot demonstrate strong quantum nonlocality. In this paper, we construct a series of UPBs with different large sizes in d A ⊗ d B ⊗ d C and d A ⊗ d B ⊗ d C ⊗ d D for d A , d B , d C , d D ⩾ 3, and we also show that these UPBs have strong quantum nonlocality, which answers an open question given by Halder et al (2019 Phys. Rev. Lett. 122 040403) and Yuan et al (2020 Phys. Rev. A 102 042228) for any possible three and four-partite systems. Furthermore, we propose an entanglement-assisted protocol to locally discriminate the UPB in 3 ⊗ 3 ⊗ 4, and it consumes less entanglement resource than the teleportation-based protocol. Our results build the connection between strong quantum nonlocality and UPBs.

arXiv:2201.00085•Journal of Physics A Mathematical and Theoretical•Nov 22, 2021•27 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•89 citations
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⨂55\ensuremath{\bigotimes}55\ensuremath⨂5 by using different entanglement resource. Then, we generalize the distinguishing methods for a class of UPB in d\ensuremath⨂dd\ensuremath{\bigotimes}dd\ensuremath⨂d, where ddd is odd and d\ensuremath⩾3d\ensuremath{\geqslant}3d\ensuremath⩾3. Furthermore, for a class of UPB in d\ensuremath⨂dd\ensuremath{\bigotimes}dd\ensuremath⨂d, where ddd is even and d\ensuremath⩾4d\ensuremath{\geqslant}4d\ensuremath⩾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 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.
Entanglement is a central resource in quantum information science, and it is therefore important to design local discrimination protocols that minimize entanglement cost. In this paper, we propose several entanglement-assisted discrimination schemes for the local discrimination of a representative strongly nonlocal unextendible product basis (UPB) in a 3⊗3⊗33\otimes 3\otimes 33⊗3⊗3 system. By exploiting the structure of the UPB and the properties of maximally entangled resources, we generalize the protocols to a family of strongly nonlocal UPBs in d⊗d⊗dd\otimes d\otimes dd⊗d⊗d systems. In particular, we show that these UPBs can be perfectly distinguished using two bipartite maximally entangled states, distributed between different pairs of parties, without employing quantum teleportation. We further compare the total supplied and average consumed entanglement under a clearly specified accounting convention. The results demonstrate that avoiding teleportation can reduce the required entanglement in suitable resource-allocation scenarios and clarify the operational role of low-dimensional maximally entangled resources.
For general quantum systems, many sets of locally indistinguishable orthogonal quantum states have been constructed so far. However, it is interesting how much entanglement resources are sufficient and/or necessary to distinguish these states by local operations and classical communication (LOCC). Here we first present a method to locally distinguish a set of orthogonal product states in $5\ensuremath{\bigotimes}5$ by using two copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. Then we generalize the distinguishing method for a class of orthogonal product states in $d\ensuremath{\bigotimes}d$ (ddd is odd). Furthermore, for a class of nonlocality of orthogonal product states in $d\ensuremath{\bigotimes}d$ ($d\ensuremath{\ge}5$), we prove that these states can be distinguished by LOCC with two copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. Finally, for some multipartite orthogonal product states, we also present a similar method to locally distinguish these states with multiple copies of $2\ensuremath{\bigotimes}2$ maximally entangled states. These results 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.
Abstract A set of multipartite orthogonal product states is strongly nonlocal if it is locally irreducible in every bipartition, which shows the phenomenon of strong quantum nonlocality without entanglement. It is known that unextendible product bases (UPBs) can show the phenomenon of quantum nonlocality without entanglement. Thus it is interesting to investigate the strong quantum nonlocality for UPBs. Most of the UPBs with the minimum size cannot demonstrate strong quantum nonlocality. In this paper, we construct a series of UPBs with different large sizes in d A ⊗ d B ⊗ d C and d A ⊗ d B ⊗ d C ⊗ d D for d A , d B , d C , d D ⩾ 3, and we also show that these UPBs have strong quantum nonlocality, which answers an open question given by Halder et al (2019 Phys. Rev. Lett. 122 040403) and Yuan et al (2020 Phys. Rev. A 102 042228) for any possible three and four-partite systems. Furthermore, we propose an entanglement-assisted protocol to locally discriminate the UPB in 3 ⊗ 3 ⊗ 4, and it consumes less entanglement resource than the teleportation-based protocol. Our results build the connection between strong quantum nonlocality and UPBs.
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.