A Quantum Adaptive Importance Sampling Algorithm for Multidimensional Integration

This work presents Quantum Adaptive Importance Sampling (QAIS), a hybrid quantum-classical algorithmic workflow that performs Monte Carlo numerical integration of multivariate functions. This workflow extends standard Importance Sampling to a quantum computational system. Its primary purpose is to produce an unbiased estimate of integrals, with a limited number of measurements. By using the exponentially sized Hilbert space of a Parameterized Quantum Circuit (PQC), we manipulate the Probability Density Function (PDF) over a grid in its entirety. With adequate expressivity and entanglement, we effectively capture correlations among different integrand variables, thus bypassing the separable PDF assumption, as implemented in VEGAS. By optimizing the PQC, we adapt and ultimately load a PDF that approximates the integrand's behavior. Direct sampling from it, allocates samples to the important regions, allowing a highly accurate integral estimation. As an application, we study a benchmark two-dimensional integral, and compare the precision of the best grid of VEGAS against that of the quantum-generated proposal PDF, as a function of the number of samples.

Authors

Publication Details

Published
2025-12-08
DOI
https://doi.org/10.22323/1.485.0638
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Quantum Adaptive Importance Sampling Algorithm for Multidimensional Integration

Konstantinos Pyretzidis
Quantum Computing Algorithms and Architecture
article

A Quantum Adaptive Importance Sampling Algorithm for Multidimensional Integration

Konstantinos Pyretzidis
article en

Abstract

This work presents Quantum Adaptive Importance Sampling (QAIS), a hybrid quantum-classical algorithmic workflow that performs Monte Carlo numerical integration of multivariate functions. This workflow extends standard Importance Sampling to a quantum computational system. Its primary purpose is to produce an unbiased estimate of integrals, with a limited number of measurements. By using the exponentially sized Hilbert space of a Parameterized Quantum Circuit (PQC), we manipulate the Probability Density Function (PDF) over a grid in its entirety. With adequate expressivity and entanglement, we effectively capture correlations among different integrand variables, thus bypassing the separable PDF assumption, as implemented in VEGAS. By optimizing the PQC, we adapt and ultimately load a PDF that approximates the integrand's behavior. Direct sampling from it, allocates samples to the important regions, allowing a highly accurate integral estimation. As an application, we study a benchmark two-dimensional integral, and compare the precision of the best grid of VEGAS against that of the quantum-generated proposal PDF, as a function of the number of samples.

Ministerio de Ciencia, Innovación y Universidades, Generalitat Valenciana, European Regional Development Fund, Agencia Estatal de Investigación
Openalex Percentile: Top 79%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Quantum Adaptive Importance Sampling Algorithm for Multidimensional Integration — Konstantinos Pyretzidis · (2025) | TGRS Research Map | TGRS