Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth

• URL: http://arxiv.org/abs/2105.09100v4
• Date: Tue, 27 Sep 2022 10:02:46 GMT
• Title: Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth
• Authors: Steven Herbert
• Abstract summary: The heart of the proposed method is a series decomposition of the sum that approximates the expectation in Monte Carlo integration. No previous proposal for quantum Monte Carlo integration has achieved all of these at once.
• Score: 0.8122270502556371
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This paper proposes a method of quantum Monte Carlo integration that retains the full quadratic quantum advantage, without requiring any arithmetic or quantum phase estimation to be performed on the quantum computer. No previous proposal for quantum Monte Carlo integration has achieved all of these at once. The heart of the proposed method is a Fourier series decomposition of the sum that approximates the expectation in Monte Carlo integration, with each component then estimated individually using quantum amplitude estimation. The main result is presented as theoretical statement of asymptotic advantage, and numerical results are also included to illustrate the practical benefits of the proposed method. The method presented in this paper is the subject of a patent application [Quantum Computing System and Method: Patent application GB2102902.0 and SE2130060-3].

Related papers

• Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations [4.595034707642593]
  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.
  arXiv  Detail & Related papers  (2024-03-13T15:54:57Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum Fourier Iterative Amplitude Estimation [0.0]
  We present Quantum Fourier Iterative Amplitude Estimation (QFIAE) to build a new tool for estimating Monte Carlo integrals. QFIAE decomposes the target function into its Fourier series using a Parametrized Quantum Circuit (PQC) and a Quantum Neural Network (QNN) We show that QFIAE achieves comparable accuracy while being suitable for execution on real hardware.
  arXiv  Detail & Related papers  (2023-05-02T18:00:05Z)
• 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)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• 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 circuits for the preparation of spin eigenfunctions on quantum computers [63.52264764099532]
  Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions. This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
  arXiv  Detail & Related papers  (2022-02-19T00:21:46Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Quantum Speedup of Monte Carlo Integration with respect to the Number of Dimensions and its Application to Finance [0.0]
  In Monte Carlo integration, many random numbers are used for calculation of the integrand. In this paper, we point out that we can reduce the number of such repeated operations by a combination of the nested QAE and the use of pseudorandom numbers. We pick up one use case of this method in finance, the credit portfolio risk measurement, and estimate to what extent the complexity is reduced.
  arXiv  Detail & Related papers  (2020-11-04T07:40:20Z)

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.