Paper: arXiv 2509.18614

Authors: Jose Blanchet, Mark S. Squillante, Mario Szegedy, Guanyang Wang

Abstract

This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. We outline the basics of quantum computing using Grover’s algorithm for unstructured search to build intuition. We then move slowly to amplitude estimation problems and applications to counting and Monte Carlo integration, again using Grover-type iterations. A hands-on Python/Qiskit implementation illustrates these concepts applied to finance. The paper concludes with a discussion on current challenges in scaling quantum simulation techniques.

Complexity vs Empirical Score

  • Math Complexity: 6.5/10
  • Empirical Rigor: 4.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper discusses advanced quantum algorithms like amplitude estimation and error correction with substantial mathematical formalism, but the implementation is a proof-of-concept tutorial (Python/Qiskit) without backtests or large-scale data, placing it in the lab research domain.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Bridge Quantum & Classical<br>Monte Carlo"] --> B["Data/Inputs:<br>Financial Payoff Functions<br>(e.g., Option Pricing)"]
  B --> C["Methodology:<br>Grover's Algorithm<br>(Unstructured Search)"]
  C --> D["Computational Process:<br>Amplitude Estimation<br>(Phase Estimation on Grover)"]
  D --> E["Output:<br>Quantum Monte Carlo<br>Integration"]
  E --> F["Implementation:<br>Python/Qiskit Simulation"]
  F --> G["Key Findings:<br>Potential Speedup &<br>Current Scaling Challenges"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes quantum approaches to Monte Carlo computation, including quantum amplitude estimation and quantum‑accelerated multilevel Monte Carlo, illustrated with a financial example and a credit risk case study using Qiskit.

Source sentence
This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. Quantum-Accelerated Monte Carlo General Monte Carlo Methods Extends QAE to estimate the expected value of a general function, E[f(X)].

Assumes 3

  • A uniform superposition over the search space has been prepared. model
    Source sentence
    Once again, we assume that the uniform superposition has been applied.
  • k distinguished elements are marked in the basis, represented by ω. model
    Source sentence
    Then, we assume that k distinguished elements are marked in the basis; as before, they altogether are represented by ω, which leads to |s⟩= 1 √ N N ∑ x=1 |x⟩= sinϕ |ω⟩+cosϕ |s′⟩.
  • The Gaussian conditional independence model can be encoded with a finite number of qubits. model
    Source sentence
    We use nz qubits to encode a discretized Gaussian variable Z, and allocate one qubit for each Xi.

Data

  • Synthetic Gaussian Conditional Independence (GCI) model synthetic unknown
    Source sentence
    We use nz qubits to encode a discretized Gaussian variable Z, and allocate one qubit for each Xi. For example, we set nz = 4, and the truncation threshold between −3 to 3 for the discretized Gaussian.

Costs

Not applicable The paper reports no trading or execution result.

Finds 3

  • Quantum Monte Carlo methods provide a quadratic speedup over classical Monte Carlo, allowing comparable accuracy with far fewer samples. theoretical
    Source sentence
    The quadratic speedup of quantum approaches to Monte Carlo makes it possible to achieve comparable accuracy with far fewer samples. In such cases, quantum approaches to Monte Carlo (Montanaro 2015) can provide a quadratic speedup over Blanchet, Squillante, Szegedy, and Wang classical Monte Carlo approaches.
  • Quantum‑accelerated multilevel Monte Carlo can reduce the required number of samples, with speedup ranging from quadratic to sub‑quadratic depending on problem structure. theoretical
    Source sentence
    The degree of speedup ranges from quadratic to sub-quadratic, depending on the structure of the problem.
  • A quantum‑inside‑quantum algorithm achieves quantum‑optimal complexity ˜O(1/ε) for nested Monte Carlo problems, improving on the classical O(1/ε²) rate. theoretical
    Source sentence
    In contrast, the quantum-inside-quantum algorithm introduced by Blanchet et al. (2025) achieves the quantum-optimal complexity of ˜O(1/ε).

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 23 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (47)

  1. Quadratic Speed-up in Infinite Variance Quantum Monte Carlo (2024) — link
  2. Contextual Stochastic Bilevel Optimization (2023) — link
  3. Quantum computing for finance (2023) — link
  4. Near-optimal Quantum algorithms for multivariate mean estimation (2021) — link
  5. Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance (2020) — link
  6. Iterative quantum amplitude estimation (2019) — link
  7. Quantum Approximate Counting, Simplified (2019) — link
  8. Credit Risk Analysis Using Quantum Computers (2019) — link
and 39 more
  1. Amplitude estimation without phase estimation (2019) — link
  2. Quantum computing for finance: Overview and prospects (2018) — link
  3. Quantum risk analysis (2018) — link
  4. Error mitigation extends the computational reach of a noisy quantum processor (2018) — link
  5. Quantum computational finance: Monte Carlo pricing of financial derivatives (2018) — link
  6. Decision-making under uncertainty: using MLMC for efficient estimation of EVPPI (2017) — link
  7. Unbiased Monte Carlo for optimization and functions of expectations via multi-level randomization (2015) — link
  8. Unbiased Estimation with Square Root Convergence for SDE Models (2015) — link
  9. Quantum speedup of Monte Carlo methods (2015) — link
  10. Quantum Computing: Lecture Notes (2015) — link
  11. REGULATORY CAPITAL MODELING FOR CREDIT RISK (2014) — link
  12. A Quantum Approximate Optimization Algorithm (2014) — link
  13. A variational eigenvalue solver on a photonic quantum processor (2013) — link
  14. Quantum Computation and Quantum Information (2012) — link
  15. Adiabatic quantum computation (2004)
  16. Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) (2004) — link
  17. Quantum Amplitude Amplification and Estimation (2000) — link
  18. Simulating physics with computers (1999)
  19. Quantum computations: algorithms and error correction (1997) — link
  20. Fault tolerant quantum computation by anyons (1997) — link
  21. Quantum Mechanics Helps in Searching for a Needle in a Haystack (1997) — link
  22. Stabilizer Codes and Quantum Error Correction (1997) — link
  23. An exact quantum polynomial-time algorithm for Simon’s problem (1997) — link
  24. Resilient quantum computation: error models and thresholds (1997) — link
  25. Strengths and Weaknesses of Quantum Computing (1997) — link
  26. Fault-tolerant quantum computation with constant error (1996) — link
  27. Quantum error correction via codes over GF(4) (1996) — link
  28. Error Correcting Codes in Quantum Theory. (1996) — link
  29. A fast quantum mechanical algorithm for database search (1996) — link
  30. Good quantum error-correcting codes exist. (1995) — link
  31. Scheme for reducing decoherence in quantum computer memory. (1995) — link
  32. Elementary gates for quantum computation. (1995) — link
  33. Algorithms for quantum computation: discrete logarithms and factoring (1994) — link
  34. Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? (1935) — link
  35. Non-linear Quantum Monte Carlo (2025)
  36. Quantum Algorithms for the Monte Carlo Method. (Algorithmes quantiques pour la méthode de Monte Carlo) (2021) — link
  37. Introduction to Quantum Algorithms via Linear Algebra (2021)
  38. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines (1980) — link
    1. “Mean Estimation When You Have the Source Code; or, Quantum Monte Carlo Methods”

0 of 47 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.