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:1612.05602 · Physical Review Letters

Polynomial-Time Classical Simulation of Quantum Ferromagnets

Sergey B. Bravyi, David Gosset

Published Sep 8, 2017• 40 citations
arXivHTMLPDF

Abstract

We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, system size, and inverse temperature. As a consequence, we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the partition function by the perfect matching sum of a finite graph with positive edge weights. Although the perfect matching sum is not known to be efficiently approximable in general, the graphs obtained by our method have a special structure which facilitates efficient approximation via a randomized algorithm due to Jerrum and Sinclair.

DOI
10.1103/physrevlett.119.100503

Related papers

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•10 citations

Classical Ising model test for quantum circuits

Joseph Geraci, Daniel A Lidar

We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson–Seymour theorem from graph theory. We give as an example a set of quantum circuits with a small number of non-nearest-neighbor gates which admit an efficient classical simulation.

arXiv:0902.4889•New Journal of Physics•Jul 28, 2010•20 citations

On the relation between quantum computation and classical statistical mechanics

Joseph Geraci

We provide a quantum algorithm for the exact evaluation of the Potts partition function for a certain class of restricted instances of graphs that correspond to irreducible cyclic codes. We use the same approach to demonstrate that quantum computers can provide an exponential speed up over the best classical algorithms for the exact evaluation of the weight enumerator polynomial for a family of classical cyclic codes. In addition to this we also provide an efficient quantum approximation algorithm for a function (signed-Euler generating function) closely related to the Ising partition function and demonstrate that this problem is BQP-complete. \n\nWe accomplish the above for the Potts partition function by using a series of links between Gauss sums, classical coding theory, graph theory and the partition function. We exploit the fact that there exists an efficient approximation algorithm for Gauss sums and the fact that this problem is equivalent in complexity to evaluating discrete log. A theorem of McEliece allows one to turn the Gauss sum approximation into an exact evaluation of the Potts partition function. Stripping the physics from this result leaves one with the result for the weight enumerator polynomial. \n\nThe result for the approximation of the signed-Euler generating function was accomplished by fashioning a new mapping between quantum circuits and graphs. The mapping provided us with a way of relating the cycle structure of graphs with quantum circuits. Using a slight variant of this mapping, we present the final result of this thesis which presents a way of testing families of quantum circuits for their classical simulatability. We thus provide an efficient way of deciding whether a quantum circuit provides any additional computational power over classical computation and this is achieved by exploiting the fact that planar instances of the Ising partition function (with no external magnetic field) can be efficiently classically computed.

•Jan 1, 2008•0 citations

Efficient algorithms for approximating quantum partition functions

Ryan L. Mann, Tyler Helmuth

We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Netočný and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.

arXiv:2004.11568•Journal of Mathematical Physics•Feb 1, 2021•24 citations

Polynomial-time classical and quantum simulation of quantum impurity models

Jiaqing Jiang, Nathan Ju, Ojas Parekh +2 more

Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision $δ$ in time $\mathrm{poly}(n,δ^{-1})$, and (2) estimate the partition function at inverse temperature $β$ to relative precision $δ$ in time $\mathrm{poly}(n,β,δ^{-1})$, where $n$ is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.

quant-pharXiv:2610.02167•Oct 2, 2026•2 citations

A computational phase diagram for the transverse field Ising model

Thuy-Duong Vuong

We study the transverse field Ising model, defined by the Hamiltonian $H =\frac{1}{2}\sum_{i, j\in [n]} J_{ij} Z_i Z_j +\sum_{i=1}^n h_i^z Z_i + η\sum_{i} X_i$ where $J $ is the symmetric interaction matrix, and $η$ is the transverse field strength. Let $Δ(J)=λ_{\max}(J)-λ_{\min}(J)$ be the spectral width of $J.$ When the inverse temperature $β\geq0$ satisfies $Δ(J)\cdot\frac{\tanh(βη)}η\leq1$, we give a randomized classical algorithm that approximates the partition function $Z(β)=\operatorname{Tr}(e^{-βH})$ to a given relative error $ε\in(0,1)$ in time polynomial in $n$, $β$, the model parameters, and $ε^{-1}$. When $ Δ(J) \cdot \frac{\tanh(βη)}η > 1 ,$ we show that approximating $ Z(β)$ within an $\exp(o(n))$-multiplicative factor is $\textbf{NP}$-hard, and thus unlikely to admit an efficient classical or quantum algorithms under standard complexity theoretic assumptions. Furthermore, in the regime $Δ(J)\cdot \frac{\tanh(βη)}η\leq 1,$ we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ ρ_β= \frac{e^{-βH}}{\operatorname{Tr}(e^{-βH})}$ within an arbitrarily small additive error. In the special case when the observable is also diagonal in the $X$-basis, i.e. $P \in \{I, X\}^{\otimes n}$, the algorithm further achieves arbitrarily small relative error.

quant-pharXiv:2610.02079•Oct 2, 2026•1 citation
We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, system size, and inverse temperature. As a consequence, we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the partition function by the perfect matching sum of a finite graph with positive edge weights. Although the perfect matching sum is not known to be efficiently approximable in general, the graphs obtained by our method have a special structure which facilitates efficient approximation via a randomized algorithm due to Jerrum and Sinclair.
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 exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson–Seymour theorem from graph theory. We give as an example a set of quantum circuits with a small number of non-nearest-neighbor gates which admit an efficient classical simulation.
We provide a quantum algorithm for the exact evaluation of the Potts partition function for a certain class of restricted instances of graphs that correspond to irreducible cyclic codes. We use the same approach to demonstrate that quantum computers can provide an exponential speed up over the best classical algorithms for the exact evaluation of the weight enumerator polynomial for a family of classical cyclic codes. In addition to this we also provide an efficient quantum approximation algorithm for a function (signed-Euler generating function) closely related to the Ising partition function and demonstrate that this problem is BQP-complete. \n\nWe accomplish the above for the Potts partition function by using a series of links between Gauss sums, classical coding theory, graph theory and the partition function. We exploit the fact that there exists an efficient approximation algorithm for Gauss sums and the fact that this problem is equivalent in complexity to evaluating discrete log. A theorem of McEliece allows one to turn the Gauss sum approximation into an exact evaluation of the Potts partition function. Stripping the physics from this result leaves one with the result for the weight enumerator polynomial. \n\nThe result for the approximation of the signed-Euler generating function was accomplished by fashioning a new mapping between quantum circuits and graphs. The mapping provided us with a way of relating the cycle structure of graphs with quantum circuits. Using a slight variant of this mapping, we present the final result of this thesis which presents a way of testing families of quantum circuits for their classical simulatability. We thus provide an efficient way of deciding whether a quantum circuit provides any additional computational power over classical computation and this is achieved by exploiting the fact that planar instances of the Ising partition function (with no external magnetic field) can be efficiently classically computed.
Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision δδδ in time poly(n,δ−1)\mathrm{poly}(n,δ^{-1})poly(n,δ−1), and (2) estimate the partition function at inverse temperature βββ to relative precision δδδ in time poly(n,β,δ−1)\mathrm{poly}(n,β,δ^{-1})poly(n,β,δ−1), where nnn is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.
We study the transverse field Ising model, defined by the Hamiltonian H=12∑i,j∈[n]JijZiZj+∑i=1nhizZi+η∑iXiH =\frac{1}{2}\sum_{i, j\in [n]} J_{ij} Z_i Z_j +\sum_{i=1}^n h_i^z Z_i + η\sum_{i} X_iH=21​∑i,j∈[n]​Jij​Zi​Zj​+∑i=1n​hiz​Zi​+η∑i​Xi​ where $J $ is the symmetric interaction matrix, and ηηη is the transverse field strength. Let Δ(J)=λmax⁡(J)−λmin⁡(J)Δ(J)=λ_{\max}(J)-λ_{\min}(J)Δ(J)=λmax​(J)−λmin​(J) be the spectral width of J.J.J. When the inverse temperature β≥0β\geq0β≥0 satisfies Δ(J)⋅tanh⁡(βη)η≤1Δ(J)\cdot\frac{\tanh(βη)}η\leq1Δ(J)⋅ηtanh(βη)​≤1, we give a randomized classical algorithm that approximates the partition function Z(β)=Tr⁡(e−βH)Z(β)=\operatorname{Tr}(e^{-βH})Z(β)=Tr(e−βH) to a given relative error ε∈(0,1)ε\in(0,1)ε∈(0,1) in time polynomial in nnn, βββ, the model parameters, and ε−1ε^{-1}ε−1. When $ Δ(J) \cdot \frac{\tanh(βη)}η > 1 ,$ we show that approximating $ Z(β)$ within an exp⁡(o(n))\exp(o(n))exp(o(n))-multiplicative factor is NP\textbf{NP}NP-hard, and thus unlikely to admit an efficient classical or quantum algorithms under standard complexity theoretic assumptions. Furthermore, in the regime Δ(J)⋅tanh⁡(βη)η≤1,Δ(J)\cdot \frac{\tanh(βη)}η\leq 1,Δ(J)⋅ηtanh(βη)​≤1, we provide an efficient randomized classical algorithm that approximates Pauli string observables of the Gibbs state $ ρ_β= \frac{e^{-βH}}{\operatorname{Tr}(e^{-βH})}$ within an arbitrarily small additive error. In the special case when the observable is also diagonal in the XXX-basis, i.e. P∈{I,X}⊗nP \in \{I, X\}^{\otimes n}P∈{I,X}⊗n, the algorithm further achieves arbitrarily small relative error.