Generating-Function Matrix Product States

• Generating-Function Matrix Product States is a framework that encodes quantum many-body states using generating functions and algebraic differentiation.
• The method efficiently extracts low-energy excited states and constructs finite-temperature Gibbs states through polynomial-time computations.
• GFMPS achieves exponential compression in free-fermion models and enables accurate simulation of many-body localized phases with constant bond dimension.

Generating-Function Matrix Product States (GFMPS) enable the efficient encoding and manipulation of large classes of quantum many-body states and their spectra within the matrix product state (MPS) and matrix product operator (MPO) frameworks by leveraging generating-function techniques and algebraic differentiation. GFMPS formalism has proved especially potent in the construction of low-temperature Gibbs states, the systematic extraction of excited-state manifolds, and the compression of Gaussian (free fermionic) states, as well as in the non-interacting and many-body localized (MBL) regimes.

1. Mathematical Foundation and Generating-Function Construction

The central principle of GFMPS is the replacement of explicit sums over exponentially many configurations (or tensor-network diagrams) with derivatives of a “generating-function” MPS or MPO. A key building block is the translationally invariant ground-state MPS,

$|\psi(A)\rangle = \prod_{j=0}^{N-1} A^{s_j}$

where $A$ is a rank-3 tensor of physical index $s_j$ (local Hilbert space dimension $d$) and bond dimension $\chi$.

To generate excited-state manifolds, a Bloch-type ansatz is constructed as

$$|G_\phi(\lambda, B)\rangle = \prod_{j=0}^{N-1} \left(A + \lambda e^{-ik r_j} B\right)_j$$

where $k$ is momentum, $\lambda$ a “bookkeeping” parameter, and $B$ an impurity tensor of the same shape as $A$. The first derivative at $A$0 recovers the single-mode excitation: $A$1 This formalism generalizes: e.g., to compute norms, the generating function for the norm is $A$2, and

$A$3

Similarly, operator insertions are encoded as product expansions with inserted sources, whose derivatives yield Fourier-mode observables. All generating functions are encoded as MPS or MPO networks, enabling polynomial-time computations in system size for suitably area-law states (Takahashi et al., 14 Jan 2026).

For non-interacting (Gaussian) fermionic states, GFMPS construction can be done at the level of correlation matrices. The generating function of the amplitudes is fully factorized: $A$4 where $A$5 is the local generating matrix (Fishman et al., 2015, Schuch et al., 2019).

2. Excited States and Spectral Decomposition

Using the generating-function protocol, excited states are parametrized via impurity tensors $A$6 in the single-mode ansatz. The optimal $A$7 is found by solving the generalized eigenproblem: $A$8 where

$A$9

These derivatives are implemented efficiently by automatic differentiation of the generating functions, which are just translationally invariant diagrams, avoiding explicit $s_j$0 term expansions.

This procedure yields a set of eigenpairs $s_j$1, producing an orthonormal set of Bloch-type states $s_j$2. These states span a variationally controlled spectral window and are utilized in building truncated thermal ensembles or for dynamical observables (Takahashi et al., 14 Jan 2026).

An alternative construction for integrable or MBL models encodes all $s_j$3 eigenstates via an $s_j$4-variable polynomial MPS: $s_j$5 The extraction of any eigenstate is achieved via multivariate polynomial differentiation.

3. Finite-Temperature and Gibbs State Construction

The GFMPS approach enables explicit low-temperature Gibbs state construction via subspace expansion: $s_j$6 where $s_j$7 and excited-state MPS are obtained as above. At inverse temperature $s_j$8, truncation error is exponentially suppressed since only low-lying states contribute to the thermal ensemble.

Observable expectation values are evaluated using precomputed matrix elements via further derivatives of generating functions. For dynamical structure factors or frequency-resolved quantities, the necessary correlators are assembled from matrix elements $s_j$9, efficiently matched by momentum conservation rules (Takahashi et al., 14 Jan 2026).

4. Algorithmic Complexity, Scalability, and Benchmarks

The methodological pipeline for GFMPS at finite temperature is as follows:

1. Variationally optimize the translationally invariant ground state MPS $d$0.
2. Form $d$1 and compute the required generalized eigenproblems for $d$2.
3. Diagonalize to obtain $d$3 lowest excited states for relevant momenta $d$4.
4. Assemble the truncated Gibbs density matrix using those eigenstates.
5. Compute observables using generating-function derivatives.

The cost of the most demanding steps scales as $d$5 for observable evaluation and $d$6 for preparing the spectrum, with typical $d$7 and $d$8 up to several thousand feasible for $d$9 (Takahashi et al., 14 Jan 2026).

In the free fermion (Gaussian) setting, the GFMPS protocol realizes exponential compression: the conventional MPS scaling $\chi$0 with $\chi$1 (entanglement entropy $\chi$2) is replaced with $\chi$3 with $\chi$4 (Schuch et al., 2019, Fishman et al., 2015). In the many-body localized phase, the entire spectrum can be encoded with a bounded bond dimension, while delocalized (thermal) phases feature growth with system size (Pekker et al., 2014).

Benchmark studies for the S=½ Heisenberg chain and S=1 chain at low temperature demonstrate that retaining sufficiently many states reproduces exact diagonalization to high fidelity ($\chi$5), rendering GFMPS highly accurate in the low-energy window (Takahashi et al., 14 Jan 2026).

5. Comparison with Alternative Finite-Temperature Tensor Network Methods

Standard tensor-network finite temperature methods include purification (which encodes the Gibbs state as a pure state in an enlarged Hilbert space evolved via imaginary time) and the minimally entangled typical thermal states (METTS) protocol, which samples random product states and applies imaginary-time evolution. Both approaches suffer from entanglement growth at low temperatures, necessitating large bond dimensions and/or extensive sampling.

In contrast, GFMPS circumvents real or imaginary time evolution of mixed states entirely, instead handling entanglement by expanding the eigenstate subspace. The area-law constraint only enters at the level of individual excited states, not the full density matrix, allowing highly efficient and accurate simulations at low temperature for one-dimensional models (Takahashi et al., 14 Jan 2026).

6. Extensions, Limitations, and Outlook

The current GFMPS implementation is based on the single-mode excitation ansatz, which robustly captures the essential low-temperature spectrum in gapless 1D chains (e.g., the deconfined spinon continuum in S=½). At higher temperatures, capturing observables accurately requires systematic inclusion of multi-mode excitations; strategies based on two- or three-particle ansätze or excitation-space algorithms have been proposed.

A direct extension to higher dimensions is in principle straightforward: the MPS tensors are replaced by their projected entangled pair state (PEPS) analogs, and the generating-function protocol is adapted with contraction cost determined by the PEPS contraction scheme.

Error control and convergence are regulated by two tunable parameters: the MPS bond dimension $\chi$6 and the number of retained states $\chi$7. At low temperatures, moderate $\chi$8 suffices due to exponential decay in $\chi$9, but for temperatures above the spectral gap, $$|G_\phi(\lambda, B)\rangle = \prod_{j=0}^{N-1} \left(A + \lambda e^{-ik r_j} B\right)_j$$0 must grow rapidly and costs eventually become prohibitive.

For interacting disordered systems in the MBL phase, GFMPS encapsulates the entire many-body spectrum with only two rank-3 tensors per site, rendering many observables and l-bit operators analytically tractable at constant bond dimension. Approaching the thermal phase, bond dimension increases rapidly, and full-spectrum representation loses its efficiency advantages (Pekker et al., 2014).

GFMPS, as a “third paradigm” for finite-temperature tensor network simulations alongside purification and METTS, is particularly well-adapted for extremely low temperatures and applications where the spectral window is dominated by few-body excitations (Takahashi et al., 14 Jan 2026). For Gaussian fermionic systems, the exponential compression continues to make it the method of choice for large-scale simulations (Schuch et al., 2019, Fishman et al., 2015).

7. Representative Applications

• Low-temperature dynamical and thermodynamic response of quantum spin chains, with benchmark-level accuracy versus exact diagonalization (Takahashi et al., 14 Jan 2026).
• Time-dependent and finite-temperature correlation functions in free fermionic models with system sizes up to $$|G_\phi(\lambda, B)\rangle = \prod_{j=0}^{N-1} \left(A + \lambda e^{-ik r_j} B\right)_j$$1 sites; application to quantum impurity models and quasi-1D geometries (Schuch et al., 2019).
• Encoding the entire many-body spectrum in MBL phases, enabling extraction of all eigenstates and their observables at constant bond dimension (Pekker et al., 2014).
• Efficient MPS-based representation and manipulation of ground states of quadratic Hamiltonians, allowing scalable studies of free-fermion topological and symmetry-broken phases (Fishman et al., 2015).

The GFMPS formalism therefore integrates seamlessly with established tensor-network algorithms, and its algebraic, differentiable structure directly supports analytical computation, scalable numerics, and generalization to excited-state and finite-temperature properties across a wide class of quantum lattice models.