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

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

Antonia Duft, Patrick Adelhardt, Jan Alexander Koziol, Andreas A. Buchheit, Kai Phillip Schmidt

cond-mat.str-elcond-mat.stat-mechquant-phSubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Sep 16, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

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.

AI Summary

Linked-cluster expansions for long-range quantum models require high-dimensional lattice-embedding sums, previously evaluated using costly Monte Carlo sampling. This paper develops a deterministic replacement for translationally invariant interactions on Bravais lattices, targeting ground-state energies and one-quasiparticle dispersions in the thermodynamic limit. An exact combinatorial “softcore mapping” removes vertex-exclusion constraints through Möbius inversion over graph contractions. The resulting graph zeta functions factorize at articulation points into reusable blocks. Blocks of augmented treewidth $\mathrm{tw}\leq2$ are evaluated through Epstein zeta functions and their products and convolutions; higher-treewidth blocks use tensor-network bucket elimination and extrapolation. Mathematical proofs and convergence analysis are delegated to a companion paper. An open-source implementation computes the full momentum-grid dispersion in one calculation. Benchmarks cover power-law transverse-field Ising models on chain, square, triangular and cubic lattices, reaching order 13 for ground-state energies and order 11 for dispersions, with maximum treewidth four. Coefficients generally agree with published Monte Carlo estimates within reported uncertainties. Representative three-dimensional calculations take about 200 seconds on one desktop core. Reduced costs enable denser interaction-exponent scans. Fits to digitized neutron-scattering spectra of $\mathrm{KTmSe}_2$ favor nearest-neighbor exchange plus dipolar interactions over the tested short-range descriptions. “Numerically exact” means sampling-free, not free of discretization error. Perturbative truncation and critical-point extrapolation remain limitations. Semi-analytic singularity treatment is unavailable above treewidth two; multi-site unit cells and additional observables remain future extensions. Three-dimensional anisotropic dipolar modeling reaches only order five with experimental code, and material-fit precision is limited by extraction from published intensity plots.

Little sign of AI-generated text

Error found: The reported benchmarks do not pair minute-scale runtimes with quantified remaining discretization errors, leaving the advertised high-precision performance insufficiently established rather than disproved. The abstract overstates the implementation's immediate applicability to general interactions: documented library support covers power-law and short-range combinations, while other kernels require adaptations and the anisotropic dipolar extension remains experimental.

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

Comments
33 pages, 17 figures

Related papers

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

Andreas Alexander Buchheit, Andreas Rupp

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.

math.NACross-listedarXiv:2609.18918•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

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

Monte Carlo Based Techniques for Quantum Magnets with Long-Range Interactions

Patrick Adelhardt, Jan Alexander Koziol, Anja Langheld +1 more

Long-range interactions are relevant for a large variety of quantum systems in quantum optics and condensed matter physics. In particular, the control of quantum-optical platforms promises to gain deep insights into quantum-critical properties induced by the long-range nature of interactions. From a theoretical perspective, long-range interactions are notoriously complicated to treat. Here, we give an overview of recent advancements to investigate quantum magnets with long-range interactions focusing on two techniques based on Monte Carlo integration. First, the method of perturbative continuous unitary transformations where classical Monte Carlo integration is applied within the embedding scheme of white graphs. This linked-cluster expansion allows extracting high-order series expansions of energies and observables in the thermodynamic limit. Second, stochastic series expansion quantum Monte Carlo integration enables calculations on large finite systems. Finite-size scaling can then be used to determine the physical properties of the infinite system. In recent years, both techniques have been applied successfully to one- and two-dimensional quantum magnets involving long-range Ising, XY, and Heisenberg interactions on various bipartite and non-bipartite lattices. Here, we summarise the obtained quantum-critical properties including critical exponents for all these systems in a coherent way. Further, we review how long-range interactions are used to study quantum phase transitions above the upper critical dimension and the scaling techniques to extract these quantum critical properties from the numerical calculations.

arXiv:2403.00421•Entropy•May 1, 2024•28 citations

Dispersion relations in two- and three-dimensional quantum systems

Valeriia Bilokon, Elvira Bilokon, I. V. Lukin +2 more

Extracting momentum-resolved excitation spectra in strongly correlated quantum systems remains a major challenge, especially beyond one spatial dimension. We present an efficient tensor-network approach to compute dispersion relations via imaginary-time evolution within the infinite projected entangled-pair states framework. Benchmarking on the transverse-field Ising model, the method successfully captures dispersion relations in both paramagnetic and ferromagnetic phases for two- and three-dimensional lattices, achieving strong agreement with series-expansion methods, where these are applicable. Crucially, this work presents the first demonstration of dispersion relation calculations for three-dimensional quantum lattice models—a long-standing computational challenge that opens previously inaccessible research frontiers. The method demonstrates remarkable efficiency, requiring only modest computational resources while maintaining high accuracy across wide parameter ranges. Its broad applicability makes it a powerful tool for quantum simulation, photonic material design, and quantum information platforms requiring precise momentum-resolved spectra.

arXiv:2509.15483•Physical Review Research•Feb 17, 2026•1 citation

Quantum Monte Carlo study of long-range transverse-field Ising models on the triangular lattice

Stephan Humeniuk

Motivated by recent experiments with a Penning ion trap quantum simulator, we perform numerically exact Stochastic Series Expansion quantum Monte Carlo simulations of long-range transverse-field Ising models on a triangular lattice for different decay powers $\ensuremath{\alpha}$ of the interactions. The phase boundary for the ferromagnet is obtained as a function of $\ensuremath{\alpha}$. For antiferromagnetic interactions, there is strong indication that the transverse field stabilizes a clock ordered phase with sublattice magnetization $(M,\ensuremath{-}\frac{M}{2},\ensuremath{-}\frac{M}{2})$ with unsaturated $M<1$ in a process known as ``order by disorder'' similar to the nearest-neighbor antiferromagnet on the triangular lattice. Connecting the known limiting cases of nearest-neighbor and infinite-range interactions, a semiquantitative phase diagram is obtained. Magnetization curves for the ferromagnet for experimentally relevant system sizes and with open boundary conditions are presented.

arXiv:1602.02979•Physical review. B./Physical review. B•Mar 14, 2016•37 citations
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.
Linked-cluster expansions for long-range quantum models require high-dimensional lattice-embedding sums, previously evaluated using costly Monte Carlo sampling. This paper develops a deterministic replacement for translationally invariant interactions on Bravais lattices, targeting ground-state energies and one-quasiparticle dispersions in the thermodynamic limit.
An exact combinatorial “softcore mapping” removes vertex-exclusion constraints through Möbius inversion over graph contractions. The resulting graph zeta functions factorize at articulation points into reusable blocks. Blocks of augmented treewidth tw≤2\mathrm{tw}\leq2tw≤2 are evaluated through Epstein zeta functions and their products and convolutions; higher-treewidth blocks use tensor-network bucket elimination and extrapolation. Mathematical proofs and convergence analysis are delegated to a companion paper. An open-source implementation computes the full momentum-grid dispersion in one calculation.
Benchmarks cover power-law transverse-field Ising models on chain, square, triangular and cubic lattices, reaching order 13 for ground-state energies and order 11 for dispersions, with maximum treewidth four. Coefficients generally agree with published Monte Carlo estimates within reported uncertainties. Representative three-dimensional calculations take about 200 seconds on one desktop core. Reduced costs enable denser interaction-exponent scans. Fits to digitized neutron-scattering spectra of KTmSe2\mathrm{KTmSe}_2KTmSe2​ favor nearest-neighbor exchange plus dipolar interactions over the tested short-range descriptions.
“Numerically exact” means sampling-free, not free of discretization error. Perturbative truncation and critical-point extrapolation remain limitations. Semi-analytic singularity treatment is unavailable above treewidth two; multi-site unit cells and additional observables remain future extensions. Three-dimensional anisotropic dipolar modeling reaches only order five with experimental code, and material-fit precision is limited by extraction from published intensity plots.
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.
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.
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).
Long-range interactions are relevant for a large variety of quantum systems in quantum optics and condensed matter physics. In particular, the control of quantum-optical platforms promises to gain deep insights into quantum-critical properties induced by the long-range nature of interactions. From a theoretical perspective, long-range interactions are notoriously complicated to treat. Here, we give an overview of recent advancements to investigate quantum magnets with long-range interactions focusing on two techniques based on Monte Carlo integration. First, the method of perturbative continuous unitary transformations where classical Monte Carlo integration is applied within the embedding scheme of white graphs. This linked-cluster expansion allows extracting high-order series expansions of energies and observables in the thermodynamic limit. Second, stochastic series expansion quantum Monte Carlo integration enables calculations on large finite systems. Finite-size scaling can then be used to determine the physical properties of the infinite system. In recent years, both techniques have been applied successfully to one- and two-dimensional quantum magnets involving long-range Ising, XY, and Heisenberg interactions on various bipartite and non-bipartite lattices. Here, we summarise the obtained quantum-critical properties including critical exponents for all these systems in a coherent way. Further, we review how long-range interactions are used to study quantum phase transitions above the upper critical dimension and the scaling techniques to extract these quantum critical properties from the numerical calculations.
Extracting momentum-resolved excitation spectra in strongly correlated quantum systems remains a major challenge, especially beyond one spatial dimension. We present an efficient tensor-network approach to compute dispersion relations via imaginary-time evolution within the infinite projected entangled-pair states framework. Benchmarking on the transverse-field Ising model, the method successfully captures dispersion relations in both paramagnetic and ferromagnetic phases for two- and three-dimensional lattices, achieving strong agreement with series-expansion methods, where these are applicable. Crucially, this work presents the first demonstration of dispersion relation calculations for three-dimensional quantum lattice models—a long-standing computational challenge that opens previously inaccessible research frontiers. The method demonstrates remarkable efficiency, requiring only modest computational resources while maintaining high accuracy across wide parameter ranges. Its broad applicability makes it a powerful tool for quantum simulation, photonic material design, and quantum information platforms requiring precise momentum-resolved spectra.
Motivated by recent experiments with a Penning ion trap quantum simulator, we perform numerically exact Stochastic Series Expansion quantum Monte Carlo simulations of long-range transverse-field Ising models on a triangular lattice for different decay powers $\ensuremath{\alpha}$ of the interactions. The phase boundary for the ferromagnet is obtained as a function of $\ensuremath{\alpha}$. For antiferromagnetic interactions, there is strong indication that the transverse field stabilizes a clock ordered phase with sublattice magnetization $(M,\ensuremath{-}\frac{M}{2},\ensuremath{-}\frac{M}{2})$ with unsaturated M<1M<1M<1 in a process known as ``order by disorder'' similar to the nearest-neighbor antiferromagnet on the triangular lattice. Connecting the known limiting cases of nearest-neighbor and infinite-range interactions, a semiquantitative phase diagram is obtained. Magnetization curves for the ferromagnet for experimentally relevant system sizes and with open boundary conditions are presented.