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

From Laplacian-to-Adjacency Matrix for Continuous Spins on Graphs

Nikita Titov, Andrea Trombettoni

cond-mat.stat-mechquant-phSubmitted Nov 15, 2025• Announced Nov 18, 2025• Revised May 18, 2026 (v2)
v1 · Nov 15, 2025v2 · May 18, 2026
arXivHTMLPDF

Abstract

The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more challenging than on regular lattices, as the loss of translational invariance gives rise to an infinite set of saddle point constraints in the thermodynamic limit. We show that the free energy at low and high temperature $T$ is determined by the spectrum of two fundamental graph-theoretic objects: the Laplacian matrix at low $T$ and the Adjacency matrix at high $T$. Their interplay is studied across several classes of graphs. For regular lattices the two coincide. We obtain an exact solution on trees, where the Lagrange multipliers interestingly depend solely on the number of nearest neighbors. We further contrast these classical results with those for a quantum spin model on an exemplary tree. For decorated lattices, the singular part of the free energy is governed by the Laplacian spectrum, whereas this is true for the full free energy only in the zero temperature limit. Finally, we discuss a bipartite fully connected graph to highlight the importance of a finite coordination number in these results.

Journal reference
EPL 153 61002 (2026)
DOI
10.1209/0295-5075/ae4e57
Comments
18 pages, 3 figures, minor typographical errors corrected

Related papers

No Laplacian Perfect State Transfer in Trees

Gabriel Coutinho, Henry Liu

We consider a system of qubits coupled via nearest-neighbor interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to 1. We are interested in determining which graphs allow for a transfer of quantum state with fidelity equal to 1. To answer this question, it is enough to consider the action of the Laplacian matrix of the graph in a vector space of suitable dimension. Our main result is that if the underlying graph is a tree with more than two vertices, then perfect state transfer does not happen. We also explore related questions, such as what happens in bipartite graphs and graphs with an odd number of spanning trees. Finally, we consider the model based on the $XY$-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph. In this case, we conjecture that perfect state transfer does not happen in trees with more than three vertices.

arXiv:1408.2935•SIAM Journal on Discrete Mathematics•Jan 1, 2015•48 citations

The $O(n\to\infty)$ Rotor Model and the Quantum Spherical Model on Graphs

Nikita Titov, Andrea Trombettoni

We show that the large $n$ limit of the $O(n)$ quantum rotor model defined on a general graph has the same critical behavior as the corresponding quantum spherical model and that the critical exponents depend solely on the spectral dimension $d_s$ of the graph. To this end, we employ a classical to quantum mapping and use known results for the large $n$ limit of the classical $O(n)$ model on graphs. Away from the critical point, we discuss the interplay between the Laplacian and the Adjacency matrix in the whole parameter plane of the quantum Hamiltonian. These results allow us to paint the full picture of the $O(n)$ quantum rotor model on graphs in the large $n$ limit.

cond-mat.stat-mechCross-listedarXiv:2601.14119•Physical review. B./Physical review. B•Jan 21, 2026•0 citations

Statics and dynamics of quantum XY and Heisenberg systems on graphs

Tobias J. Osborne

We consider the statics and dynamics of distinguishable spin-$\frac{1}{2}$ systems on an arbitrary graph $G$ with $N$ vertices. In particular, we consider systems of quantum spins evolving according to one of two Hamiltonians: (i) the $XY$ Hamiltonian ${H}_{XY}$, which contains an $XY$ interaction for every pair of spins connected by an edge in $G$; and (ii) the Heisenberg Hamiltonian ${H}_{\mathrm{Heis}}$, which contains a Heisenberg interaction term for every pair of spins connected by an edge in $G$. We find that the action of the $XY$ (respectively, Heisenberg) Hamiltonian on state space is equivalent to the action of the adjacency matrix (respectively, combinatorial Laplacian) of a sequence ${G}_{k}$, $k=0,\dots{},N$ of graphs derived from $G$ (with ${G}_{1}=G$). This equivalence of actions demonstrates that the dynamics of these two models is the same as the evolution of a free particle hopping on the graphs ${G}_{k}$. Thus we show how to replace the complicated dynamics of the original spin model with simpler dynamics on a more complicated geometry. A simple corollary of our approach allows us to write an explicit spectral decomposition of the $XY$ model in a magnetic field on the path consisting of $N$ vertices. We also use our approach to utilize results from spectral graph theory to solve new spin models: the $XY$ model and Heisenberg model in a magnetic field on the complete graph.

arXiv:quant-ph/0312126•Physical Review B•Sep 12, 2006•28 citations

Equivalent Laplacian and adjacency quantum walks on irregular graphs

Thomas G. Wong, Joshua Lockhart

The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead. It is well known that these quantum walks are equivalent when the graph is regular, i.e., when each vertex has the same number of neighbors. If the graph is irregular, however, the quantum walks evolve differently. In this paper, we show that for some irregular graphs, if the particle is initially localized at a certain vertex, the probability distributions of the two quantum walks are identical, even though the amplitudes differ. We analytically prove this for a graph with five vertices and a graph with six vertices. By simulating the walks on all 1 018 689 568 simple, connected, irregular graphs with 11 vertices or less, we found 64 graphs with this notion of equivalence. We also give eight infinite families of graphs supporting these equivalent walks.

arXiv:2107.05580•Physical Review A•Oct 25, 2021•6 citations

Low-temperature spectrum of the quantum transfer matrix of the XXZ chain in the massless regime

Saskia Faulmann, Frank Göhmann, Karol Kajetan Kozlowski

The free energy per lattice site of a quantum spin chain in the thermodynamic limit is determined by a single `dominant' Eigenvalue of an associated quantum transfer matrix in the infinite Trotter number limit. For integrable quantum spin chains, related with solutions of the Yang-Baxter equation, an appropriate choice of the quantum transfer matrix enables to study its spectrum, e.g.\ by means of the algebraic Bethe Ansatz. In its turn, the knowledge of the full spectrum allows one to study its universality properties such as the appearance of a conformal spectrum in the low-temperature regime. More generally, accessing the full spectrum is a necessary step for deriving thermal form factor series representations of the correlation functions of local operators for the spin chain under consideration. These are statements that have been established by physicists on a heuristic level and that are calling for a rigorous mathematical justification. In this work we implement certain aspects of this programme with the example of the XXZ quantum spin chain in the antiferromagnetic massless regime and in the low-temperature limit. We rigorously establish the existence, uniqueness and characterise the form of the solutions to the non-linear integral equations that are equivalent to the Bethe Ansatz equations for the quantum transfer matrix of this model. This allows us to describe that part of the quantum transfer matrix spectrum that is related to the Bethe Ansatz and that does not collapse to zero in the infinite Trotter number limit. Within the considered part of the spectrum we rigorously identify the dominant Eigenvalue and show that those correlations lengths that diverge in the low-temperature limit are given, to the leading order, by the spectrum of the free Boson $c=1$ conformal field theory. This rigorously establishes a long-standing conjecture present in the physics literature.

arXiv:2305.06679•Probability and Mathematical Physics•Nov 3, 2025•3 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
The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-nnn limit of the O(n)O(n)O(n) model on graphs, which is considerably more challenging than on regular lattices, as the loss of translational invariance gives rise to an infinite set of saddle point constraints in the thermodynamic limit. We show that the free energy at low and high temperature TTT is determined by the spectrum of two fundamental graph-theoretic objects: the Laplacian matrix at low TTT and the Adjacency matrix at high TTT. Their interplay is studied across several classes of graphs. For regular lattices the two coincide. We obtain an exact solution on trees, where the Lagrange multipliers interestingly depend solely on the number of nearest neighbors. We further contrast these classical results with those for a quantum spin model on an exemplary tree. For decorated lattices, the singular part of the free energy is governed by the Laplacian spectrum, whereas this is true for the full free energy only in the zero temperature limit. Finally, we discuss a bipartite fully connected graph to highlight the importance of a finite coordination number in these results.
We consider a system of qubits coupled via nearest-neighbor interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to 1. We are interested in determining which graphs allow for a transfer of quantum state with fidelity equal to 1. To answer this question, it is enough to consider the action of the Laplacian matrix of the graph in a vector space of suitable dimension. Our main result is that if the underlying graph is a tree with more than two vertices, then perfect state transfer does not happen. We also explore related questions, such as what happens in bipartite graphs and graphs with an odd number of spanning trees. Finally, we consider the model based on the XYXYXY-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph. In this case, we conjecture that perfect state transfer does not happen in trees with more than three vertices.
The O(n→∞)O(n\to\infty)O(n→∞) Rotor Model and the Quantum Spherical Model on Graphs
We show that the large nnn limit of the O(n)O(n)O(n) quantum rotor model defined on a general graph has the same critical behavior as the corresponding quantum spherical model and that the critical exponents depend solely on the spectral dimension dsd_sds​ of the graph. To this end, we employ a classical to quantum mapping and use known results for the large nnn limit of the classical O(n)O(n)O(n) model on graphs. Away from the critical point, we discuss the interplay between the Laplacian and the Adjacency matrix in the whole parameter plane of the quantum Hamiltonian. These results allow us to paint the full picture of the O(n)O(n)O(n) quantum rotor model on graphs in the large nnn limit.
We consider the statics and dynamics of distinguishable spin-12\frac{1}{2}21​ systems on an arbitrary graph GGG with NNN vertices. In particular, we consider systems of quantum spins evolving according to one of two Hamiltonians: (i) the XYXYXY Hamiltonian HXY{H}_{XY}HXY​, which contains an XYXYXY interaction for every pair of spins connected by an edge in GGG; and (ii) the Heisenberg Hamiltonian HHeis{H}_{\mathrm{Heis}}HHeis​, which contains a Heisenberg interaction term for every pair of spins connected by an edge in GGG. We find that the action of the XYXYXY (respectively, Heisenberg) Hamiltonian on state space is equivalent to the action of the adjacency matrix (respectively, combinatorial Laplacian) of a sequence Gk{G}_{k}Gk​, k=0,…,Nk=0,\dots{},Nk=0,…,N of graphs derived from GGG (with G1=G{G}_{1}=GG1​=G). This equivalence of actions demonstrates that the dynamics of these two models is the same as the evolution of a free particle hopping on the graphs Gk{G}_{k}Gk​. Thus we show how to replace the complicated dynamics of the original spin model with simpler dynamics on a more complicated geometry. A simple corollary of our approach allows us to write an explicit spectral decomposition of the XYXYXY model in a magnetic field on the path consisting of NNN vertices. We also use our approach to utilize results from spectral graph theory to solve new spin models: the XYXYXY model and Heisenberg model in a magnetic field on the complete graph.
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead. It is well known that these quantum walks are equivalent when the graph is regular, i.e., when each vertex has the same number of neighbors. If the graph is irregular, however, the quantum walks evolve differently. In this paper, we show that for some irregular graphs, if the particle is initially localized at a certain vertex, the probability distributions of the two quantum walks are identical, even though the amplitudes differ. We analytically prove this for a graph with five vertices and a graph with six vertices. By simulating the walks on all 1 018 689 568 simple, connected, irregular graphs with 11 vertices or less, we found 64 graphs with this notion of equivalence. We also give eight infinite families of graphs supporting these equivalent walks.
The free energy per lattice site of a quantum spin chain in the thermodynamic limit is determined by a single `dominant' Eigenvalue of an associated quantum transfer matrix in the infinite Trotter number limit. For integrable quantum spin chains, related with solutions of the Yang-Baxter equation, an appropriate choice of the quantum transfer matrix enables to study its spectrum, e.g.\ by means of the algebraic Bethe Ansatz. In its turn, the knowledge of the full spectrum allows one to study its universality properties such as the appearance of a conformal spectrum in the low-temperature regime. More generally, accessing the full spectrum is a necessary step for deriving thermal form factor series representations of the correlation functions of local operators for the spin chain under consideration. These are statements that have been established by physicists on a heuristic level and that are calling for a rigorous mathematical justification. In this work we implement certain aspects of this programme with the example of the XXZ quantum spin chain in the antiferromagnetic massless regime and in the low-temperature limit. We rigorously establish the existence, uniqueness and characterise the form of the solutions to the non-linear integral equations that are equivalent to the Bethe Ansatz equations for the quantum transfer matrix of this model. This allows us to describe that part of the quantum transfer matrix spectrum that is related to the Bethe Ansatz and that does not collapse to zero in the infinite Trotter number limit. Within the considered part of the spectrum we rigorously identify the dominant Eigenvalue and show that those correlations lengths that diverge in the low-temperature limit are given, to the leading order, by the spectrum of the free Boson c=1c=1c=1 conformal field theory. This rigorously establishes a long-standing conjecture present in the physics literature.
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.