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:2110.07657 · Applied Sciences

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

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

Published Oct 14, 2021• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.3390/app11209542

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

Graph Structures for Local Distinguishability of Quantum Product States

Sooyeong Kim, David W. Kribs, Michael Nathanson +2 more

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.

quant-pharXiv:2606.26558•Jun 26, 2026•0 citations

Operator Theory and Conditions for Quantum Local Operations and Classical Communication

Comfort Mintah

We study the finite dimensional $C^{*}$-algebras and their representation theory. The physical description of quantum local operations and classical communication (LOCC) and its schematics are presented. Focusing on the mathematical description of one-way LOCC, we give detailed analysis of recently derived operator relations in quantum information theory. We also show how functional analytic tools such as operatorx systems, operator algebras, and Hilbert $C^{*}$-modules all naturally emerge in this setting. We make use of these structures to derive some key results in one-way LOCC. Perfect distinguishability of one-way LOCC versus arbitrary quantum operations is analyzed. It turns out that they are equivalent for several families of operators that appear jointly in matrix and operator theory and quantum information theory. The main results of this work are contained in the paper \\citep{comfort}.

•Jan 16, 2017•0 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

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

Quantum error correction and one-way LOCC state distinguishability

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

We explore the intersection of studies in quantum error correction and quantum local operations and classical communication (LOCC). We consider one-way LOCC measurement protocols as quantum channels and investigate their error correction properties, emphasizing an operator theory approach to the subject, and we obtain new applications to one-way LOCC state distinguishability as well as new derivations of some established results. We also derive conditions on when states that arise through the stabilizer formalism for quantum error correction are distinguishable under one-way LOCC.

arXiv:1809.01203•Journal of Mathematical Physics•Mar 1, 2019•7 citations
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.
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 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.
We study the finite dimensional C∗C^{*}C∗-algebras and their representation theory. The physical description of quantum local operations and classical communication (LOCC) and its schematics are presented. Focusing on the mathematical description of one-way LOCC, we give detailed analysis of recently derived operator relations in quantum information theory. We also show how functional analytic tools such as operatorx systems, operator algebras, and Hilbert C∗C^{*}C∗-modules all naturally emerge in this setting. We make use of these structures to derive some key results in one-way LOCC. Perfect distinguishability of one-way LOCC versus arbitrary quantum operations is analyzed. It turns out that they are equivalent for several families of operators that appear jointly in matrix and operator theory and quantum information theory. The main results of this work are contained in the paper \\citep{comfort}.
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 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 explore the intersection of studies in quantum error correction and quantum local operations and classical communication (LOCC). We consider one-way LOCC measurement protocols as quantum channels and investigate their error correction properties, emphasizing an operator theory approach to the subject, and we obtain new applications to one-way LOCC state distinguishability as well as new derivations of some established results. We also derive conditions on when states that arise through the stabilizer formalism for quantum error correction are distinguishable under one-way LOCC.