2018/05/23 by Jiangtao Yuan, Caihong Wang, Yuan, Jiang-Tao +5
Computer Science · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1805.09211
openalex publication_date 2018/05/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we mainly consider the local indistinguishability of the set of mutually orthogonal bipartite generalized Bell states (GBSs). We construct small sets of GBSs with cardinality smaller than d which are not distinguished by one-way local operations and classical communication (1-LOCC) in d⊗ d. The constructions, based on linear system and Vandermonde matrix, is simple and effective. The results give a unified upper bound for the minimum cardinality of 1-LOCC indistinguishable set of GBSs, and greatly improve previous results in [Zhang et al., Phys. Rev. A 91, 012329 (2015); Wang et al., Quantum Inf. Process. 15, 1661 (2016)]. The case that d is odd of the results also shows that the set of 4 GBSs in 5⊗ 5 in [Fan, Phys. Rev. A 75, 014305 (2007)] is indeed a 1-LOCC indistinguishable set which can not be distinguished by Fan's method.