Taxonomy of Integrable and Ground-State Solvable Models: Jastrow Wavefunctions on Graphs and Parent Hamiltonians

This paper introduces a family of ground-state solvable many-body systems on graphs where distinguishable continuous-variable particles interact via Jastrow-type wavefunctions determined by the graph's adjacency matrix, leading to parent Hamiltonians that feature both two-body interactions and three-body interactions along graph paths.

The Gist

Imagine you are at a massive party. In the world of physics, this party is a collection of particles (like atoms or electrons) dancing around. Usually, physicists assume these particles are either all identical twins (indistinguishable) or that they all know everyone else in the room and can talk to anyone.

But what if the party is more like a complex social network? What if some people are only friends with their neighbors, others are friends with a specific group, and some are total strangers? And what if everyone at the party is a unique individual with their own name and personality?

This paper, written by Nilanjan Sasmal and Adolfo del Campo, introduces a new way to map out these "parties" using graphs (which are just fancy drawings of dots connected by lines). They call their method "Graph-Jastrow."

Here is the breakdown of their discovery using simple analogies:

1. The "Social Network" of Particles

In traditional physics, if you have 100 particles, you usually assume they all interact with each other equally (like a giant group hug). This paper says: No, let's look at the connections.

• The Graph: Imagine a map where every particle is a dot (a node). If two particles interact, you draw a line (an edge) between them.
• The Rule: The lines on this map dictate who talks to whom. If there is no line, they don't interact.
• The Twist: The particles are distinguishable. Think of them not as identical clones, but as unique people. One is "Alice," one is "Bob." This breaks the usual "symmetry" rules where physicists pretend everyone is the same.

2. The "Perfect Dance" (The Ground State)

In quantum mechanics, the "ground state" is the most relaxed, lowest-energy way a system can exist. It's like the perfect choreography where everyone is dancing without tripping over each other.

The authors found a special formula (a "wavefunction") that describes this perfect dance. They call it a Jastrow Wavefunction.

• The Old Way: The dance involved everyone holding hands with everyone else.
• The New Way: The dance only involves people holding hands with the specific people connected to them on their Graph.
  • If Alice is connected to Bob and Charlie, she only holds hands with them.
  • If Dave is on an island with no lines, he dances alone.

3. The "Parent Hamiltonian" (The Rulebook)

Every dance needs a rulebook (the Hamiltonian) that tells the particles how to move and what forces to apply. The big question in physics is: If I want the particles to dance in this specific "Graph-Jastrow" way, what are the rules I need to write down?

The authors solved this puzzle. They figured out exactly what the rulebook looks like for any graph you can draw. They found two main ingredients:

• Ingredient A: Two-Body Interactions (The Handshakes)
  Just like the graph lines, there are forces between pairs of particles. If there is a line between them, they push or pull each other.
• Ingredient B: Three-Body Interactions (The "Side-Eye" Effect)
  This is the clever part. The authors discovered that if Alice is connected to Bob, and Alice is also connected to Charlie, a new force appears involving all three of them.
  • Analogy: Imagine Alice is holding Bob's hand and Charlie's hand. The tension in Alice's arms creates a unique "three-way" tension that wouldn't exist if they were just holding hands in a line. The graph structure forces these "triangles" of interaction to exist.

4. Why This Matters: The "Taxonomy"

The authors didn't just find one new system; they built a map of all possible systems. They used the tools of graph theory to categorize these quantum systems.

• The Complete Graph: If you connect everyone to everyone, you get famous, well-known systems (like the Calogero-Sutherland model).
• The Path Graph: If you connect them in a line (1-2-3-4), you get a new type of system where particles only talk to their immediate neighbors.
• The Star Graph: Imagine one central "Hub" particle connected to everyone else, but the others don't talk to each other. This models a "central spin" or an impurity in a material.
• The Wheel Graph: A circle of friends with one person in the middle connected to everyone.

By changing the shape of the graph, you instantly generate a brand new, solvable quantum model.

5. The "Magic" of Solvability

In physics, most systems are a nightmare to solve. You can't write down the exact answer; you have to use computers to guess.

The beauty of this paper is that these systems are "solvable." Because the authors started with the dance (the wavefunction) and worked backward to find the rules (the Hamiltonian), they know the exact answer for the energy and the movement of the particles. They created a "recipe book" where you can pick a graph shape, pick a type of interaction, and instantly get a working quantum model.

Summary

Think of this paper as a Lego set for quantum physics.

• The Bricks: Particles.
• The Connectors: The Graph (who is friends with whom).
• The Instructions: The "Graph-Jastrow" formula.

The authors showed that by snapping these bricks together in different patterns (graphs), you can build a whole new universe of quantum systems that are mathematically perfect and solvable. They turned the complex world of quantum particles into a game of connecting dots, revealing that the shape of the connections dictates the laws of physics for that system.

Technical Summary

1. Problem Statement

The paper addresses the challenge of identifying and classifying exactly solvable quantum many-body systems for distinguishable particles with continuous variables. While significant progress has been made in integrable models with full permutation symmetry (e.g., Calogero-Sutherland, Lieb-Liniger) and in spin systems on graphs, there is a lack of a unified framework for systems where:

• Particles are distinguishable (breaking permutation symmetry).
• Interactions are restricted by a specific graph topology rather than being all-to-all or strictly local in physical space.
• The ground-state wavefunction is known, but the corresponding parent Hamiltonian (including necessary multi-body terms) is not immediately obvious.

The authors aim to construct a "taxonomy" of such models, explicitly deriving the parent Hamiltonians, ground-state wavefunctions, and energy eigenvalues for arbitrary graph connectivities.

2. Methodology

The authors employ a constructive approach based on the Graph-Jastrow Wavefunction (GJW) ansatz.

• The Ansatz: They define a ground-state wavefunction $\Phi_0$ as a product of pair-correlation functions $f(r_{ij})$ defined only over the edges $(i, j)$ of a graph $G(V, E)$:
  $$\Phi_0(\vec{r}_1, \dots, \vec{r}_N) = \prod_{(i,j) \in E} f(r_{ij}) = \prod_{i<j} e^{A_{ij} \log f(r_{ij})}$$
  where $A_{ij}$ is the adjacency matrix of the graph ($A_{ij}=1$ if connected, $0$ otherwise).
• Derivation of Parent Hamiltonian: By applying the kinetic energy operator (Laplacian) to $\Phi_0$, they derive the "parent Hamiltonian" $\hat{H}_0$ such that $\hat{H}_0 \Phi_0 = 0$.
  • They utilize the factorization method, defining operators $Q_i$ such that $\hat{H}_0 = \sum Q_i^\dagger Q_i$. This proves $\hat{H}_0$ is positive semi-definite, confirming $\Phi_0$ is the true zero-energy ground state.
• Generalization: The framework is extended to include:
  • External confinement potentials (one-body terms).
  • Arbitrary spatial dimensions ($D$).
  • Specific 1D simplifications where the structure becomes more transparent.
• Graph Theory Integration: They utilize algebraic graph theory (joins, products, regular graphs) to systematically generate new models from known ones.

3. Key Contributions

A. General Structure of the Parent Hamiltonian

The most significant theoretical result is the explicit form of the Hamiltonian required to support a GJW. The authors prove that for any graph $G$, the parent Hamiltonian consists of:

1. Two-body interactions: Determined directly by the graph's edges ($A_{ij}$).
2. Three-body interactions: Determined by the graph's 2-paths (sequences of three vertices $i-j-k$).
   • The three-body term arises from the cross-terms in the Laplacian acting on the product of pair functions.
   • This establishes a direct link between the combinatorial structure of the graph (specifically the number of 2-paths) and the physical necessity of three-body forces.

B. Taxonomy of Models

The paper categorizes solvable models based on the underlying graph topology:

• Complete Graphs ($K_N$): Recovers standard integrable models (Calogero-Moser, Lieb-Liniger, Coupled Oscillators) where the three-body term often reduces to a constant or a two-body contribution due to symmetry.
• Path ($P_N$) and Cycle ($C_N$) Graphs: Generalizes the Jain-Khare model. These models feature nearest-neighbor interactions with inverse-square potentials (or other pair functions) supplemented by induced attractive three-body terms restricted to next-nearest neighbors.
• $2r$-Regular Graphs: Introduces "Truncated" models (e.g., Truncated Calogero-Sutherland) where interactions extend to $r$ nearest neighbors.
• Star and Wheel Graphs: Models describing a central particle interacting with an environment (impurity/polaron models) or a central spin coupled to a bath.
• Graph Products: Demonstrates how operations like Cartesian products (e.g., Ladder graphs, Prism graphs) and Joins (e.g., Bipartite graphs) generate composite many-body systems with transparent physical interpretations (e.g., "System + Environment").

C. Explicit Solutions for Various Pair Functions

The authors provide closed-form solutions for the Hamiltonian and ground-state energy for several standard pair functions $f(x)$, including:

• Power law: $|x_{ij}|^g$
• Exponential: $\exp(g|x_{ij}|)$ (Lieb-Liniger type)
• Gaussian: $\exp(g|x_{ij}|^2)$ (Coupled oscillators)
• Hyperbolic: $|\sinh(x_{ij}/\ell)|^g$

4. Key Results

• Universality of Three-Body Terms: For generic graphs (non-complete), the parent Hamiltonian must include three-body interactions to maintain the GJW as an exact ground state. These terms are not arbitrary but are strictly determined by the adjacency matrix and the derivative of the pair function.
• Recovery of Known Models: The framework successfully recovers the Calogero-Sutherland model, the Lieb-Liniger gas, and the Jain-Khare model as specific limits of the general graph formulation.
• New Solvable Models: The paper presents numerous new exactly solvable models, including:
  • Truncated-range Calogero-Sutherland models on regular graphs.
  • Bipartite mixture models (e.g., $K_{m,n}$) describing distinct species with only inter-species interactions.
  • Impurity models (Star graphs) where a central particle interacts with a non-interacting or interacting bath.
• Energy Eigenvalues: For many cases, the ground-state energy $E_0$ is derived explicitly, often arising from constant terms in the potential that do not vanish even if $\hat{H}_0 \Phi_0 = 0$ (requiring a shift $\hat{H} = \hat{H}_0 - E_0$).

5. Significance and Impact

• Unification: The work provides a unified mathematical language connecting seemingly disparate integrable models (spin chains, quantum fluids, impurity systems) through the lens of graph theory.
• Experimental Relevance: The models are highly relevant for modern quantum simulation platforms (ion chains, optical tweezers, Rydberg arrays) where particles are distinguishable and interactions can be engineered to follow specific graph topologies rather than just spatial proximity.
• Theoretical Insight: It clarifies the role of permutation symmetry breaking. In standard fluids, symmetry allows the reduction of complex multi-body terms; in graph-based systems, the lack of symmetry necessitates explicit three-body terms to stabilize the ground state.
• Future Directions: The paper opens avenues for studying:
  • Excitation spectra and quasi-exact solvability.
  • Disordered systems (random graphs) and ensemble averages.
  • Embedding these models in higher dimensions or on lattices (Nosanow-Jastrow extensions).

In summary, Sasmal and del Campo have established a rigorous "Graph-Jastrow" framework that maps the topology of interaction networks directly to the structure of quantum many-body Hamiltonians, revealing that three-body interactions are the natural cost of restricting correlations to arbitrary graph edges.