Quantum Fourier Iterative Amplitude Estimation

• URL: http://arxiv.org/abs/2305.01686v2
• Date: Wed, 13 Sep 2023 18:26:19 GMT
• Title: Quantum Fourier Iterative Amplitude Estimation
• Authors: Jorge J. Mart\'inez de Lejarza, Michele Grossi, Leandro Cieri and Germ\'an Rodrigo
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Monte Carlo integration is a widely used numerical method for approximating integrals, which is often computationally expensive. In recent years, quantum computing has shown promise for speeding up Monte Carlo integration, and several quantum algorithms have been proposed to achieve this goal. In this paper, we present an application of Quantum Machine Learning (QML) and Grover's amplification algorithm to build a new tool for estimating Monte Carlo integrals. Our method, which we call Quantum Fourier Iterative Amplitude Estimation (QFIAE), decomposes the target function into its Fourier series using a Parametrized Quantum Circuit (PQC), specifically a Quantum Neural Network (QNN), and then integrates each trigonometric component using Iterative Quantum Amplitude Estimation (IQAE). This approach builds on Fourier Quantum Monte Carlo Integration (FQMCI) method, which also decomposes the target function into its Fourier series, but QFIAE avoids the need for numerical integration of Fourier coefficients. This approach reduces the computational load while maintaining the quadratic speedup achieved by IQAE. To evaluate the performance of QFIAE, we apply it to a test function that corresponds with a particle physics scattering process and compare its accuracy with other quantum integration methods and the analytic result. Our results show that QFIAE achieves comparable accuracy while being suitable for execution on real hardware. We also demonstrate how the accuracy of QFIAE improves by increasing the number of terms in the Fourier series. In conclusion, QFIAE is a promising end-to-end quantum algorithm for Monte Carlo integrals that combines the power of PQC with Fourier analysis and IQAE to offer a new approach for efficiently approximating integrals with high accuracy.

Related papers

• Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
  We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-10-18T10:30:14Z)
• Quantum Monte Carlo Integration for Simulation-Based Optimisation [34.96100129498306]
  We investigate the feasibility of integrating quantum algorithms as subroutines of simulation-based optimisation problems. We conduct a thorough analysis of all systematic errors arising in the formulation of quantum Monte Carlo integration. We study the applicability of quantum Monte Carlo integration for fundamental financial use cases.
  arXiv  Detail & Related papers  (2024-10-04T21:05:32Z)
• Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials [34.63047229430798]
  This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones.
  arXiv  Detail & Related papers  (2024-04-03T06:53:48Z)
• Loop Feynman integration on a quantum computer [0.0]
  We numerically evaluate for the first time loop Feynman integrals in a near-term quantum computer and a quantum simulator. QFIAE introduces a Quantum Neural Network (QNN) that efficiently decomposes the multidimensional integrand into its Fourier series.
  arXiv  Detail & Related papers  (2024-01-05T19:00:04Z)
• Federated Quantum Long Short-term Memory (FedQLSTM) [58.50321380769256]
  Quantum federated learning (QFL) can facilitate collaborative learning across multiple clients using quantum machine learning (QML) models. No prior work has focused on developing a QFL framework that utilizes temporal data to approximate functions. A novel QFL framework that is the first to integrate quantum long short-term memory (QLSTM) models with temporal data is proposed.
  arXiv  Detail & Related papers  (2023-12-21T21:40:47Z)
• 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)
• 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)
• QuEst: Graph Transformer for Quantum Circuit Reliability Estimation [32.89844497610906]
  Python library called TorchQuantum can construct, simulate, and train PQC for machine learning tasks. We propose to leverage a graph transformer model to predict noise impact on circuit fidelity. Compared with circuit simulators, the predictor has over 200X speedup for estimating the fidelity.
  arXiv  Detail & Related papers  (2022-10-30T02:35:31Z)
• Gibbs Sampling of Continuous Potentials on a Quantum Computer [0.0]
  We build a quantum algorithm for Gibbs sampling from periodic real-valued functions. Our algorithm makes zeroeth order queries to a quantum oracle of the function.
  arXiv  Detail & Related papers  (2022-10-14T20:56:44Z)
• Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis [0.0]
  We show how universal quantum computers can handle mathematical analysis calculations for functions with continuous domains. The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables. By combining this encoding with quantum state tomography, a variational quantum circuit of $n$ qubits can optimize functions of up to $3n$ continuous variables.
  arXiv  Detail & Related papers  (2022-10-06T18:00: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.