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

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•Mar 12, 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 and stochastic local operations with classical communication, 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, 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.

Reports on Progress in Physics•Jun 1, 2026•0 citations

k-Uniform complete hypergraph states stabilizers in terms of local operators

Gabriel M. Arantes, Vinícius Salem, Danilo Cius +1 more

In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not shared by their graph counterparts, most notably, their stabilizers are intrinsically nonlocal, as hyperedges can involve arbitrary subsets of vertices. Our formulation provides an explicit description of the stabilizers for k-uniform complete hypergraphs and may offer new insights for exploring these states within the stabilizer formalism. In particular, this approach could facilitate the construction of new Bell inequalities or find applications in quantum error correction.

quant-pharXiv:2511.15911•Nov 21, 2025•1 citation

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

A De Bruijn Graph Formulation of Quantum Entanglement

Arturo Tozzi

Quantum entanglement is commonly characterized through global state descriptions on tensor product spaces, correlation measures or algebraic constructions, while local consistency constraints play no explicit structural role. We formulate entanglement as a combinatorial structure of overlapping local descriptions, drawing on De Bruijn graphs, where nodes represent overlapping contexts and paths encode globally coherent assemblies. We construct a graph whose nodes represent reduced quantum states on subsystems of fixed size and whose edges encode admissible extensions consistent with quantum mechanical compatibility conditions. Global many body states correspond to paths on this graph, while entanglement is reinterpreted as a property of graph connectivity and path multiplicity, rather than as a standalone numerical quantity. This formalism allows a separation between constraints imposed purely by local quantum consistency and additional structure introduced by dynamics, symmetries or boundary conditions, also clarifying how large-scale structural features may arise from local compatibility alone. Our graph-based formulation provides several advantages over conventional approaches. Supporting a unified treatment of static entanglement structure and dynamical evolution, it incorporates finite order locality and memory effects. Entanglement growth can be interpreted as path proliferation, while decoherence and noise correspond to the removal of admissible transitions. Our approach leads to testable hypotheses concerning the scaling of admissible state extensions, the robustness of entangled structures under local perturbations and the emergence of effective geometry from overlap constraints. Potential future directions include applications to many body reconstruction problems and comparative analysis of different classes of quantum states within a single combinatorial language.

•Jan 5, 2026•0 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.
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.
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 and stochastic local operations with classical communication, 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, 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.
In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not shared by their graph counterparts, most notably, their stabilizers are intrinsically nonlocal, as hyperedges can involve arbitrary subsets of vertices. Our formulation provides an explicit description of the stabilizers for k-uniform complete hypergraphs and may offer new insights for exploring these states within the stabilizer formalism. In particular, this approach could facilitate the construction of new Bell inequalities or find applications in quantum error correction.
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.
Quantum entanglement is commonly characterized through global state descriptions on tensor product spaces, correlation measures or algebraic constructions, while local consistency constraints play no explicit structural role. We formulate entanglement as a combinatorial structure of overlapping local descriptions, drawing on De Bruijn graphs, where nodes represent overlapping contexts and paths encode globally coherent assemblies. We construct a graph whose nodes represent reduced quantum states on subsystems of fixed size and whose edges encode admissible extensions consistent with quantum mechanical compatibility conditions. Global many body states correspond to paths on this graph, while entanglement is reinterpreted as a property of graph connectivity and path multiplicity, rather than as a standalone numerical quantity. This formalism allows a separation between constraints imposed purely by local quantum consistency and additional structure introduced by dynamics, symmetries or boundary conditions, also clarifying how large-scale structural features may arise from local compatibility alone. Our graph-based formulation provides several advantages over conventional approaches. Supporting a unified treatment of static entanglement structure and dynamical evolution, it incorporates finite order locality and memory effects. Entanglement growth can be interpreted as path proliferation, while decoherence and noise correspond to the removal of admissible transitions. Our approach leads to testable hypotheses concerning the scaling of admissible state extensions, the robustness of entangled structures under local perturbations and the emergence of effective geometry from overlap constraints. Potential future directions include applications to many body reconstruction problems and comparative analysis of different classes of quantum states within a single combinatorial language.