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

Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models

Andreas Alexander Buchheit, Andreas Rupp

math.NAcond-mat.str-elmath.NTquant-phSubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations
arXivHTMLPDF

Abstract

Taming the exponential increase of the Hilbert space dimension with system size in the simulation of gapped quantum lattice models is of the highest relevance for understanding and designing exotic quantum materials, where nonlocal interactions are of particular interest. High-order linked-cluster expansions provide access the solution of the eigenvalue problem for the infinite system, yet rely on the computation of high-dimensional oscillatory lattice sums with a graph structure, only approachable with Monte Carlo methods so far. This work resolves this issue, rendering all required graph lattice sums, referred to as graph zeta functions for kernels involving power-laws, computable. The resulting method reduces the evaluation time for state-of-the art series expansions from tenthousands of core-hours to minutes. After factorizing the lattice sum over blocks, each block is evaluated by the cheapest available strategy depending on its treewidth $\mathrm{tw}$. Basic blocks admit analytic forms in terms of generalized zeta functions. Series-parallel blocks with $\mathrm{tw}\le 2$ can be computed at linear cost in the number of graph nodes and in the size of the momentum grid using a semi-analytical algebra based on Epstein zeta functions and rapidly decaying Fourier series. Finally, for $\mathrm{tw}>2$, the method is combined with tensor-network bucket elimination yielding polynomial scaling of numerical work and memory in momentum grid size with exponents only growing with $\mathrm{tw}$ rather than with the number of vertices. Through use of FFT, the full momentum grid is recovered at the cost of a single momentum evaluation. We provide a detailed analysis of the precision and runtime of our method against analytic and numerical benchmarks. We further reproduce published Monte Carlo data for the transverse-field Ising model on different 1D, 2D, and 3D lattices, obtaining full agreement.

AI Summary

High-order linked-cluster expansions for infinite long-range quantum lattice models require graph-structured lattice sums, often oscillatory when computing excitation dispersions. This paper develops a deterministic evaluation framework for these sums, focusing on summable power-law interactions $|x|^{-\nu}$ with $\operatorname{Re}\nu>d$, optionally supplemented by short-range terms. The framework factorizes sums over biconnected graph blocks and caches recurring blocks across perturbative orders. Bridges and momentum-independent cycles use Epstein-zeta representations. Series-parallel blocks are assembled through multiplication and convolution in a semi-analytic representation that retains leading momentum nonanalyticities explicitly and discretizes the remainder using FFTs. For uniform power-law kernels at fixed exponent and compression threshold, their evaluation costs $\mathcal O(|E|n^d\log(n^d))$ on an $n^d$-point grid. Remaining blocks use tensor-network bucket elimination, with complexity exponents governed by treewidth rather than vertex count. The full momentum grid is obtained without separately evaluating each momentum. Validation combines analytic benchmarks, direct sums, and published transverse-field Ising results in one to three dimensions. Across 753 nonanalytic-order reference coefficients retained for comparison, deviations are at most $3.1$ Monte Carlo standard deviations; all 114 reference series are computed in approximately five minutes on eight laptop cores. An application resolves a three-dimensional antiferromagnetic dispersion with a $|k|$ cusp. The method evaluates perturbative coefficients, not observables beyond the expansion’s validity. Corpus size still grows exponentially with order, high-treewidth blocks remain more costly, and their convergence uses extrapolation. Extensions to multi-atomic lattices, finite temperature, and disorder are left for future work.

Little sign of AI-generated textOverclaims

Error found: The abstract describes series-parallel evaluation as linear in momentum-grid size, whereas the body's complexity bound is O(|E|N log N) for N grid points. The block-caching discussion and block-census table give inconsistent globally unique block counts, producing different reuse factors, especially for the finite-momentum one-quasiparticle corpus.

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

Related papers

Exact and fast series expansions for quantum models with long-range interactions

Antonia Duft, Patrick Adelhardt, Jan Alexander Koziol +2 more

Over the past decade, high-order series expansions based on linked-cluster methods have become an important tool for studying low-energy properties of gapped quantum systems with long-range interactions. We introduce a deterministic framework that removes a central computational bottleneck of this method. Our graph zeta method replaces the costly and statistically noisy Monte Carlo (MC) evaluation of high-dimensional lattice sums by a systematic, high-precision computation that delivers series coefficients within minutes on standard desktop hardware. The full momentum-dependent series is obtained in a single calculation, enabling high-resolution excitation spectra throughout the Brillouin zone. Building on the companion paper [1], the method reformulates graph-embedding sums as graph zeta functions and decomposes them into blocks classified by their treewidth tw. Low-treewidth blocks (tw$\leq2$) admit closed expressions based on Epstein zeta functions, while higher-treewidth blocks (tw$>2$) are evaluated using tensor-network bucket elimination. We benchmark the approach for transverse-field Ising models with power-law interactions in 1d, 2d, and 3d, reproducing previous MC results at a fraction of the computational cost while enabling substantially denser parameter sampling. An open-source implementation makes the method directly applicable to general interactions and large parameter scans. As an application, we compare microscopic interaction models for the stacked quasi-2d transverse-field Ising triangular-lattice antiferromagnet KTmSe$_2$ and find that a model including dipolar interactions best describes existing experimental data. The graph zeta method thus turns high-order linked-cluster expansions into a practical and deterministic tool for fast quantitative momentum-resolved modeling of short- and long-range quantum matter.

cond-mat.str-elCross-listedarXiv:2609.18761•Sep 17, 2026•0 citations

Efficient Quantum Monte Carlo through Cluster Expansions

Jorge Sánchez-Segovia, Álvaro M. Alhambra

The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of $(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}$, where $N$ is the system size, $\varepsilon$ the desired precision, and $Δ$ the interaction-graph degree. This becomes particularly severe in long-range systems, where $Δ\equiv N$, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime $\tilde{\mathcal{O}}(N^4\varepsilon^{-3})$. For quantum partition functions at temperatures $β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)$, this improves to $\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})$, where $D$ is the lattice dimension. The framework directly applies to long-range quantum systems with interactions $\propto1/r^α$, including $2$-local models with $α>2D$.

quant-pharXiv:2610.03893•Oct 6, 2026•0 citations

Quantum Monte Carlo studies of strongly correlated systems for quantum simulators

Stephan Humeniuk

Many strongly correlated quantum systems are difficult to study numerically because of the exponential growth of the Hilbert space combined with the failure of numerical methods in important parameter regimes. This includes the long-standing problems of high-temperature superconductivity and frustrated magnetism. A promising solution to this dilemma are quantum simulators, well-controlled (synthetic) quantum systems, emulating model Hamiltonians not only of condensed matter systems, where parameters can be tuned at will and model complexity can be added step by step. This dissertation presents numerical simulation studies that are motivated by quantum simulators. Using large-scale quantum Monte Carlo computer simulations and mean-field theory the semiquantitative ground state phase diagram of a Penning ion trap quantum simulator, realizing a two-dimensional model of quantum magnetism with long-range interactions, is obtained. We study also thermal and quantum phase transitions in one-dimensional transverse-field Ising models with long-range interactions, which exhibit a Kosterlitz-Thouless transition and universality classes with continuously varying critical exponents. The second part of this thesis is concerned with the Fermi-Hubbard model, which has been realized recently with ultracold atoms in optical lattices, both for repulsive and attractive interactions. Equipped with a quantum gas microscope, which allows single-site single-atom detection, these experimental setups can collect histograms of the particle number from repeated projective measurements. This dissertation presents a method to compute such full counting statistics for quadratic operators such as particle number or magnetization in the framework of determinantal quantum Monte Carlo. From an analysis of the full counting statistics of the particle number for different subsystem sizes the size of preformed pairs or Cooper pairs in the attractive Hubbard model is inferred. Furthermore, excellent agreement of the numerically computed probability distribution of the staggered magnetization with a recent quantum gas experiment demonstrates that current experiments are capable of resolving the differences between the Hubbard model and its limiting Heisenberg model. An extensive method section reviews the stochastic series expansion quantum Monte Carlo method for Ising models in a transverse field, which is free of the sign problem for arbitrary interactions, with special emphasis on the efficient simulation of long-range interactions. Also a self-contained introduction to the determinantal quantum Monte Carlo method is provided.

•Jan 1, 2018•6 citations

Stochastic series expansion method for quantum Ising models with arbitrary interactions

Anders W. Sandvik

A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power-series expansion of the density matrix (stochastic series expansion), and avoids the interaction summations necessary in conventional methods. In the case of long-range interactions, the scaling of the computation time with the system size N is therefore reduced from N2 to N ln(N). The method is tested on a one-dimensional ferromagnet in a transverse field, with interactions decaying as 1/r(2).

arXiv:cond-mat/0303597•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 11, 2003•178 citations

New Developments in Diagrammatic Monte Carlo for Interacting Lattice Fermions: Efficient Algorithms and Applications

Boyuan Shi

This thesis develops diagrammatic methods for thermodynamic and subsystem quantities of interacting lattice fermions, providing reference calculations for quantum simulators and many-body approximations. I formulate an inverse-flavour expansion about a self-consistent Hartree saddle, enumerate non-Gaussian diagrams, and use a discrete Lehmann representation to integrate selected internal vertices analytically. Density results cover 31 state points of the six-flavour Hubbard model on a $70\times70$ lattice at $T/t=0.15$. I generalize combinatorial summation to flavour-dependent propagators and expansion shifts. CoS++ combines partial contractions to obtain connected sums for interaction subsets. A determinant-polynomial sieve evaluates the same sums through local coefficient filters; at ninth order it is 24--25 times faster than the specified CoS baselines in three-flavour dense-random-matrix benchmarks. Thermodynamic applications include a 2048-site honeycomb lattice and a three-flavour square lattice with 1024 sites. For the second Renyi entropy, I derive a fermionic replica path integral and a stable evaluation of its two-time Green functions. The connected-determinant calculation reaches tenth order on a $3\times3$ cluster and ninth order on larger lattices. On $50\times50$ sites at $(U/t,μ/t,βt)=(3,1,8)$, the ninth-order continuation at shift $α=1.3$ gives $S_2/N_s=0.06695$ with propagated Monte Carlo uncertainty $3.0\times10^{-5}$. Comparing two expansion shifts at their respective retained orders gives an endpoint difference of $2.6\times10^{-4}$.

arXiv:2610.37505•Oct 27, 2026•0 citations

Quantum-critical properties of the long-range transverse-field Ising model from quantum Monte Carlo simulations

Jan Alexander Koziol, Anja Langheld, Sebastian C. Kapfer +1 more

The quantum-critical properties of the transverse-field Ising model with algebraically decaying interactions are investigated by means of stochastic series expansion quantum Monte Carlo, on both the one-dimensional linear chain and the two-dimensional square lattice. We extract the critical exponents $\ensuremath{\nu}$ and $\ensuremath{\beta}$ as a function of the decay exponent of the long-range interactions. For ferromagnetic Ising interactions, we resolve the limiting regimes known from field theory, ranging from the nearest-neighbor Ising to the long-range Gaussian universality classes, as well as the intermediate regime with continuously varying critical exponents. In the long-range Gaussian regime, we treat the effect of dangerous irrelevant variables on finite-size scaling forms. For antiferromagnetic and therefore competing Ising interactions, the stochastic series expansion algorithm displays growing autocorrelation times leading to a reduced performance. Nevertheless, our results are consistent with the nearest-neighbor Ising universality for all investigated interaction ranges both on the linear chain and the square lattice.

arXiv:2103.09469•Physical review. B./Physical review. B•Jun 23, 2021•56 citations
Taming the exponential increase of the Hilbert space dimension with system size in the simulation of gapped quantum lattice models is of the highest relevance for understanding and designing exotic quantum materials, where nonlocal interactions are of particular interest. High-order linked-cluster expansions provide access the solution of the eigenvalue problem for the infinite system, yet rely on the computation of high-dimensional oscillatory lattice sums with a graph structure, only approachable with Monte Carlo methods so far. This work resolves this issue, rendering all required graph lattice sums, referred to as graph zeta functions for kernels involving power-laws, computable. The resulting method reduces the evaluation time for state-of-the art series expansions from tenthousands of core-hours to minutes. After factorizing the lattice sum over blocks, each block is evaluated by the cheapest available strategy depending on its treewidth tw\mathrm{tw}tw. Basic blocks admit analytic forms in terms of generalized zeta functions. Series-parallel blocks with tw≤2\mathrm{tw}\le 2tw≤2 can be computed at linear cost in the number of graph nodes and in the size of the momentum grid using a semi-analytical algebra based on Epstein zeta functions and rapidly decaying Fourier series. Finally, for tw>2\mathrm{tw}>2tw>2, the method is combined with tensor-network bucket elimination yielding polynomial scaling of numerical work and memory in momentum grid size with exponents only growing with tw\mathrm{tw}tw rather than with the number of vertices. Through use of FFT, the full momentum grid is recovered at the cost of a single momentum evaluation. We provide a detailed analysis of the precision and runtime of our method against analytic and numerical benchmarks. We further reproduce published Monte Carlo data for the transverse-field Ising model on different 1D, 2D, and 3D lattices, obtaining full agreement.
High-order linked-cluster expansions for infinite long-range quantum lattice models require graph-structured lattice sums, often oscillatory when computing excitation dispersions. This paper develops a deterministic evaluation framework for these sums, focusing on summable power-law interactions ∣x∣−ν|x|^{-\nu}∣x∣−ν with Re⁡ν>d\operatorname{Re}\nu>dReν>d, optionally supplemented by short-range terms.
The framework factorizes sums over biconnected graph blocks and caches recurring blocks across perturbative orders. Bridges and momentum-independent cycles use Epstein-zeta representations. Series-parallel blocks are assembled through multiplication and convolution in a semi-analytic representation that retains leading momentum nonanalyticities explicitly and discretizes the remainder using FFTs. For uniform power-law kernels at fixed exponent and compression threshold, their evaluation costs O(∣E∣ndlog⁡(nd))\mathcal O(|E|n^d\log(n^d))O(∣E∣ndlog(nd)) on an ndn^dnd-point grid. Remaining blocks use tensor-network bucket elimination, with complexity exponents governed by treewidth rather than vertex count. The full momentum grid is obtained without separately evaluating each momentum.
Validation combines analytic benchmarks, direct sums, and published transverse-field Ising results in one to three dimensions. Across 753 nonanalytic-order reference coefficients retained for comparison, deviations are at most 3.13.13.1 Monte Carlo standard deviations; all 114 reference series are computed in approximately five minutes on eight laptop cores. An application resolves a three-dimensional antiferromagnetic dispersion with a ∣k∣|k|∣k∣ cusp.
The method evaluates perturbative coefficients, not observables beyond the expansion’s validity. Corpus size still grows exponentially with order, high-treewidth blocks remain more costly, and their convergence uses extrapolation. Extensions to multi-atomic lattices, finite temperature, and disorder are left for future work.
Over the past decade, high-order series expansions based on linked-cluster methods have become an important tool for studying low-energy properties of gapped quantum systems with long-range interactions. We introduce a deterministic framework that removes a central computational bottleneck of this method. Our graph zeta method replaces the costly and statistically noisy Monte Carlo (MC) evaluation of high-dimensional lattice sums by a systematic, high-precision computation that delivers series coefficients within minutes on standard desktop hardware. The full momentum-dependent series is obtained in a single calculation, enabling high-resolution excitation spectra throughout the Brillouin zone. Building on the companion paper [1], the method reformulates graph-embedding sums as graph zeta functions and decomposes them into blocks classified by their treewidth tw. Low-treewidth blocks (tw≤2\leq2≤2) admit closed expressions based on Epstein zeta functions, while higher-treewidth blocks (tw>2>2>2) are evaluated using tensor-network bucket elimination. We benchmark the approach for transverse-field Ising models with power-law interactions in 1d, 2d, and 3d, reproducing previous MC results at a fraction of the computational cost while enabling substantially denser parameter sampling. An open-source implementation makes the method directly applicable to general interactions and large parameter scans. As an application, we compare microscopic interaction models for the stacked quasi-2d transverse-field Ising triangular-lattice antiferromagnet KTmSe2_22​ and find that a model including dipolar interactions best describes existing experimental data. The graph zeta method thus turns high-order linked-cluster expansions into a practical and deterministic tool for fast quantitative momentum-resolved modeling of short- and long-range quantum matter.
The sign problem remains a major obstacle to extending the success of Monte Carlo methods to generic quantum many-body systems. A powerful alternative relies on cluster expansions, which provide convergent representations of free energies and related quantities, with applications ranging from tensor network contractions to quantum dynamics and circuits. Within their convergence regime, these expansions often yield deterministic polynomial-time algorithms. However, such methods require exhaustive enumeration of connected clusters, leading to a computational overhead of (Nε−1)O(log⁡Δ)(N\varepsilon^{-1})^{\mathcal{O}(\logΔ)}(Nε−1)O(logΔ), where NNN is the system size, ε\varepsilonε the desired precision, and ΔΔΔ the interaction-graph degree. This becomes particularly severe in long-range systems, where Δ≡NΔ\equiv NΔ≡N, resulting in quasi-polynomial runtimes. Here, we introduce a Markov chain algorithm that samples cluster expansions directly in the space of connected clusters, replacing deterministic enumeration by Monte Carlo sampling. Because sampling occurs in an abstract cluster space rather than a physical configuration space, the conventional exponential sign problem is absent within the convergence regime. For general polymer models, we establish an FPRAS with runtime O~(N4ε−3)\tilde{\mathcal{O}}(N^4\varepsilon^{-3})O~(N4ε−3). For quantum partition functions at temperatures β≤βsampling≡O(1)β\leqβ_{\mathrm{sampling}}\equiv\mathcal{O}(1)β≤βsampling​≡O(1), this improves to O~(N3+1/Dε−3)\tilde{\mathcal{O}}(N^{3+1/D}\varepsilon^{-3})O~(N3+1/Dε−3), where DDD is the lattice dimension. The framework directly applies to long-range quantum systems with interactions ∝1/rα\propto1/r^α∝1/rα, including 222-local models with α>2Dα>2Dα>2D.
Many strongly correlated quantum systems are difficult to study numerically because of the exponential growth of the Hilbert space combined with the failure of numerical methods in important parameter regimes. This includes the long-standing problems of high-temperature superconductivity and frustrated magnetism. A promising solution to this dilemma are quantum simulators, well-controlled (synthetic) quantum systems, emulating model Hamiltonians not only of condensed matter systems, where parameters can be tuned at will and model complexity can be added step by step. This dissertation presents numerical simulation studies that are motivated by quantum simulators. Using large-scale quantum Monte Carlo computer simulations and mean-field theory the semiquantitative ground state phase diagram of a Penning ion trap quantum simulator, realizing a two-dimensional model of quantum magnetism with long-range interactions, is obtained. We study also thermal and quantum phase transitions in one-dimensional transverse-field Ising models with long-range interactions, which exhibit a Kosterlitz-Thouless transition and universality classes with continuously varying critical exponents. The second part of this thesis is concerned with the Fermi-Hubbard model, which has been realized recently with ultracold atoms in optical lattices, both for repulsive and attractive interactions. Equipped with a quantum gas microscope, which allows single-site single-atom detection, these experimental setups can collect histograms of the particle number from repeated projective measurements. This dissertation presents a method to compute such full counting statistics for quadratic operators such as particle number or magnetization in the framework of determinantal quantum Monte Carlo. From an analysis of the full counting statistics of the particle number for different subsystem sizes the size of preformed pairs or Cooper pairs in the attractive Hubbard model is inferred. Furthermore, excellent agreement of the numerically computed probability distribution of the staggered magnetization with a recent quantum gas experiment demonstrates that current experiments are capable of resolving the differences between the Hubbard model and its limiting Heisenberg model. An extensive method section reviews the stochastic series expansion quantum Monte Carlo method for Ising models in a transverse field, which is free of the sign problem for arbitrary interactions, with special emphasis on the efficient simulation of long-range interactions. Also a self-contained introduction to the determinantal quantum Monte Carlo method is provided.
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power-series expansion of the density matrix (stochastic series expansion), and avoids the interaction summations necessary in conventional methods. In the case of long-range interactions, the scaling of the computation time with the system size N is therefore reduced from N2 to N ln(N). The method is tested on a one-dimensional ferromagnet in a transverse field, with interactions decaying as 1/r(2).
This thesis develops diagrammatic methods for thermodynamic and subsystem quantities of interacting lattice fermions, providing reference calculations for quantum simulators and many-body approximations. I formulate an inverse-flavour expansion about a self-consistent Hartree saddle, enumerate non-Gaussian diagrams, and use a discrete Lehmann representation to integrate selected internal vertices analytically. Density results cover 31 state points of the six-flavour Hubbard model on a 70×7070\times7070×70 lattice at T/t=0.15T/t=0.15T/t=0.15. I generalize combinatorial summation to flavour-dependent propagators and expansion shifts. CoS++ combines partial contractions to obtain connected sums for interaction subsets. A determinant-polynomial sieve evaluates the same sums through local coefficient filters; at ninth order it is 24--25 times faster than the specified CoS baselines in three-flavour dense-random-matrix benchmarks. Thermodynamic applications include a 2048-site honeycomb lattice and a three-flavour square lattice with 1024 sites. For the second Renyi entropy, I derive a fermionic replica path integral and a stable evaluation of its two-time Green functions. The connected-determinant calculation reaches tenth order on a 3×33\times33×3 cluster and ninth order on larger lattices. On 50×5050\times5050×50 sites at (U/t,μ/t,βt)=(3,1,8)(U/t,μ/t,βt)=(3,1,8)(U/t,μ/t,βt)=(3,1,8), the ninth-order continuation at shift α=1.3α=1.3α=1.3 gives S2/Ns=0.06695S_2/N_s=0.06695S2​/Ns​=0.06695 with propagated Monte Carlo uncertainty 3.0×10−53.0\times10^{-5}3.0×10−5. Comparing two expansion shifts at their respective retained orders gives an endpoint difference of 2.6×10−42.6\times10^{-4}2.6×10−4.
The quantum-critical properties of the transverse-field Ising model with algebraically decaying interactions are investigated by means of stochastic series expansion quantum Monte Carlo, on both the one-dimensional linear chain and the two-dimensional square lattice. We extract the critical exponents $\ensuremath{\nu}$ and $\ensuremath{\beta}$ as a function of the decay exponent of the long-range interactions. For ferromagnetic Ising interactions, we resolve the limiting regimes known from field theory, ranging from the nearest-neighbor Ising to the long-range Gaussian universality classes, as well as the intermediate regime with continuously varying critical exponents. In the long-range Gaussian regime, we treat the effect of dangerous irrelevant variables on finite-size scaling forms. For antiferromagnetic and therefore competing Ising interactions, the stochastic series expansion algorithm displays growing autocorrelation times leading to a reduced performance. Nevertheless, our results are consistent with the nearest-neighbor Ising universality for all investigated interaction ranges both on the linear chain and the square lattice.