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:cond-mat/0501493 · Physical Review Letters

Efficient Evaluation of Partition Functions of Inhomogeneous Many-Body Spin Systems

V. Murg, Frank Verstraete, J. I. Cirac

Published Jul 28, 2005• 36 citations
arXivHTMLPDF

Abstract

We present a numerical method to evaluate partition functions and associated correlation functions of inhomogeneous 2D classical spin systems and 1D quantum spin systems. The method is scalable and has a controlled error. We illustrate the algorithm by calculating the finite-temperature properties of bosonic particles in 1D optical lattices, as realized in current experiments.

DOI
10.1103/physrevlett.95.057206

Related papers

Thermodynamical properties of quantum many-body systems

Eduardo R. Gagliano, S. Bacci

We present a method to compute exactly the partition function of quantum many-body systems. This approach involves the evaluation of a set of coefficients for the continued-fraction expansion of a resolventlike operator. The main advantage of this method is that this set of coefficients is unique and allows one to calculate the partition function at any temperature. As an illustration, the method is applied to a simple one-dimensional spinless model.

Physical Review Letters•Mar 6, 1989•5 citations

Rigorous Calculation of the Partition Function for the Finite Number of Ising Spins

Alexey Peretyatko, Ivan A. Bogatyrev, Vitalii Yu. Kapitan +3 more

The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing Interface and massive parallel instructions. The algorithm can be used for the research of the interacting spin systems in the Ising models of 2D and 3D. The processing power and scalability is analyzed for different parallel and distributed systems. Different methods of the speed up measuring allow obtain the super-linear speeding up for the small number of processes. Program code could be useful also for research by exact method of different Ising spin systems, e.g. system with competition interactions.

arXiv:1110.2561•Oct 12, 2011•0 citations

Polynomial-time Classical Simulation for One-dimensional Quantum Gibbs States

Tomotaka Kuwahara, Keiji Saito

This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve one-dimensional quantum systems. However, there exists no exact proof that arbitrary one-dimensional quantum Gibbs states can be efficiently solved by a classical computer. Therefore, the aim of this paper is to prove this with the clustering properties for arbitrary finite temperatures $β^{-1}$. We explicitly show an efficient algorithm that approximates the partition function up to an error $ε$ with a computational cost that scales as $n\cdot {\rm poly}(1/ε)$, where the degree of the polynomial depends on $β$ as $e^{O(β)}$. Extending the analysis to higher dimensions at high temperatures, we obtain a weaker result for the computational cost n\cdot (1/ε)^{\log^{D-1} (1/ε)}, where $D$ is the lattice dimension.

arXiv:1807.08424•Jul 23, 2018•2 citations

Dynamic correlation functions in quantum many-body systems at zero temperature

Eduardo R. Gagliano, C. A. Balseiro

We present a simple numerical approach to compute dynamic correlation functions in quantum many-body systems at zero temperature. The method is based on a projective technique for the memory-function formalism, and requires as a starting point an independent evaluation of the ground-state energy and wave function. We illustrate the method with a one-dimensional model of spinless fermions and calculate the density-density, current-current, and single-particle correlation functions. The obtained spectral functions show different types of elementary excitations: particle-hole, soliton-antisoliton, exciton, etc. We compare our results with analytical results, and with those obtained through different approaches available in the literature.

Physical review. B, Condensed matter•Dec 1, 1988•52 citations

Efficient Algorithm for Random-Bond Ising Models in 2D

Yen Lee Loh, E. W. Carlson

We present an efficient algorithm for calculating the properties of Ising models in two dimensions, directly in the spin basis, without the need for mapping to fermion or dimer models. The algorithm computes the partition function and correlation functions at a single temperature on any planar network of N Ising spins in O(N;{3/2}) time or less. The method can handle continuous or discrete bond disorder and is especially efficient in the case of bond or site dilution, where it executes in O(NlnN) time near the percolation threshold. We demonstrate its feasibility on the ferromagnetic Ising model and the +/-J random-bond Ising model and discuss the regime of applicability in cases of full frustration such as the Ising antiferromagnet on a triangular lattice.

arXiv:cond-mat/0610822•Physical Review Letters•Nov 30, 2006•31 citations

Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems

Aram W. Harrow, Saeed Adel Mehraban, Mehdi Soleimanifar

We present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same problem is NP-hard below this point. Together with our work, this shows that the transition in the phase of a quantum system is also accompanied by a transition in the hardness of approximation. We also show that in a system of n particles above the phase transition point, the correlation between two observables whose distance is at least Ω(logn) decays exponentially. We can improve the factor of logn to a constant when the Hamiltonian has commuting terms or is on a 1D chain. The key to our results is a characterization of the phase transition and the critical behavior of the system in terms of the complex zeros of the partition function. Our work extends a seminal work of Dobrushin and Shlosman on the equivalence between the decay of correlations and the analyticity of the free energy in classical spin models. On the algorithmic side, our result extends the scope of a recent approach due to Barvinok for solving classical counting problems to quantum many-body systems.

arXiv:1910.09071•ACM Symposium on Theory of Computing (STOC)•Jun 7, 2020•36 citations
We present a numerical method to evaluate partition functions and associated correlation functions of inhomogeneous 2D classical spin systems and 1D quantum spin systems. The method is scalable and has a controlled error. We illustrate the algorithm by calculating the finite-temperature properties of bosonic particles in 1D optical lattices, as realized in current experiments.
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing Interface and massive parallel instructions. The algorithm can be used for the research of the interacting spin systems in the Ising models of 2D and 3D. The processing power and scalability is analyzed for different parallel and distributed systems. Different methods of the speed up measuring allow obtain the super-linear speeding up for the small number of processes. Program code could be useful also for research by exact method of different Ising spin systems, e.g. system with competition interactions.
This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve one-dimensional quantum systems. However, there exists no exact proof that arbitrary one-dimensional quantum Gibbs states can be efficiently solved by a classical computer. Therefore, the aim of this paper is to prove this with the clustering properties for arbitrary finite temperatures β−1β^{-1}β−1. We explicitly show an efficient algorithm that approximates the partition function up to an error εεε with a computational cost that scales as n⋅poly(1/ε)n\cdot {\rm poly}(1/ε)n⋅poly(1/ε), where the degree of the polynomial depends on βββ as eO(β)e^{O(β)}eO(β). Extending the analysis to higher dimensions at high temperatures, we obtain a weaker result for the computational cost n\cdot (1/ε)^{\log^{D-1} (1/ε)}, where DDD is the lattice dimension.
We present a simple numerical approach to compute dynamic correlation functions in quantum many-body systems at zero temperature. The method is based on a projective technique for the memory-function formalism, and requires as a starting point an independent evaluation of the ground-state energy and wave function. We illustrate the method with a one-dimensional model of spinless fermions and calculate the density-density, current-current, and single-particle correlation functions. The obtained spectral functions show different types of elementary excitations: particle-hole, soliton-antisoliton, exciton, etc. We compare our results with analytical results, and with those obtained through different approaches available in the literature.
We present an efficient algorithm for calculating the properties of Ising models in two dimensions, directly in the spin basis, without the need for mapping to fermion or dimer models. The algorithm computes the partition function and correlation functions at a single temperature on any planar network of N Ising spins in O(N;{3/2}) time or less. The method can handle continuous or discrete bond disorder and is especially efficient in the case of bond or site dilution, where it executes in O(NlnN) time near the percolation threshold. We demonstrate its feasibility on the ferromagnetic Ising model and the +/-J random-bond Ising model and discuss the regime of applicability in cases of full frustration such as the Ising antiferromagnet on a triangular lattice.
We present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same problem is NP-hard below this point. Together with our work, this shows that the transition in the phase of a quantum system is also accompanied by a transition in the hardness of approximation. We also show that in a system of n particles above the phase transition point, the correlation between two observables whose distance is at least Ω(logn) decays exponentially. We can improve the factor of logn to a constant when the Hamiltonian has commuting terms or is on a 1D chain. The key to our results is a characterization of the phase transition and the critical behavior of the system in terms of the complex zeros of the partition function. Our work extends a seminal work of Dobrushin and Shlosman on the equivalence between the decay of correlations and the analyticity of the free energy in classical spin models. On the algorithmic side, our result extends the scope of a recent approach due to Barvinok for solving classical counting problems to quantum many-body systems.