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:2305.10153 · Linear Algebra and its Applications

Chordal graphs and distinguishability of quantum product states

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

Published Apr 25, 2024• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1016/j.laa.2024.04.021

Related papers

Operator and Graph-Theoretic Techniques for Distinguishing Quantum States in the Local Operations and Classical Communication Framework

Comfort Mintah

The quantum communication framework called quantum local operations and classical communication (LOCC) plays a fundamental role in near-term efforts to develop hybrid classical and quantum technologies. Recent advances in the subject include expanded investigations of the mathematical foundations of LOCC.We begin this thesis with an introduction to quantum information theory and the structure theory of finite-dimensional $C^{*}$-algebras to help build the mathematical framework for quantum LOCC. We focus on an important scheme of LOCC called one-way LOCC, where classical communication is in a predetermined direction, and we consider its mathematical description. We apply algebraic techniques to one-way LOCC, such as the existence of a separating vector for certain operator algebras. We explore the intersection between quantum error correction and quantum one-way LOCC. We consider the protocol of one-way LOCC measurement as a quantum channel and derive new methods to distinguish sets of states via one-way LOCC. We establish conditions for one-way LOCC state distinguishability for the set of maximally entangled states that arise from the stabilizer formalism for quantum error correction. We apply the results from quantum error correction and from one-way LOCC to build small sets of states that are indistinguishable under one-way LOCC. We extend these constructions to the generalized Pauli states and compare our results with other recent works. We next introduce a graph-theoretic approach to distinguish sets of product states via one-way LOCC. We see that one-way LOCC state distinguishability is equivalent to the existence of an edge graph clique cover of the graph with nice properties. We establish a number of results for which a set of states can be distinguished with one-way LOCC using the properties of the underlying graphs associated with the set of states. We present some illustrative examples.

•Jun 1, 2021•0 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•Linear Algebra and its Applications•Jun 26, 2026•0 citations

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•5 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•2 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

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
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.
The quantum communication framework called quantum local operations and classical communication (LOCC) plays a fundamental role in near-term efforts to develop hybrid classical and quantum technologies. Recent advances in the subject include expanded investigations of the mathematical foundations of LOCC.We begin this thesis with an introduction to quantum information theory and the structure theory of finite-dimensional C∗C^{*}C∗-algebras to help build the mathematical framework for quantum LOCC. We focus on an important scheme of LOCC called one-way LOCC, where classical communication is in a predetermined direction, and we consider its mathematical description. We apply algebraic techniques to one-way LOCC, such as the existence of a separating vector for certain operator algebras. We explore the intersection between quantum error correction and quantum one-way LOCC. We consider the protocol of one-way LOCC measurement as a quantum channel and derive new methods to distinguish sets of states via one-way LOCC. We establish conditions for one-way LOCC state distinguishability for the set of maximally entangled states that arise from the stabilizer formalism for quantum error correction. We apply the results from quantum error correction and from one-way LOCC to build small sets of states that are indistinguishable under one-way LOCC. We extend these constructions to the generalized Pauli states and compare our results with other recent works. We next introduce a graph-theoretic approach to distinguish sets of product states via one-way LOCC. We see that one-way LOCC state distinguishability is equivalent to the existence of an edge graph clique cover of the graph with nice properties. We establish a number of results for which a set of states can be distinguished with one-way LOCC using the properties of the underlying graphs associated with the set of states. We present some 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.
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 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.
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}.