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:2609.27318 · Physical review. E

Minimal representations of topology-preserving quantum-like states

William Horvat, Debadrita Saha, Nicolás Gigena, Prineha Narang, Gregory D. Scholes

quant-phmath.COSubmitted Sep 23, 2026• Announced Sep 24, 2026• 0 citations• Revised Oct 6, 2026 (v2)
v1 · Sep 23, 2026v2 · Oct 6, 2026
arXivHTMLPDF

Abstract

We provide an equitable partition that gives an exact, minimal representation for the graph Cartesian product formed from quantum-like bits that preserves the relevant spectral and topological properties. We show that this result follows from the fact that the operations of taking the Cartesian product of graphs and constructing equitable partition of the graphs commute. Numerical simulations illustrate the preserved emergent eigenstates in the reduced structures. Additionally, we provide a construction of the minimal structure without passing through the Cartesian product. Finally, we frame quantum-like structures in the language of topology and fibrations.

AI Summary

The paper studies exact reductions of Cartesian-product graphs used to represent classical-network “quantum-like” bits. Each bit consists of two $k$-regular subgraphs connected by $\ell$-regular couplings, with collective modes at adjacency eigenvalues $k\pm\ell$. The question is whether composite graphs can be reduced while retaining the tensor-product space of these modes. An equitable partition contracts each constituent subgraph to one vertex, yielding the single-bit quotient $\begin{pmatrix}k&\ell\\\ell&k\end{pmatrix}$. The central result is that equitable quotienting commutes with Cartesian products: the product partition has characteristic matrix $S_1\otimes S_2$ and quotient adjacency $A_{\pi_1}\otimes I+I\otimes A_{\pi_2}$. This follows from the intertwining identity $AS=SA_\pi$ and Kronecker-product algebra. For $m$ bits with $N$ vertices each, the resulting weighted hypercube has $2^m$ vertices rather than $N^m$, preserving the $2^m$ collective eigenmodes through lifting by the characteristic matrix. This is presented as minimal for retaining the full collective state space. Numerical illustrations accompany the construction, and graph fibrations and coverings provide a proposed topological interpretation. The reduction remains exponential in bit number and removes internal subgraph dynamics rather than compressing arbitrary states using limited entanglement. Intermediate reductions retaining one full constituent graph require $N2^{m-1}$ vertices. Exact adjacency-spectrum preservation assumes strict regularity; controlled approximate reductions beyond this setting remain open. Other stated open questions concern information-encoding limits, which reductions retain physically relevant dynamics, and implementation in mechanical or electrical oscillator networks.

Some signs of AI-generated textIncrementalUnclear noveltyOverclaimsPossible error

Central claim may not hold: The claimed automatic equivalence between equitable partitions and covering projections is false in general, and Appendix C's edge map fails its own unique-lifting requirement, leaving the stronger topological interpretation unestablished. The minimality proof incorrectly claims that merging equitable cells shifts eigenvalues, although its conclusion can be recovered by counting the independent states that must be preserved. The perturbation discussion incorrectly extends interlacing to an unchanged quotient; the bounds require a compression recomputed from the perturbed adjacency matrix.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Accepted for publication in Physical Review E

Related papers

PERFECT STATE TRANSFER, GRAPH PRODUCTS AND EQUITABLE PARTITIONS

Ge Yang, Benjamin Greenberg, Oscar Perez +1 more

We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on generalizations of the double cones and variants of the Cartesian graph products (which include the hypercube). We also describe a generalization of the path collapsing argument (which reduces questions about perfect state transfer to simpler weighted multigraphs) for graphs with equitable distance partitions.

arXiv:1009.1340•International Journal of Quantum Information•Apr 1, 2011•33 citations

Quantumlike Product States Constructed from Classical Networks

Gregory D. Scholes, Graziano Amati

Can complex classical systems be designed to exhibit superpositions of tensor products of basis states, thereby mimicking quantum states? We exhibit a one-to-one map between the product basis of quantum states comprising an arbitrary number of qubits and the eigenstates of a construction comprising classical oscillator networks. Specifically, we prove the existence of this map based on Cartesian products of graphs, where the graphs depict the layout of oscillator networks. We show how quantumlike gates can act on the classical networks to allow quantumlike operations in the state space.

arXiv:2406.19221•Physical Review Letters•Feb 13, 2025•17 citations

Encoding matroids into quantum states

Nathan Ferreira, Alison A. Silva, Giuliano G. La Guardia +1 more

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.

quant-pharXiv:2607.02736•Jul 6, 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

Symmetry-Protected Topological Structures in Quantum Many-Body Scar Subspaces

Chihiro Matsui, Thomas Quella, Naoto Tsuji

We investigate how symmetry-associated topological properties, originally defined for ground states, can be consistently extended to dynamically isolated subspaces of quantum many-body systems. Focusing on quantum many-body scars (QMBS), we show that a scar subspace is invariant under the relevant symmetries, and it can support well-defined topological properties inherited from an underlying symmetry-protected topological (SPT) ground state, even though individual scar states need not themselves be symmetric. We refer to such structures as SPT-like scar subspaces, emphasizing that the topological properties are defined at the level of the symmetry-invariant subspace rather than on a state-by-state basis. As a concrete example, we analyze the spin-$1$ Affleck--Kennedy--Lieb--Tasaki (AKLT) model, where a restricted spectrum-generating algebra (rSGA) generates a tower of QMBS on top of a nontrivial SPT ground state admitting a matrix product state (MPS) representation. We demonstrate that the resulting symmetry-invariant scar subspace inherits well-defined topological characteristics, encoded in bond-space symmetry representations, expectation values of symmetry-twist operators, and long-range string order in the dilute regime. We further show that these features persist in a broader class of models, including deformations and higher-spin generalizations that preserve the relevant symmetries and admit nontrivial SPT ground states with MPS representations. Our results provide a general framework in which symmetry-associated topological properties, while inherited from the ground state, are consistently realized at the level of symmetry-invariant nonthermal subspaces. This perspective clarifies how topological structures can be meaningfully defined beyond individual eigenstates.

cond-mat.str-elCross-listedarXiv:2512.11216•Dec 15, 2025•3 citations

Beyond Commutativity: Redesigning Trotter Decomposition via Local Symmetry

Naoki Negishi, Bo Yang

The product formula, commonly known as Trotter decomposition, is a central tool for digital quantum simulation, whose performance depends critically on how the Hamiltonian is partitioned into tractable blocks. Standard decompositions typically rely on direct commutativity among Hamiltonian terms in a chosen operator representation, which can lead to large residual errors and deep circuits for complex, practically relevant many-body quantum systems. We address this fundamental bottleneck by introducing a new decomposition principle that goes beyond commutativity, grouping Hamiltonian terms into local three-site clusters according to the underlying SU(2) symmetry of the local dynamics. We show that three-site generators fall into at most four SU(2)-symmetry classes, each admitting an effective two-qubit SU(4) representation with exact and efficient implementations. By reducing the number of clusters, this decomposition principle substantially suppresses commutator-induced errors and circuit overhead while preserving underlying physical structures that commutativity-based decompositions may violate. We demonstrate the proposed method on several physically relevant spin-lattice models, where the reduced cluster structure can even realise the second-order product formula without doubling the circuit depth, as would be required by conventional decompositions. Numerical simulations of a Kagome Heisenberg model with triangular spin-chirality interactions show that the proposed method reduces both state infidelity and average spin-chirality bias by more than three orders of magnitude compared with conventional decompositions, while using substantially fewer gates. These results establish local symmetry as a flexible and practical design principle for product-formula simulation, opening a route to more accurate and hardware-efficient simulations of broader classes of many-body systems.

quant-pharXiv:2605.16016•May 18, 2026•4 citations
We provide an equitable partition that gives an exact, minimal representation for the graph Cartesian product formed from quantum-like bits that preserves the relevant spectral and topological properties. We show that this result follows from the fact that the operations of taking the Cartesian product of graphs and constructing equitable partition of the graphs commute. Numerical simulations illustrate the preserved emergent eigenstates in the reduced structures. Additionally, we provide a construction of the minimal structure without passing through the Cartesian product. Finally, we frame quantum-like structures in the language of topology and fibrations.
The paper studies exact reductions of Cartesian-product graphs used to represent classical-network “quantum-like” bits. Each bit consists of two kkk-regular subgraphs connected by ℓ\ellℓ-regular couplings, with collective modes at adjacency eigenvalues k±ℓk\pm\ellk±ℓ. The question is whether composite graphs can be reduced while retaining the tensor-product space of these modes.
An equitable partition contracts each constituent subgraph to one vertex, yielding the single-bit quotient (kℓℓk)\begin{pmatrix}k&\ell\\\ell&k\end{pmatrix}(kℓ​ℓk​). The central result is that equitable quotienting commutes with Cartesian products: the product partition has characteristic matrix S1⊗S2S_1\otimes S_2S1​⊗S2​ and quotient adjacency Aπ1⊗I+I⊗Aπ2A_{\pi_1}\otimes I+I\otimes A_{\pi_2}Aπ1​​⊗I+I⊗Aπ2​​. This follows from the intertwining identity AS=SAπAS=SA_\piAS=SAπ​ and Kronecker-product algebra. For mmm bits with NNN vertices each, the resulting weighted hypercube has 2m2^m2m vertices rather than NmN^mNm, preserving the 2m2^m2m collective eigenmodes through lifting by the characteristic matrix. This is presented as minimal for retaining the full collective state space. Numerical illustrations accompany the construction, and graph fibrations and coverings provide a proposed topological interpretation.
The reduction remains exponential in bit number and removes internal subgraph dynamics rather than compressing arbitrary states using limited entanglement. Intermediate reductions retaining one full constituent graph require N2m−1N2^{m-1}N2m−1 vertices. Exact adjacency-spectrum preservation assumes strict regularity; controlled approximate reductions beyond this setting remain open. Other stated open questions concern information-encoding limits, which reductions retain physically relevant dynamics, and implementation in mechanical or electrical oscillator networks.
Can complex classical systems be designed to exhibit superpositions of tensor products of basis states, thereby mimicking quantum states? We exhibit a one-to-one map between the product basis of quantum states comprising an arbitrary number of qubits and the eigenstates of a construction comprising classical oscillator networks. Specifically, we prove the existence of this map based on Cartesian products of graphs, where the graphs depict the layout of oscillator networks. We show how quantumlike gates can act on the classical networks to allow quantumlike operations in the state space.
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.
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 investigate how symmetry-associated topological properties, originally defined for ground states, can be consistently extended to dynamically isolated subspaces of quantum many-body systems. Focusing on quantum many-body scars (QMBS), we show that a scar subspace is invariant under the relevant symmetries, and it can support well-defined topological properties inherited from an underlying symmetry-protected topological (SPT) ground state, even though individual scar states need not themselves be symmetric. We refer to such structures as SPT-like scar subspaces, emphasizing that the topological properties are defined at the level of the symmetry-invariant subspace rather than on a state-by-state basis. As a concrete example, we analyze the spin-111 Affleck--Kennedy--Lieb--Tasaki (AKLT) model, where a restricted spectrum-generating algebra (rSGA) generates a tower of QMBS on top of a nontrivial SPT ground state admitting a matrix product state (MPS) representation. We demonstrate that the resulting symmetry-invariant scar subspace inherits well-defined topological characteristics, encoded in bond-space symmetry representations, expectation values of symmetry-twist operators, and long-range string order in the dilute regime. We further show that these features persist in a broader class of models, including deformations and higher-spin generalizations that preserve the relevant symmetries and admit nontrivial SPT ground states with MPS representations. Our results provide a general framework in which symmetry-associated topological properties, while inherited from the ground state, are consistently realized at the level of symmetry-invariant nonthermal subspaces. This perspective clarifies how topological structures can be meaningfully defined beyond individual eigenstates.
The product formula, commonly known as Trotter decomposition, is a central tool for digital quantum simulation, whose performance depends critically on how the Hamiltonian is partitioned into tractable blocks. Standard decompositions typically rely on direct commutativity among Hamiltonian terms in a chosen operator representation, which can lead to large residual errors and deep circuits for complex, practically relevant many-body quantum systems. We address this fundamental bottleneck by introducing a new decomposition principle that goes beyond commutativity, grouping Hamiltonian terms into local three-site clusters according to the underlying SU(2) symmetry of the local dynamics. We show that three-site generators fall into at most four SU(2)-symmetry classes, each admitting an effective two-qubit SU(4) representation with exact and efficient implementations. By reducing the number of clusters, this decomposition principle substantially suppresses commutator-induced errors and circuit overhead while preserving underlying physical structures that commutativity-based decompositions may violate. We demonstrate the proposed method on several physically relevant spin-lattice models, where the reduced cluster structure can even realise the second-order product formula without doubling the circuit depth, as would be required by conventional decompositions. Numerical simulations of a Kagome Heisenberg model with triangular spin-chirality interactions show that the proposed method reduces both state infidelity and average spin-chirality bias by more than three orders of magnitude compared with conventional decompositions, while using substantially fewer gates. These results establish local symmetry as a flexible and practical design principle for product-formula simulation, opening a route to more accurate and hardware-efficient simulations of broader classes of many-body systems.