Monte Carlo simulation of random circuit sampling in quantum computing

• URL: http://arxiv.org/abs/2509.04401v1
• Date: Thu, 04 Sep 2025 17:12:19 GMT
• Title: Monte Carlo simulation of random circuit sampling in quantum computing
• Authors: Andreas Raab,
• Abstract summary: We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems.<n>We derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We apply these functions in importance sampling algorithms and demonstrate efficiency for qubit systems with 70, 105, 1000, and more than one million ($2^{20}$) qubits. In particular, we simulate the output of recent quantum computations without noise on a PC with minimal computational cost. I would therefore argue that random circuit sampling can be conveniently performed on classical computers.

Related papers

• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Counting collisions in random circuit sampling for benchmarking quantum computers [0.7252027234425332]
  We show that counting the number of collisions when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer.<n>We show that this quantity, if properly normalized, can be used as a "collision anomaly" benchmark or as a "collision volume" test.
  arXiv  Detail & Related papers  (2023-12-07T11:12:30Z)
• 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)
• 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)
• A quantum spectral method for simulating stochastic processes, with applications to Monte Carlo [4.134846879110833]
  We introduce a new analog'' quantum representation of processes, in which the value of the process at time t is stored in the amplitude of the quantum state. We show that we can simulate $T$ timesteps of fractional Brownian motion using a quantum circuit with gate complexity $textpolylog(T)$, which coherently prepares the superposition over Brownian paths. We then show this can be combined with quantum mean estimation to create end to end algorithms for estimating certain time averages over processes in time $O(textpolylog(Tepsilon
  arXiv  Detail & Related papers  (2023-03-12T17:54:38Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Classical Sampling of Random Quantum Circuits with Bounded Fidelity [0.5735035463793007]
  We present a classical sampling algorithm for producing the probability distribution of any given random quantum circuit. We classically produced 1 million samples with the fidelity bounded by 0.2%, based on the 20-cycle circuit of the Sycamore 53-qubit quantum chip. We estimate that for the Zuchongzhi 56-qubit 20-cycle circuit one can produce 1M samples with fidelity 0.066% using the Selene supercomputer.
  arXiv  Detail & Related papers  (2021-12-30T14:51:39Z)
• 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)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Probabilistic computing with p-bits [0.028554857235549746]
  We make the case for a probabilistic computer based on p-bits, which take on values 0 and 1 with controlled probabilities. We propose a generic architecture for such p-computers and emulate systems with thousands of p-bits to show that they can significantly accelerate randomized algorithms.
  arXiv  Detail & Related papers  (2021-08-22T20:50:01Z)
• 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.