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

Advances in Mathematics of Communications

Quantum states associated to mixed graphs and their algebraic characterization

Constanza Riera, Matthew Geoffrey Parker, Pantelimon Stănică

Published Jun 3, 2021• 0 citations
Publisher

Abstract

Graph states are present in quantum information and found applications ranging from quantum network protocols (like secret sharing) to measurement based quantum computing. In this paper, we extend the notion of graph states, which can be regarded as pure quantum graph states, or as homogeneous quadratic Boolean functions associated to simple undirected graphs, to quantum states based on mixed graphs (graphs which allow both directed and undirected edges), obtaining mixed quantum states, which are defined by matrices associated to the measurement of homogeneous quadratic Boolean functions in some (ancillary) variables. In our main result, we describe the extended graph state as the sum of terms of a commutative subgroup of the stabilizer group of the corresponding mixed graph with the edges' directions reversed.

DOI
10.3934/amc.2021015

Related papers

Mixed graph states

Constanza Riera, Ramij Rahaman, Matthew Geoffrey Parker

We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated stabilizer matrix defined by the mixed graph. We can interpret this matrix as a quantum object by making it part of a larger fully commuting matrix, i.e. where we choose the environment appropriately, and this will imply that our quantum object is a mixed state. We prove that, in the same way as (pure) graph states, the density matrix of a parent of mixed graph state can be written as sum of a few Pauli matrices, well defined from the mixed graph. We have proven that the set of matrices that appear in this sum is fully pair-wise commuting, and form a multiplicative group up to global constants, which is always of maximum size. Furthermore, the cardinality of the set depends solely of the miminum possible number of extension columns/rows, and the number of nodes of the mixed graph. We prove a formula for this cardinality. Finally, in the case of purely undirected graphs, this corresponds to the usual pure graph state. Also, we have developed a way of finding maximal commutative group of such Pauli matrices as a linear subspace problem, for any given mixed graph. We also have proven how the structure of maximal commutative groups is independent of the direction of the arrows of the mixed graph, and also of the undirected edges; this allows the simplification of the problem of finding these groups in general to finding them for a much smaller set of graphs.

arXiv:1506.03635•Jun 11, 2015•0 citations

Generalized graph states based on Hadamard matrices

Shawn Xingshan Cui, Nengkun Yu, Bei Zeng

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.

arXiv:1502.07195•Journal of Mathematical Physics•Jul 1, 2015•14 citations

An efficient algebraic representation for graph states for measurement-based quantum computing

Sebastiano Corli, Enrico Prati

Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the abelian group of stabilizer operators. They own topological properties, arising from their graph structure, including the presence of highly connected nodes, called hubs. Starting from hub nodes, we demonstrate how to efficiently express a graph state through the generators of the stabilizer group. We provide examples by expressing the ring and the star topology, for which the number of stabilizers reduces from$n$to$\lceil\frac{n}{2}\rceil$, and from$n$to 1, respectively. We demonstrate that the graph states can be generated by a subgroup of the stabilizer group. Therefore, we provide an algebraic framework to manipulate the graph states with a reduced number of stabilizers.

arXiv:2212.12102•IEEE International Conference on Rebooting Computing (ICRC)•Dec 1, 2022•4 citations

State Transfer on Mixed Graphs

Xingkun Song, Huiqiu Lin

Mixed graphs, which generalize both undirected and directed graphs, provide a natural framework for investigating a broader class of quantum transport phenomena, including perfect state transfer ($\mathrm{PST}$) and multiple state transfer ($\mathrm{MST}$). The Hermitian adjacency matrix, incorporating both symmetric and asymmetric edge structures, establishes a unified spectral framework that reveals quantum phenomena absent in undirected graphs. In this paper, we study $\mathrm{PST}$ and $\mathrm{MST}$ on mixed graphs using the Hermitian adjacency matrix, extending results from undirected graphs and focusing on phenomena such as periodicity, one-way $\mathrm{PST}$, two-way $\mathrm{PST}$, and $\mathrm{MST}$. Additionally, we present novel results that contribute to a deeper understanding of quantum state transfer in mixed graphs.

The Electronic Journal of Combinatorics•Sep 11, 2026•1 citation

Entanglement in Graph States and its Applications

M. Hein, Wolfgang Dür, Jens Eisert +3 more

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a variety of applications in quantum information theory, most prominently as algorithmic resources in the context of the one-way quantum computer, but also in other fields such as quantum error correction and multi-partite quantum communication, as well as in the study of foundational issues such as non-locality and decoherence. In this review, we give a tutorial introduction into the theory of graph states. We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. The focus of this review is on their entanglement properties. These include aspects of non-locality, bi-partite and multi-partite entanglement and its classification in terms of the Schmidt measure, the distillability properties of mixed entangled states close to a pure graph state, as well as the robustness of their entanglement under decoherence. We review some of the known applications of graph states, as well as proposals for their experimental implementation.

arXiv:quant-ph/0602096•Feb 11, 2006•745 citations

Condition for zero and nonzero discord in graph Laplacian quantum states

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.

arXiv:1705.00808•International Journal of Quantum Information•Mar 1, 2019•7 citations
Graph states are present in quantum information and found applications ranging from quantum network protocols (like secret sharing) to measurement based quantum computing. In this paper, we extend the notion of graph states, which can be regarded as pure quantum graph states, or as homogeneous quadratic Boolean functions associated to simple undirected graphs, to quantum states based on mixed graphs (graphs which allow both directed and undirected edges), obtaining mixed quantum states, which are defined by matrices associated to the measurement of homogeneous quadratic Boolean functions in some (ancillary) variables. In our main result, we describe the extended graph state as the sum of terms of a commutative subgroup of the stabilizer group of the corresponding mixed graph with the edges' directions reversed.
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated stabilizer matrix defined by the mixed graph. We can interpret this matrix as a quantum object by making it part of a larger fully commuting matrix, i.e. where we choose the environment appropriately, and this will imply that our quantum object is a mixed state. We prove that, in the same way as (pure) graph states, the density matrix of a parent of mixed graph state can be written as sum of a few Pauli matrices, well defined from the mixed graph. We have proven that the set of matrices that appear in this sum is fully pair-wise commuting, and form a multiplicative group up to global constants, which is always of maximum size. Furthermore, the cardinality of the set depends solely of the miminum possible number of extension columns/rows, and the number of nodes of the mixed graph. We prove a formula for this cardinality. Finally, in the case of purely undirected graphs, this corresponds to the usual pure graph state. Also, we have developed a way of finding maximal commutative group of such Pauli matrices as a linear subspace problem, for any given mixed graph. We also have proven how the structure of maximal commutative groups is independent of the direction of the arrows of the mixed graph, and also of the undirected edges; this allows the simplification of the problem of finding these groups in general to finding them for a much smaller set of graphs.
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.
Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the abelian group of stabilizer operators. They own topological properties, arising from their graph structure, including the presence of highly connected nodes, called hubs. Starting from hub nodes, we demonstrate how to efficiently express a graph state through the generators of the stabilizer group. We provide examples by expressing the ring and the star topology, for which the number of stabilizers reduces fromnnnto⌈n2⌉\lceil\frac{n}{2}\rceil⌈2n​⌉, and fromnnnto 1, respectively. We demonstrate that the graph states can be generated by a subgroup of the stabilizer group. Therefore, we provide an algebraic framework to manipulate the graph states with a reduced number of stabilizers.
Mixed graphs, which generalize both undirected and directed graphs, provide a natural framework for investigating a broader class of quantum transport phenomena, including perfect state transfer (PST\mathrm{PST}PST) and multiple state transfer (MST\mathrm{MST}MST). The Hermitian adjacency matrix, incorporating both symmetric and asymmetric edge structures, establishes a unified spectral framework that reveals quantum phenomena absent in undirected graphs. In this paper, we study PST\mathrm{PST}PST and MST\mathrm{MST}MST on mixed graphs using the Hermitian adjacency matrix, extending results from undirected graphs and focusing on phenomena such as periodicity, one-way PST\mathrm{PST}PST, two-way PST\mathrm{PST}PST, and MST\mathrm{MST}MST. Additionally, we present novel results that contribute to a deeper understanding of quantum state transfer in mixed graphs.
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a variety of applications in quantum information theory, most prominently as algorithmic resources in the context of the one-way quantum computer, but also in other fields such as quantum error correction and multi-partite quantum communication, as well as in the study of foundational issues such as non-locality and decoherence. In this review, we give a tutorial introduction into the theory of graph states. We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. The focus of this review is on their entanglement properties. These include aspects of non-locality, bi-partite and multi-partite entanglement and its classification in terms of the Schmidt measure, the distillability properties of mixed entangled states close to a pure graph state, as well as the robustness of their entanglement under decoherence. We review some of the known applications of graph states, as well as proposals for their experimental implementation.
This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that every combinatorial graph corresponds to quantum states whose characteristics are reflected in the structure of the underlined graph. A number of combinatorial relations between quantum discord and simple graphs were studied. To extend the scope of these studies, we need to generalize the earlier concepts applicable to simple graphs to weighted graphs, corresponding to a diverse class of quantum states. To this effect, we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and call them graph Laplacian quantum states. We find the graph theoretic conditions for zero and nonzero quantum discord for these states. We apply these results on some important pure two qubit states, as well as a number of mixed quantum states, such as the Werner, Isotropic, and [Formula: see text]-states. We also consider graph Laplacian states corresponding to simple graphs as a special case.