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

Quantum Information Processing

One-way LOCC indistinguishability of maximally entangled states

Zhichao Zhang, Qiaoyan Wen, Fei Gao, Guojing Tian, Tian-Qing Cao

Published Nov 23, 2013• 32 citations
Publisher
DOI
10.1007/s11128-013-0691-9

Related papers

On small set of one-way LOCC indistinguishability of maximally entangled states

Yan-Ling Wang, Mao-Sheng Li, Zhu‐Jun Zheng +1 more

arXiv:1501.06100•Quantum Information Processing•Jan 25, 2016•21 citations

Locally distinguishable maximally entangled states by two-way LOCC

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

Quantum Information Processing•Jan 1, 2021•2 citations

Constructions of one-way LOCC indistinguishable sets of generalized Bell states

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

Quantum Information Processing•Mar 29, 2019•5 citations

Distinguishing maximally entangled states by one-way local operations and classical communication

Zhichao Zhang, Keqin Feng, Fei Gao +1 more

In this paper, we mainly study the local indistinguishability of mutually orthogonal bipartite maximally entangled states. We construct sets of fewer than $d$ orthogonal maximally entangled states which are not distinguished by one-way local operations and classical communication (LOCC) in the Hilbert space of $d\ensuremath{\bigotimes}d$. The proof, based on the Fourier transform of an additive group, is very simple but quite effective. Simultaneously, our results give a general unified upper bound for the minimum number of one-way LOCC indistinguishable maximally entangled states. This improves previous results which only showed sets of $N\ensuremath{\ge}d\ensuremath{-}2$ such states. Finally, our results also show that previous conjectures in Zhang et al. [Z.-C. Zhang, Q.-Y. Wen, F. Gao, G.-J. Tian, and T.-Q. Cao, Quant. Info. Proc. 13, 795 (2014)] are indeed correct.

Physical Review A•Jan 21, 2015•26 citations

Constructions of locally distinguishable sets of maximally entangled states which require two-way LOCC

Jiangtao Yuan, Ying‐Hui Yang, Caihong Wang

Abstract Most of known locally distinguishable sets of maximally entangled states (MESs) can be perfectly distinguished with one-way local operations and classical communication (1-LOCC), and there are not many known locally distinguishable sets which require two-way LOCC (2-LOCC). Recently some such sets of MESs have been built, that is, they can be locally distinguished only with 2-LOCC. In this work, we show that there exist a lot of locally distinguishable MESs which require 2-LOCC (denote such sets by 2-LOCC sets). Firstly generalized Bell states are employed to construct lots of 1-LOCC indistinguishable sets of MESs in the quantum systems C a + ( a + 1 ) r ⊗ C a + ( a + 1 ) r and C a + ( a + 2 ) r ⊗ C a + ( a + 2 ) r . Then we build a lot of 2-LOCC sets by using Weyl commutation relation and two constructive methods. Especially, it is shown that there are at least 8 and 105 2-LOCC sets in quantum systems C 10 ⊗ C 10 and C 19 ⊗ C 19 respectively.

Journal of Physics A Mathematical and Theoretical•Oct 23, 2020•10 citations

Universal maximally entangled states

M. Revzen

Quantum Studies Mathematics and Foundations•Sep 23, 2014•2 citations
In this paper, we mainly study the local indistinguishability of mutually orthogonal bipartite maximally entangled states. We construct sets of fewer than ddd orthogonal maximally entangled states which are not distinguished by one-way local operations and classical communication (LOCC) in the Hilbert space of $d\ensuremath{\bigotimes}d$. The proof, based on the Fourier transform of an additive group, is very simple but quite effective. Simultaneously, our results give a general unified upper bound for the minimum number of one-way LOCC indistinguishable maximally entangled states. This improves previous results which only showed sets of $N\ensuremath{\ge}d\ensuremath{-}2$ such states. Finally, our results also show that previous conjectures in Zhang et al. [Z.-C. Zhang, Q.-Y. Wen, F. Gao, G.-J. Tian, and T.-Q. Cao, Quant. Info. Proc. 13, 795 (2014)] are indeed correct.
Abstract Most of known locally distinguishable sets of maximally entangled states (MESs) can be perfectly distinguished with one-way local operations and classical communication (1-LOCC), and there are not many known locally distinguishable sets which require two-way LOCC (2-LOCC). Recently some such sets of MESs have been built, that is, they can be locally distinguished only with 2-LOCC. In this work, we show that there exist a lot of locally distinguishable MESs which require 2-LOCC (denote such sets by 2-LOCC sets). Firstly generalized Bell states are employed to construct lots of 1-LOCC indistinguishable sets of MESs in the quantum systems C a + ( a + 1 ) r ⊗ C a + ( a + 1 ) r and C a + ( a + 2 ) r ⊗ C a + ( a + 2 ) r . Then we build a lot of 2-LOCC sets by using Weyl commutation relation and two constructive methods. Especially, it is shown that there are at least 8 and 105 2-LOCC sets in quantum systems C 10 ⊗ C 10 and C 19 ⊗ C 19 respectively.