We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space dimension and alpha < 1/2 is proportional to the Helmholtz free energy density of the system. We also derive an algorithm to evaluate the partition function of a quantum system in a time proportional to the system's thermalization time and inversely proportional to the targeted accuracy squared.
The Gibbs partition function is an important quantity in describing statistical properties of a system in thermodynamic equilibrium. There are several proposals to calculate the partition functions on near-team quantum computers. However, the existing schemes require many copies of the Gibbs states to perform an extrapolation for the calculation of the partition function, and these could be costly performed on the near-term quantum computers. Here, we propose an efficient scheme to calculate the Gibbs function with the imaginary time evolution. To calculate the Gibbs function of $N$ qubits, on…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its calculation generally involves summing over an exponential number of terms and can thus quickly grow to be intractable. Accurately and efficiently estimating the partition function of its corresponding system Hamiltonian then becomes the key in solving quantum many-body problems. In this paper we develop a hybrid quantum-classical algorithm to estimate the p…
We present classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Our work has two main contributions: first, we modify the classical algorithm of Štefankovič, Vempala and Vigoda (\emph{J.~ACM}, 56(3), 2009) to improve its sample complexity; second, we quantize this new algorithm, improving upon the previously fastest quantum algorithm for this problem, due to Harrow and Wei (SODA 2020). The conventional approach to estimating partition functions requires approximating the means of Gibbs distributions at a set of inverse tempera…
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 fu…
We discuss partition function of 2d CFTs decorated by higher qKdV charges in the thermodynamic limit when the size of the spatial circle goes to infinity. In this limit the saddle point approximation is exact and at infinite central charge generalized partition function can be calculated explicitly. We show that leading 1/c corrections to free energy can be reformulated as a sum over Young tableaux which we calculate for the first two qKdV charges. Next, we compare generalized ensemble with the "eigenstate ensemble" that consists of a single primary state. At infinite central charge the ensemb…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N β/{\cal Z}}$ and polynomial in $\log(1/ε)$, where $N$ is the Hilbert space dimension, $β$ is the inverse temperature, ${\cal Z}$ is the partition function, and $ε$ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on $1/ε$ and quadratically improves the dependence on $β$ of known quantum algorithms for this problem. The second algorithm es…
Quantum Algorithms for Gibbs Expectation of Non-log-concave and Heavy-tailed Distributions
Yau Mathematical Sciences Center, Tsinghua University（清华大学丘成桐数学科学中心）；Qiuzhen College, Tsinghua University（清华大学求真学院）；Beijing Institute of Mathematical Sciences and Applications（北京国际数学研究中心）
Schrödinger suggested that thermodynamical functions cannot be based on the gratuitous allegation that quantum-mechanical levels (typically the orthogonal eigenstates of the Hamiltonian operator) are the only allowed states for a quantum system [E. Schrödinger, Statistical Thermodynamics (Courier Dover, Mineola, 1967)]. Different authors have interpreted this statement by introducing density distributions on the space of quantum pure states with weights obtained as functions of the expectation value of the Hamiltonian of the system. In this work we focus on one of the best known of these distr…
In a recent work [10], Poulin and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grovers's technique for quantum state engineering, and its running time is dominated by the factor D/Z(β), where D and Z(β) denote the dimension of the quantum system and its partition function at inverse temperature β, respectively. We present here a modified algorithm and a more detailed analysis of the errors that arise due to imperfect simulation of Hamiltonian time evolutions and limited performance of phase estimation (fin…
Optimal quantum algorithm for Gibbs state preparation
Inria, Télécom Paris - LTCI, Institut Polytechnique de Paris（法国国家信息与自动化研究所，巴黎电信学院-信息与通信实验室，巴黎理工学院）；Univ Lyon, ENS Lyon, UCBL, CNRS, Inria, LIP（里昂大学，里昂高等师范学院，里昂第一大学，法国国家科学研究中心，法国国家信息与自动化研究所，信息处理实验室）；Department of Mathematical Sciences, University of Copenhagen（哥本哈根大学数学科学系）；Instituto de Física Téorica UAM/CSIC（马德里自治大学/西班牙高等科学研究理事会理论物理研究所）
We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum computations as evaluations of classical partition functions. These results rely on interesting and deep results about quantum computation in order to obtain hardness results about the difficulty of (classically) evaluating the partition functions for certain fixed parameters. The motivation for this paper is to study more comprehensively the com…
University of Waterloo（滑铁卢大学）；Perimeter Institute for Theoretical Physics（圆周理论物理研究所）；IBM Research（IBM研究院）；RIKEN（理化学研究所）
We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied question in machine learning and statistics. In this work, we give the first sample-efficient algorithm for the quantum Hamiltonian learning problem. In particular, we prove that polynomially many samples in the number of particles (qudits) are necessary and sufficient for learning the parameters of a spatially local Hamiltonian in l_2-norm. Our main contribu…
The fundamentals of Statistical Mechanics require a fresh definition in the context of the developments in Classical Mechanics of integrable and chaotic systems. This is done with the introduction of Micro Partitions ; a union of disjoint components in phase space. Partition functions including the invariants, Kolmogorov Entropy and Euler number are introduced. The ergodic hypothesis for partial ergodicity is discussed. In the context of Quantum Mechanics the presence of symmetry groups with irreducible representations gives rise to degenerate and non degenerate spectrum for the Hamiltonian. Q…
