From quantum enhanced to quantum inspired Monte Carlo

• URL: http://arxiv.org/abs/2411.17821v1
• Date: Tue, 26 Nov 2024 19:02:21 GMT
• Title: From quantum enhanced to quantum inspired Monte Carlo
• Authors: Johannes Christmann, Petr Ivashkov, Mattia Chiurco, Guglielmo Mazzola,
• Abstract summary: We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023). We observe an optimal mixing Hamiltonian strength and analyze the scaling of the total evolution time with the size of the system. We propose that classical, approximate quantum simulators can be used for the proposal step instead of the original real- hardware implementation.
• Score: 0.0
• License:
• Abstract: We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the scaling of the total evolution time with the size of the system. We also explore extensions of the circuit, including the use of time-dependent Hamiltonians and reverse digitized annealing. Additionally, we propose that classical, approximate quantum simulators can be used for the proposal step instead of the original real-hardware implementation. We observe that tensor-network simulators, even with unconverged settings, can maintain a scaling advantage over standard classical samplers. This may extend the utility of quantum enhanced Monte Carlo as a quantum-inspired algorithm, even before the deployment of large-scale quantum hardware.

Related papers

• Efficient quantum-enhanced classical simulation for patches of quantum landscapes [0.0]
  We show that it is always possible to generate a classical surrogate of a sub-region of an expectation landscape produced by a parameterized quantum circuit. We provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum device, allows one to classically simulate approximate expectation values of a subregion of a landscape.
  arXiv  Detail & Related papers  (2024-11-29T18:00:07Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Dynamical Hamiltonian Monte Carlo [0.0]
  A ubiquitous problem in machine learning is sampling from probability distributions that we only have access to via their log probability. We extend the well-known Hamiltonian Monte Carlo (HMC) method for Chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner.
  arXiv  Detail & Related papers  (2024-03-04T07:08:23Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Classically optimized Hamiltonian simulation [0.0]
  Hamiltonian simulation is a promising application for quantum computers. We show that, compared to Trotter product formulas, the classically optimized circuits can be orders of magnitude more accurate.
  arXiv  Detail & Related papers  (2022-05-23T16:14:43Z)
• Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers [0.0]
  We show that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches. For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $1013$ projective measurements.
  arXiv  Detail & Related papers  (2022-05-18T20:23:12Z)
• 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)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)

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.