Unlocking Multi-Dimensional Integration with Quantum Adaptive Importance Sampling

• URL: http://arxiv.org/abs/2506.19965v2
• Date: Fri, 25 Jul 2025 14:03:25 GMT
• Title: Unlocking Multi-Dimensional Integration with Quantum Adaptive Importance Sampling
• Authors: Konstantinos Pyretzidis, Jorge J. Martínez de Lejarza, Germán Rodrigo,
• Abstract summary: We introduce a quantum algorithm that performs Quantum Adaptive Importance Sampling (QAIS) for Monte Carlo integration of multidimensional functions.<n>As an application, we look at a very sharply peaked loop Feynman integral and at multi-modal benchmark integrals.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a quantum algorithm that performs Quantum Adaptive Importance Sampling (QAIS) for Monte Carlo integration of multidimensional functions, targeting in particular the computational challenges of high-energy physics. In this domain, the fundamental ingredients for theoretical predictions such as multiloop Feynman diagrams and the phase-space require evaluating high-dimensional integrals that are computationally demanding due to divergences and complex mathematical structures. The established method of Adaptive Importance Sampling, as implemented in tools like VEGAS, uses a grid-based approach that is iteratively refined in a separable way, per dimension. This separable approach efficiently suppresses the exponentially growing grid-handling computational cost, but also introduces performance drawbacks whenever strong inter-variable correlations are present. To utilize sampling resources more efficiently, QAIS exploits the exponentially large Hilbert space of a Parameterised Quantum Circuit (PQC) to manipulate a non-separable Probability Density Function (PDF) defined on a multidimensional grid. In this setting, entanglement within the PQC captures the correlations and intricacies of the target integrand's structure. Performing measurements on the PQC determines the sample allocation across the multidimensional grid. This focuses samples in the small subspace where the important structures of the target integrand lie, and thus generates very precise integral estimations. As an application, we look at a very sharply peaked loop Feynman integral and at multi-modal benchmark integrals.

Related papers

• The Integral Decimation Method for Quantum Dynamics and Statistical Mechanics [44.99833362998488]
  We present a method to numerically evaluate functional integrals called integral decimation (ID)<n>ID enables high-accuracy simulations of quantum dynamics in systems as large as a 40-site chain.
  arXiv  Detail & Related papers  (2025-06-12T22:26:12Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Tensor Cross Interpolation of Purities in Quantum Many-Body Systems [0.0]
  In quantum many-body systems the exponential scaling of the Hilbert space with the number of degrees of freedom renders a complete state characterization.<n>Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed.<n>In this work, we demonstrate that the entanglement feature can be efficiently defining using only a amount of samples in the number of degrees of freedom.
  arXiv  Detail & Related papers  (2025-03-21T15:33:00Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Harmonic Path Integral Diffusion [0.4527270266697462]
  We present a novel approach for sampling from a continuous multivariate probability distribution, which may either be explicitly known (up to a normalization factor) or represented via empirical samples. Our method constructs a time-dependent bridge from a delta function centered at the origin of the state space at $t=0$, transforming it into the target distribution at $t=1$. We contrast these algorithms with other sampling methods, particularly simulated and path integral sampling, highlighting their advantages in terms of analytical control, accuracy, and computational efficiency.
  arXiv  Detail & Related papers  (2024-09-23T16:20:21Z)
• Federated Conditional Stochastic Optimization [110.513884892319]
  Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML. This paper proposes algorithms for distributed federated learning.
  arXiv  Detail & Related papers  (2023-10-04T01:47:37Z)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications [43.48388050033774]
  This paper provides a comprehensive analysis of a simple algorithm for both non- and convex objectives. Our analysis also exhibits new insights for improving the practical implementation by sampling batches of equal size for the outer and inner levels.
  arXiv  Detail & Related papers  (2022-02-24T22:39:35Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Adaptive variational quantum eigensolvers for highly excited states [4.038971004196936]
  Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization. We propose an adaptive variational algorithm, adaptive VQE-X, that self-generates a variational ansatz for arbitrary eigenstates of a many-body Hamiltonian $H$.
  arXiv  Detail & Related papers  (2021-04-26T15:03:51Z)
• 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)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Quantum-enhanced analysis of discrete stochastic processes [0.8057006406834467]
  We propose a quantum algorithm for calculating the characteristic function of a Discrete processes (DSP) It completely defines its probability distribution, using the number of quantum circuit elements that grows only linearly with the number of time steps. The algorithm takes all trajectories into account and hence eliminates the need of importance sampling.
  arXiv  Detail & Related papers  (2020-08-14T16:07:35Z)

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.