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

Communications in Mathematical Physics

Classical bounds on quantum partition functions

Bernhard Baumgartner

Published Jul 1, 1980• 5 citations
Publisher
DOI
10.1007/bf01962589

Related papers

The classical limit of quantum partition functions

Barry Simon

Communications in Mathematical Physics•Oct 1, 1980•155 citations

The partition function in the quantum-to-classical transition

Bingyu Cui

arXiv:2503.06152•Physics Letters A•Nov 24, 2025•1 citation

Classical and Quantum Partition Bound and Detector Inefficiency

Sophie Laplante, Virginie Lerays, Jérémie Roland

arXiv:1203.4155•Lecture notes in computer science•Jan 1, 2012•15 citations

D-component rotators as the classical limit of quantum SO(D) vector models

Filippo Cesi

The author considers a class of spin systems whose single-site configuration space is an orbit of a representation of a compact Lie group G. For these models the author gets upper and lower bounds to the quantum partition function in terms of two classical partition functions. If a certain group-theoretic condition is satisfied, then these bounds allow one to prove the convergence of a suitable sequence of quantum partition functions to the 'corresponding' classical one. This condition is shown to be satisfied, in particular, for the D-component rotators when D is odd. The result could be useful for the extension of the Lee-Yang theorem to such models.

Journal of Physics A Mathematical and General•Jun 21, 1990•1 citation

Commuting quantum circuits and complexity of Ising partition functions

Keisuke Fujii, Tomoyuki Morimae

Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy collapses to the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of calculating the imaginary-valued partition functions of Ising models. We apply the established relationship in two opposite directions. One direction is to find subclasses of IQP that are classically efficiently simulatable by using exact solvability of certain types of Ising models. Another direction is applying quantum computational complexity of IQP to investigate (im)possibility of efficient classical approximations of Ising partition functions with imaginary coupling constants. Specifically, we show that a multiplicative approximation of Ising partition functions is #P-hard for almost all imaginary coupling constants even on planar lattices of a bounded degree.

arXiv:1311.2128•New Journal of Physics•Feb 10, 2017•62 citations

Quantum corrections for general partition functions

L.R. Evangelista, Luís Carlos Malacarne, R.S. Mendes

arXiv:cond-mat/9804094•Physica A Statistical Mechanics and its Applications•May 1, 1998•8 citations
The author considers a class of spin systems whose single-site configuration space is an orbit of a representation of a compact Lie group G. For these models the author gets upper and lower bounds to the quantum partition function in terms of two classical partition functions. If a certain group-theoretic condition is satisfied, then these bounds allow one to prove the convergence of a suitable sequence of quantum partition functions to the 'corresponding' classical one. This condition is shown to be satisfied, in particular, for the D-component rotators when D is odd. The result could be useful for the extension of the Lee-Yang theorem to such models.
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal. Nevertheless, it has been shown that if there is a classical algorithm that can simulate IQP efficiently, the polynomial hierarchy collapses to the third level, which is highly implausible. However, the origin of the classical intractability is still less understood. Here we establish a relationship between IQP and computational complexity of calculating the imaginary-valued partition functions of Ising models. We apply the established relationship in two opposite directions. One direction is to find subclasses of IQP that are classically efficiently simulatable by using exact solvability of certain types of Ising models. Another direction is applying quantum computational complexity of IQP to investigate (im)possibility of efficient classical approximations of Ising partition functions with imaginary coupling constants. Specifically, we show that a multiplicative approximation of Ising partition functions is #P-hard for almost all imaginary coupling constants even on planar lattices of a bounded degree.