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:2606.26558

Graph Structures for Local Distinguishability of Quantum Product States

Sooyeong Kim, David W. Kribs, Michael Nathanson, Rajesh Pereira, Sarah Plosker

quant-phmath.QASubmitted Jun 25, 2026• Announced Jun 26, 2026• 0 citations
arXivHTMLPDF

Abstract

We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.

Comments
16 pages, 6 figures

Related papers

Vector representations of graphs and distinguishing quantum product states with one-way LOCC

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

Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic approach, based on the theory of vector representations of graphs, to the core problem of distinguishing product states with one-way LOCC. We establish a number of results that show how distinguishing such states can be framed in terms of properties of the underlying graphs associated with a set of vector product states. We also present a number of illustrative examples.

arXiv:1912.10483•Linear Algebra and its Applications•May 19, 2020•4 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.

Linear Algebra and its Applications•Apr 25, 2024•0 citations

Operator and Graph Theoretic Techniques for Distinguishing Quantum States via One-Way LOCC

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

We bring together in one place some of the main results and applications from our recent work on quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time to investigate the topic of distinguishability of sets of quantum states in quantum communication, with particular reference to the framework of one-way local quantum operations and classical communication (LOCC). We also derive a new graph-theoretic description of distinguishability in the case of a single-qubit sender.

arXiv:2110.07657•Applied Sciences•Oct 14, 2021•1 citation

Local distinguishability of five quadripartite orthogonal product states

Guang-Bao Xu, Jie Zhan, Yu-Guang Yang +1 more

The local distinguishability of five bipartite and tripartite orthogonal product states (OPSs) has been effectively resolved, while that of five quadripartite OPSs has not yet been effectively addressed. In this paper, we give the local distinguishability of five quadripartite OPSs, where any two of these five states are orthogonal on exactly one subsystem. Based on the vectors of the numbers of pairwise orthogonality relations, we classify different sets of five quadripartite OPSs into nine categories, which correspond to 371 distinct orthogonality graphs. We show that the sets of five quadripartite OPSs corresponding to 355 of the 371 cases can be perfectly distinguished by local operations and classical communication (LOCC), whereas the sets of five quadripartite OPSs for the remaining 16 cases cannot exactly distinguished by LOCC. Our results enrich the theory of nonlocality for sets of OPSs.

quant-pharXiv:2610.29622•Oct 22, 2026•0 citations

Local distinguishability of five orthogonal product states on bipartite and tripartite quantum systems

Guang-Bao Xu, Zi-Yan Hao, Hua-Kun Wang +2 more

Local distinguishability of orthogonal quantum states can effectively reduce the consumption of quantum resources and lower economic costs in quantum protocols. Although numerous achievements have been made regarding local distinguishability of orthogonal quantum states, some fundamental issues have not been effectively addressed. For example, the local distinguishability of five orthogonal product states (OPSs) is still unknown up to now. In this paper, we give the properties of local distinguishability of five OPSs on bipartite and tripartite quantum systems. Firstly, to characterize the structure of a set of bipartite OPSs, we propose the concept of the vector of orthogonal relations for a set of bipartite OPSs. Secondly, we classify the structures of five bipartite OPSs into six categories by this concept and prove that five of these six categories can be perfectly distinguished by local operations and classical communication (LOCC). Thirdly we show that the local distinguishability of each case of the sixth category singly. On the other hand, we first divide the structures of five tripartite OPSs into eight categories by the vectors of orthogonal relations of five tripartite OPSs. Then we give the local distinguishability of each category. Our work enriches the research results of quantum nonlocality and will provide a clear understanding of the local distinguishability of five OPSs.

quant-pharXiv:2512.00484•Physical Review A•Dec 2, 2025•0 citations

Chordal Graphs and Distinguishability of Quantum Product States

Comfort Mintah, David W. Kribs, 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•May 17, 2023•0 citations
We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.
Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic approach, based on the theory of vector representations of graphs, to the core problem of distinguishing product states with one-way LOCC. We establish a number of results that show how distinguishing such states can be framed in terms of properties of the underlying graphs associated with a set of vector product states. We also present a number of illustrative examples.
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.
We bring together in one place some of the main results and applications from our recent work on quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time to investigate the topic of distinguishability of sets of quantum states in quantum communication, with particular reference to the framework of one-way local quantum operations and classical communication (LOCC). We also derive a new graph-theoretic description of distinguishability in the case of a single-qubit sender.
The local distinguishability of five bipartite and tripartite orthogonal product states (OPSs) has been effectively resolved, while that of five quadripartite OPSs has not yet been effectively addressed. In this paper, we give the local distinguishability of five quadripartite OPSs, where any two of these five states are orthogonal on exactly one subsystem. Based on the vectors of the numbers of pairwise orthogonality relations, we classify different sets of five quadripartite OPSs into nine categories, which correspond to 371 distinct orthogonality graphs. We show that the sets of five quadripartite OPSs corresponding to 355 of the 371 cases can be perfectly distinguished by local operations and classical communication (LOCC), whereas the sets of five quadripartite OPSs for the remaining 16 cases cannot exactly distinguished by LOCC. Our results enrich the theory of nonlocality for sets of OPSs.
Local distinguishability of orthogonal quantum states can effectively reduce the consumption of quantum resources and lower economic costs in quantum protocols. Although numerous achievements have been made regarding local distinguishability of orthogonal quantum states, some fundamental issues have not been effectively addressed. For example, the local distinguishability of five orthogonal product states (OPSs) is still unknown up to now. In this paper, we give the properties of local distinguishability of five OPSs on bipartite and tripartite quantum systems. Firstly, to characterize the structure of a set of bipartite OPSs, we propose the concept of the vector of orthogonal relations for a set of bipartite OPSs. Secondly, we classify the structures of five bipartite OPSs into six categories by this concept and prove that five of these six categories can be perfectly distinguished by local operations and classical communication (LOCC). Thirdly we show that the local distinguishability of each case of the sixth category singly. On the other hand, we first divide the structures of five tripartite OPSs into eight categories by the vectors of orthogonal relations of five tripartite OPSs. Then we give the local distinguishability of each category. Our work enriches the research results of quantum nonlocality and will provide a clear understanding of the local distinguishability of five OPSs.
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.