Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations

• URL: http://arxiv.org/abs/2403.08642v5
• Date: Wed, 30 Oct 2024 12:33:06 GMT
• Title: Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations
• Authors: Yi-Ming Ding, Jun-Song Sun, Nvsen Ma, Gaopei Pan, Chen Cheng, Zheng Yan,
• Abstract summary: We present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on computer.
• Score: 4.595034707642593
• License:
• Abstract: Efficient and accurate algorithm for partition function, free energy and thermal entropy calculations is of great significance in statistical physics and quantum many-body physics. Here we present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. Compared with the conventional specific heat integral method and Wang-Landau sampling algorithm, our method can obtain a much more accurate result of the sub-leading coefficient of the entropy. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on computer.

Related papers

• Asymptotically Optimal Change Detection for Unnormalized Pre- and Post-Change Distributions [65.38208224389027]
  This paper addresses the problem of detecting changes when only unnormalized pre- and post-change distributions are accessible. Our approach is based on the estimation of the Cumulative Sum statistics, which is known to produce optimal performance.
  arXiv  Detail & Related papers  (2024-10-18T17:13:29Z)
• Hybrid Quantum Algorithm for Simulating Real-Time Thermal Correlation Functions [0.0]
  We present a hybrid Path Integral Monte Carlo (hPIMC) algorithm to calculate real-time quantum thermal correlation functions. We show that the component of imaginary-time evolution can be performed accurately using the recently developed Probabilistic Imaginary-Time Evolution (PITE) algorithm.
  arXiv  Detail & Related papers  (2024-05-30T01:30:13Z)
• Non-equilibrium quantum Monte Carlo algorithm for stabilizer Renyi entropy in spin systems [0.552480439325792]
  Quantum magic, or nonstabilizerness, provides a crucial characterization of quantum systems. We propose a novel and efficient algorithm for computing stabilizer R'enyi entropy, one of the measures for quantum magic, in spin systems with sign-problem free Hamiltonians.
  arXiv  Detail & Related papers  (2024-05-29T23:59:02Z)
• An integral algorithm of exponential observables for interacting fermions in quantum Monte Carlo simulation [7.826326818086168]
  Exponential observables, formulated as $log langle ehatXrangle$ where $hatX$ is an extensive quantity, play a critical role in study of quantum many-body systems. We propose a comprehensive algorithm for quantifying these observables in interacting fermion systems.
  arXiv  Detail & Related papers  (2023-11-06T19:00:04Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
  We propose a Monte Carlo PDE solver for training unsupervised neural solvers. We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles. Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-02-10T08:05:19Z)
• Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal [0.0]
  We apply notions of emulation to Variational Quantum Annealing and the Quantum Approximate Algorithm Optimization (QAOA) Our Variational Quantum Annealing schedule is based on a novel parameterization that can be optimized in a similar gradient-free way as QAOA, using the same physical ingredients. In order to compare the performance of ans"atze types, we have developed statistical notions of Monte-Carlo methods.
  arXiv  Detail & Related papers  (2022-11-24T19:02:50Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Algorithms for quantum simulation at finite energies [0.7734726150561088]
  We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy. The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
  arXiv  Detail & Related papers  (2020-06-04T17:40:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.