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
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.
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