Faster Quantum Monte Carlo Simulation by Random Compilation

• URL: http://arxiv.org/abs/2609.10486v1
• Date: Wed, 09 Sep 2026 17:25:26 GMT
• Title: Faster Quantum Monte Carlo Simulation by Random Compilation
• Abstract summary: Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems.<n>We introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses systematic errors by averaging over a family of approximations.<n>Our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy.
• Score: 2.9903776166764984
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.

Related papers

• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits [72.41778531863143]
  We use path integral techniques to predict the switching rate in a single-mode bistable open quantum system.<n>Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.
  arXiv  Detail & Related papers  (2025-07-24T18:01:36Z)
• Quantum-assisted variational Monte Carlo [1.283555556182245]
  We introduce a quantum-assisted variational Monte Carlo (QA-VMC) algorithm for solving the ground state of quantum many-body systems.<n>We demonstrate that the quantum-assisted proposal exhibits larger absolute spectral gaps and reduced autocorrelation times compared to conventional classical proposals.
  arXiv  Detail & Related papers  (2025-02-28T07:31:38Z)
• Fighting noise with noise: a stochastic projective quantum eigensolver [0.0]
  We present a novel approach to estimating physical observables which leads to a two order of magnitude reduction in the required sampling of the quantum state. The method can be applied to excited-state calculations and simulation for general chemistry on quantum devices.
  arXiv  Detail & Related papers  (2023-06-26T09:22:06Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution [44.99833362998488]
  We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate quantum systems classically. We prove that the most used scheme, the time-dependent Variational Monte Carlo (tVMC), is affected by a systematic statistical bias. We show that a different scheme based on the solution of an optimization problem at each time step is free from such problems.
  arXiv  Detail & Related papers  (2023-05-23T17:38:10Z)
• A Survey of Quantum Alternatives to Randomized Algorithms: Monte Carlo Integration and Beyond [7.060988518771793]
  We focus on the potential to obtain a quantum advantage in the computational speed of Monte Carlo procedures using quantum circuits. We revisit the quantum algorithms that could replace classical Monte Carlo and then consider both the existing quantum algorithms and the potential quantum realizations.
  arXiv  Detail & Related papers  (2023-03-08T23:39:49Z)
• 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-assisted Monte Carlo algorithms for fermions [5.625946422295428]
  We propose a family of scalable quantum-assisted Monte Carlo algorithms where the quantum computer is used at its minimal cost. We show that the hybrid Monte Carlo framework is a general way to suppress errors in the ground state obtained from classical algorithms.
  arXiv  Detail & Related papers  (2022-05-30T07:49:22Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.