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

Encoding matroids into quantum states

Nathan Ferreira, Alison A. Silva, Giuliano G. La Guardia, Fabiano M. Andrade

quant-phmath-phmath.COSubmitted Jul 2, 2026• Announced Jul 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Efficient representations of multipartite quantum states play a fundamental role in quantum information theory, providing both conceptual insight and practical tools for characterizing entanglement. Motivated by the axiomatic framework for graph states [Phys. Rev. A 85, 062313 (2012)] and its subsequent extension to hypergraph states [Phys. Rev. A 87, 022311 (2013)], we introduce an axiomatic construction of \emph{matroid states}, a new family of multipartite quantum states associated with matroids. Our constructions are based on a set of axioms analogous to those that define graph and hypergraph states, yielding a consistent quantum representation of arbitrary matroids. Two ways of constructing matroid states are proposed: the first is defined in terms of circuits, and the second in terms of independent sets. In both approaches, we establish the existence of universal global operators that satisfy desirable properties such as locality, symmetry, commutativity, and are associated with the combinatorial structure of matroids. Furthermore, we establish a hierarchy connecting graph, matroid, and hypergraph states within a unified framework. Additionally, we show how to obtain an arbitrary graph state by applying suitable families of matroid states, whose corresponding operators are the generators of the stabilizer subgroup of the graph state. These results identify matroid theory as a natural combinatorial language for the efficient description of multipartite quantum states and open new perspectives for the investigation of quantum entanglement and related combinatorial structures.

Comments
10 pages, 1 figure, comments are welcome

Related papers

Encoding hypergraphs into quantum states

Ri Qu, Juan Wang, Zong-shang Li +1 more

Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to hypergraphs by means of modifying its axioms and consistency conditions. Then we use the axiomatic approach to encode hypergraphs into a different family of quantum states, called the hypergraph states. Moreover, we also try to do the following: (i) show that real equally weighted states, which occur in Grover and Deutsch-Jozsa algorithms, are equivalent to hypergraph states; (ii) describe the relations among hypergraph states, graph states, and stabilizer states; (iii) provide some transformation rules, stated in purely hypergraph theoretical terms, which completely characterize the evolution of hypergraph states under some local operations, including operators in the Pauli group and some special local Pauli measurements; and (iv) investigate some properties of multipartite entanglement of hypergraph states by hypergraph theory.

arXiv:1211.3911•Physical Review A•Feb 13, 2013•73 citations

Quantum states supported by matroids

Xiaowei Huang, Fei Shi, Lijun Zhang +1 more

In this work, we establish a structural correspondence between quantum states and matroid theory. This connection demonstrates that key properties of quantum states, including entanglement and measurement, can be characterized in purely combinatorial terms via matroids, despite the apparent conceptual distance between these two fields. Using this framework, we show that a matroid-supported state is genuinely entangled when its underlying matroid is connected. Moreover, a uniform superposition over all bases of a matroid is genuinely entangled if and only if the matroid is connected. We also demonstrate that a local measurement in the $Z$-basis on such a state yields another matroid-supported state, whose underlying matroid is a minor of the original one. Inspired by matroid duality, we further propose a notion of quantum state duality, uncovering a deep structural symmetry in state transformations.

quant-pharXiv:2607.15548•Physical Review A•Jul 20, 2026•0 citations

Quantum Hypergraph States: A Review

Davide Poderini, Dagmar Bruß, Chiara Macchiavello

Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.

quant-pharXiv:2603.10917•Reports on Progress in Physics•Mar 12, 2026•3 citations

Encoding graphs into quantum states: An axiomatic approach

Radu Ionicioiu, Timothy P. Spiller

A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, and stabilizer states), motivating us to extend this construction to other classes. We introduce an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Starting from three general axioms we derived a rich structure which includes and generalizes several classes of multipartite entangled state, like graph or stabilizer states, Gaussian cluster states, quantum random networks, and projected entangled pair states. Due to its flexibility we can extend the present formalism to include directed and weighted graphs.

arXiv:1110.5681•Physical Review A•Jun 19, 2012•20 citations

Local unitary symmetries of hypergraph states

David W. Lyons, Daniel J Upchurch, Scott N. Walck +1 more

Abstract Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation and quantum error correction. The study of hypergraph states, with their richer multipartite entanglement and other nonlocal properties, has a promising outlook for new insight into multipartite entanglement. We present results analyzing local unitary symmetries of hypergraph states, including both continuous and discrete families of symmetries. In particular, we show how entanglement types can be detected and distinguished by certain configurations in the hypergraphs from which hypergraph states are constructed.

arXiv:1410.3904•Journal of Physics A Mathematical and Theoretical•Feb 4, 2015•27 citations

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems

Maxime Cautrès, Nathan Claudet, Mehdi Mhalla +3 more

We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications. These states generalize the notion of $k$-pairable states introduced by Bravyi et al., and can be studied from a combinatorial perspective using graph states and $k$-vertex-minor universal graphs. First, we demonstrate the existence of $k$-stabilizer universal graph states that are optimal in size with $n=Θ(k^2)$ qubits. We also provide parameters for which a random graph state on $Θ(k^2)$ qubits is $k$-stabilizer universal with high probability. Our second contribution consists of two explicit constructions of $k$-stabilizer universal graph states on $n = O(k^4)$ qubits. Both rely upon the incidence graph of the projective plane over a finite field $\mathbb{F}_q$. This provides a major improvement over the previously known explicit construction of $k$-pairable graph states with $n = O(2^{3k})$, bringing forth a new and potentially powerful family of multipartite quantum resources.

arXiv:2402.06260•Leibniz international proceedings in informatics•Jan 1, 2024•12 citations
Efficient representations of multipartite quantum states play a fundamental role in quantum information theory, providing both conceptual insight and practical tools for characterizing entanglement. Motivated by the axiomatic framework for graph states [Phys. Rev. A 85, 062313 (2012)] and its subsequent extension to hypergraph states [Phys. Rev. A 87, 022311 (2013)], we introduce an axiomatic construction of \emph{matroid states}, a new family of multipartite quantum states associated with matroids. Our constructions are based on a set of axioms analogous to those that define graph and hypergraph states, yielding a consistent quantum representation of arbitrary matroids. Two ways of constructing matroid states are proposed: the first is defined in terms of circuits, and the second in terms of independent sets. In both approaches, we establish the existence of universal global operators that satisfy desirable properties such as locality, symmetry, commutativity, and are associated with the combinatorial structure of matroids. Furthermore, we establish a hierarchy connecting graph, matroid, and hypergraph states within a unified framework. Additionally, we show how to obtain an arbitrary graph state by applying suitable families of matroid states, whose corresponding operators are the generators of the stabilizer subgroup of the graph state. These results identify matroid theory as a natural combinatorial language for the efficient description of multipartite quantum states and open new perspectives for the investigation of quantum entanglement and related combinatorial structures.
Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to hypergraphs by means of modifying its axioms and consistency conditions. Then we use the axiomatic approach to encode hypergraphs into a different family of quantum states, called the hypergraph states. Moreover, we also try to do the following: (i) show that real equally weighted states, which occur in Grover and Deutsch-Jozsa algorithms, are equivalent to hypergraph states; (ii) describe the relations among hypergraph states, graph states, and stabilizer states; (iii) provide some transformation rules, stated in purely hypergraph theoretical terms, which completely characterize the evolution of hypergraph states under some local operations, including operators in the Pauli group and some special local Pauli measurements; and (iv) investigate some properties of multipartite entanglement of hypergraph states by hypergraph theory.
In this work, we establish a structural correspondence between quantum states and matroid theory. This connection demonstrates that key properties of quantum states, including entanglement and measurement, can be characterized in purely combinatorial terms via matroids, despite the apparent conceptual distance between these two fields. Using this framework, we show that a matroid-supported state is genuinely entangled when its underlying matroid is connected. Moreover, a uniform superposition over all bases of a matroid is genuinely entangled if and only if the matroid is connected. We also demonstrate that a local measurement in the ZZZ-basis on such a state yields another matroid-supported state, whose underlying matroid is a minor of the original one. Inspired by matroid duality, we further propose a notion of quantum state duality, uncovering a deep structural symmetry in state transformations.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, and stabilizer states), motivating us to extend this construction to other classes. We introduce an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Starting from three general axioms we derived a rich structure which includes and generalizes several classes of multipartite entangled state, like graph or stabilizer states, Gaussian cluster states, quantum random networks, and projected entangled pair states. Due to its flexibility we can extend the present formalism to include directed and weighted graphs.
Abstract Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation and quantum error correction. The study of hypergraph states, with their richer multipartite entanglement and other nonlocal properties, has a promising outlook for new insight into multipartite entanglement. We present results analyzing local unitary symmetries of hypergraph states, including both continuous and discrete families of symmetries. In particular, we show how entanglement types can be detected and distinguished by certain configurations in the hypergraphs from which hypergraph states are constructed.
We study the notion of kkk-stabilizer universal quantum state, that is, an nnn-qubit quantum state, such that it is possible to induce any stabilizer state on any kkk qubits, by using only local operations and classical communications. These states generalize the notion of kkk-pairable states introduced by Bravyi et al., and can be studied from a combinatorial perspective using graph states and kkk-vertex-minor universal graphs. First, we demonstrate the existence of kkk-stabilizer universal graph states that are optimal in size with n=Θ(k2)n=Θ(k^2)n=Θ(k2) qubits. We also provide parameters for which a random graph state on Θ(k2)Θ(k^2)Θ(k2) qubits is kkk-stabilizer universal with high probability. Our second contribution consists of two explicit constructions of kkk-stabilizer universal graph states on n=O(k4)n = O(k^4)n=O(k4) qubits. Both rely upon the incidence graph of the projective plane over a finite field Fq\mathbb{F}_qFq​. This provides a major improvement over the previously known explicit construction of kkk-pairable graph states with n=O(23k)n = O(2^{3k})n=O(23k), bringing forth a new and potentially powerful family of multipartite quantum resources.