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:2004.11777 · Quantum Information Processing

One-way LOCC indistinguishable lattice states via operator structures

David W. Kribs, Comfort Mintah, Michael Nathanson, Rajesh Pereira

Published May 26, 2020• 9 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-02686-6

Related papers

One-way LOCC indistinguishability of maximally entangled states

Zhichao Zhang, Qiaoyan Wen, Fei Gao +2 more

Quantum Information Processing•Nov 23, 2013•31 citations

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

Indistinguishability of pure orthogonal product states by LOCC

Xiaoqian Zhang, Jian Weng, Xiaoqing Tan +1 more

Quantum Information Processing•May 22, 2017•29 citations

Local distinguishability of quantum states in bipartite systems

Xiaoqian Zhang, Guo, Cheng, Weiqi Luo +1 more

In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.

arXiv:1712.08830•Dec 23, 2017•13 citations

Locally indistinguishable generalized Bell states with one-way local operations and classical communication

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

In this paper, we investigate the indistinguishability of generalized Bell states (GBSs) by one-way local operations and classical communication (LOCC). We first introduce two sets, i.e., the difference set and the testing set, and show that the GBSs cannot always be distinguished by one-way LOCC if the testing set is a subset of the difference set of GBSs. Then we give a unified upper bound about indistinguishable GBSs by one-way LOCC. The newly derived bound is smaller than those presented in Zhang et al. [Phys. Rev. A 91, 012329 (2015)] and Wang et al. [Quantum Inf. Process. 15, 1661 (2016).]. More precisely, the minimum number of one-way locally indistinguishable GBSs is not more than $2\ensuremath{\lceil}\sqrt{d}\ensuremath{\rceil}+\ensuremath{\lceil}\frac{\sqrt{d}}{4}\ensuremath{\rceil}+1$.

Physical Review A•Oct 25, 2018•17 citations

Chordal graphs and distinguishability of quantum product states

David W. Kribs, Comfort Mintah, Michael Nathanson +1 more

We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the key graph structure that drives distinguishability in one-way LOCC, and we derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions. We also derive minimality conditions on graph parameters that allow for the determination of indistinguishability of states. We present a number of applications and examples built on these results.

arXiv:2305.10153•Linear Algebra and its Applications•Apr 25, 2024•1 citation
In this paper, we investigate the indistinguishability of generalized Bell states (GBSs) by one-way local operations and classical communication (LOCC). We first introduce two sets, i.e., the difference set and the testing set, and show that the GBSs cannot always be distinguished by one-way LOCC if the testing set is a subset of the difference set of GBSs. Then we give a unified upper bound about indistinguishable GBSs by one-way LOCC. The newly derived bound is smaller than those presented in Zhang et al. [Phys. Rev. A 91, 012329 (2015)] and Wang et al. [Quantum Inf. Process. 15, 1661 (2016).]. More precisely, the minimum number of one-way locally indistinguishable GBSs is not more than $2\ensuremath{\lceil}\sqrt{d}\ensuremath{\rceil}+\ensuremath{\lceil}\frac{\sqrt{d}}{4}\ensuremath{\rceil}+1$.
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the key graph structure that drives distinguishability in one-way LOCC, and we derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions. We also derive minimality conditions on graph parameters that allow for the determination of indistinguishability of states. We present a number of applications and examples built on these results.