Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.13475

Quantum-walk transport oracles and amplitude estimation of a scalar range statistic in proton therapy

Kwangzoo Chung

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum amplitude estimation (QAE) promises a quadratic reduction in the sampling cost of Monte Carlo (MC) particle transport, but two obstacles have kept it from radiotherapy physics: the lack of an efficient unitary encoding of charged-particle transport, and the mismatch between QAE's single-scalar output and the per-voxel structure of dose calculation. We address both. We construct a discrete-time quantum-walk transport oracle for protons in which an energy register is driven by an energy-dependent coin encoding a continuous-slowing-down surrogate of the stopping power, so that stochastic energy loss and range straggling follow from the circuit dynamics. The oracle is unitary, with one fresh coin qubit per step, and its gate count grows linearly in the number of energy levels. On it we formulate a scalar range statistic, the probability that a proton penetrates beyond a distal depth threshold, as a directly marked amplitude, and estimate it by maximum-likelihood amplitude estimation (MLQAE) with Grover iterations and finite shots. The oracle reproduces a Bragg-shaped depth-deposit profile agreeing with a classical MC of identical rules to within 0.27%, and Grover amplification matches $\sin^2((2k+1)θ)$ to machine precision up to $k=32$. At matched budget the MLQAE error falls as $N^{-0.93}$ against $N^{-0.49}$ for sampling, 4.8 times smaller at the largest budget. A three-gate resource analysis (output structure, amortization, error-corrected wall-clock) finds full dose maps structurally unfavourable irrespective of hardware, and the scalar statistic short of a wall-clock crossover at clinical scale: the oracle's derived cost of $1.0 \times 10^6$ logical gates per call ($3.5 \times 10^7$ with rotation synthesis), dominated by the multiplexed coin, is 160 to 5400 times the permitted budget. We report the reduction that would be required and identify the term responsible for it.

DOI
10.48550/arxiv.2611.13475

Related papers

Maximum-Likelihood Amplitude Estimation for Quantum Monte Carlo Integration on Trapped-Ion Hardware: Convergence, Noise-Floor Saturation, Depth-Dependent Bias

Aditi Lal, Alex Khan, Rut Lineswala +1 more

Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical $\varepsilon \propto N^{-1/2}$ sampling law with the Heisenberg-limited $\varepsilon \propto N^{-1}$ scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-$R_y$ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against $b_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}x$ with $b_{\max}=π/5$ ,given results emerge. First, the noiseless limit it attains $\varepsilon \propto N^{-0.88}$, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and $α\le\!0$ on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth $m \ge 2$, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.

quant-pharXiv:2609.25992•Sep 23, 2026•1 citation

Lattice-quantile estimation of π and convex-region integrals from coined two-dimensional quantum walks

Jen-Yu Chang, En-Jui Kuo, Chih-Yu Chen +1 more

Monte Carlo integration is fundamentally limited by the M^(-1/2) rate that the Cramer-Rao bound imposes on any sample-mean estimator of an expectation value, regardless of how the samples are drawn. Coined discrete-time quantum walks (DTQWs) are known to spread ballistically - their position variance scales as T^2 against the diffusive T of classical random walks - yet this faster spreading has not been exploited for numerical integration. We show that coupling the ballistic scaling of a 2D DTQW to the Hardy-Huxley asymptotic for Gauss circle lattice counts produces estimators whose dominant error is a deterministic number-theoretic residual controlled by walk depth T, not a statistical fluctuation controlled by sample count M. The construction replaces the empirical mean of a sample-mean estimator with the ratio N(R-hat)/R-hat^2 of a lattice count to the square of a radial position quantile, a structural change that sidesteps the Cramer-Rao barrier. A single batch of measurements then propagates through classically precomputed multipliers to cover an entire family of integrals simultaneously. We develop the framework for convex smooth domains via Kraetzel's lattice asymptotic and for smooth integrals with convex or annular super-level sets via Cavalieri's principle, and provide a parameter-free identity for the bias floor (validated to within 1.5x across all tested depths). Every experiment is benchmarked against the classical random walk with the identical estimator to isolate the quantum contribution; the framework is oracle-free in the QAE sense (no controlled unitary encoding the integrand is required) and structurally distinct from quantum amplitude estimation and Szegedy-walk approaches. These ratios compare measurement counts at fixed precision and do not include quantum circuit execution cost.

quant-pharXiv:2606.22334•Jun 23, 2026•0 citations

Demonstrating Quadratic Monte Carlo Speedup via Quantum Amplitude Estimation: Nuclear Engineering Examples

Jilang Miao, Miaomiao Jin, Akira Sone

We demonstrate quantum amplitude estimation (QAE) as a route to quadratic speedup for Monte Carlo-type expectation values in nuclear engineering. Using QPE-based QAE, we study two examples: a discrete fission-neutron-yield expectation and a U-238 resonance integral under a $1/E$ slowing-down spectrum. The toy problem is implemented as a gate-level Qiskit circuit, while the resonance-integral example is simulated through an exact eigendecomposition of the Grover operator to avoid state-preparation decomposition bottlenecks. In both cases, the squared error scales as $O(1/T^2)$ with the number of oracle calls $T$, compared with the classical Monte Carlo scaling $O(1/N)$. For the U-238 example, QAE recovers the resonance integral to approximately $0.03%$ relative error with $m=14$ phase-estimation qubits.

quant-pharXiv:2607.10772•Jul 14, 2026•1 citation

Hardware-Efficient Quantum Grid Sampling for Low-Latency Amplitude Estimation

Yu-Ting Kao, Haoyu Lu, Yeong-Jar Chang +3 more

High-performance computing heavily relies on Monte Carlo (MC) simulation, but achieving high precision imposes massive computational loads due to its low convergence rate. To overcome this classical bottleneck, Quantum Amplitude Estimation (QAE) has emerged as a powerful algorithmic alternative, theoretically offering a quadratic speedup by offloading these workloads to quantum accelerators. However, mitigating Quantum Fourier Transform (QFT) discretization errors typically require Maximum Likelihood Estimation (MLE). MLE introduces prohibitive iterative latency and struggles with shot-noise in low-measurement regimes. To address this, we propose a comprehensive, hardware-efficient framework that integrates uniform state preparation with a novel Peak Estimation Refinement (PER) readout technique. PER exploits the symmetric conjugate eigenvalues of the quantum operator to provide deterministic,${O}(\mathrm{1})$probability extraction. This eliminates classical iterative optimization, achieving an approximately$600 \times$reduction in post-processing latency while inherently amplifying the signal-to-noise margin to resist stochastic fluctuations in low-shot environments. Validated via an RTL-to-quantum compilation flow and a 10 -qubit$\pi$-estimation synthesis benchmark, we demonstrate an estimation error of 0.007 %, proving the viability of migrating complex probabilistic workloads to real-time quantum accelerators

IEEE Dallas Circuits and Systems Conference (DCAS)•Apr 10, 2026•0 citations

Quantum Amplitude Estimation for Travel Time Estimation in Stochastic Vehicle Routing Problems

Xingyue Wang, Monika Filipovska

Solving the Vehicle Routing Problem (VRP) in Stochastic Transportation Networks (STNs), a core task in Intelligent Transportation Systems (ITS), introduces estimation challenges for stochastic path travel times and the resulting VRP objective function. These challenges have typically been addressed through computationally expensive sampling-based techniques such as Monte Carlo simulation, whose performance depends on sample size, the sampling strategy, and the underlying travel time distributions. To address these issues, this study proposes and validates a quantum computing technique, Quantum Amplitude Estimation (QAE) for path-level travel time estimation in STNs. Without relying on sampling or prior assumptions of the travel time distribution, the proposed framework encodes all feasible travel time realizations into a quantum superposition, enabling a theoretical quadratic speed-up over Monte Carlo simulation. Four QAE variants are implemented in IBM's Qiskit framework, namely Canonical AE (CAE), Iterative AE (IAE), Maximum Likelihood AE (MLAE), and Faster AE (FAE), together with four rotation-angle scaling strategies for handling different discrete travel time distributions. Experiments on a small-scale STN show that the choice of scaling method and rotation-angle range significantly affects estimation accuracy, while the four QAE variants produce comparable estimates across all tested conditions, with IAE exhibiting the most stable overall performance. The results provide practical guidance on parameter selection for future hybrid quantum-classical optimization frameworks in ITS applications.

quant-pharXiv:2608.06145•Aug 7, 2026•0 citations

Quantum Rare-Event Estimation for Ising Graphical Models with Belief-Propagation State Preparation

Mario Hernández Vera, Narges Jamialahmadi, Burak Mete +2 more

Quantum amplitude estimation can reduce the sampling cost of rare-event probability estimation, but applying it to correlated Ising graphical models is limited by the difficulty of preparing the target distribution and building a practical event oracle. This work explores two approximate strategies for mitigating these challenges. We introduce a sample-free state-preparation method combining loopy belief propagation with the Chow--Liu algorithm. The resulting tree approximation is compiled into a quantum circuit with linear gate count and depth, and its accuracy is evaluated across graph families spanning different topologies, coupling strengths, and coupling signs. We also construct a structural oracle that evaluates threshold rules with reversible Boolean gates. Using a twenty-node supply-chain disruption model as a case study, we compare maximum likelihood amplitude estimation against four classical Monte Carlo baselines. Under the fixed-depth schedule used throughout this work, the quantum estimator has the same asymptotic error scaling as the classical methods but achieves lower estimation error by a constant factor. This reduction narrows when amplitude-encoding queries replace raw shots as the resource metric. We separate statistical error from the deterministic errors caused by approximate state preparation and oracle construction, and identify the requirements for achieving an improvement beyond a constant factor.

quant-pharXiv:2608.26840•Aug 28, 2026•0 citations
Quantum amplitude estimation (QAE) promises a quadratic reduction in the sampling cost of Monte Carlo (MC) particle transport, but two obstacles have kept it from radiotherapy physics: the lack of an efficient unitary encoding of charged-particle transport, and the mismatch between QAE's single-scalar output and the per-voxel structure of dose calculation. We address both. We construct a discrete-time quantum-walk transport oracle for protons in which an energy register is driven by an energy-dependent coin encoding a continuous-slowing-down surrogate of the stopping power, so that stochastic energy loss and range straggling follow from the circuit dynamics. The oracle is unitary, with one fresh coin qubit per step, and its gate count grows linearly in the number of energy levels. On it we formulate a scalar range statistic, the probability that a proton penetrates beyond a distal depth threshold, as a directly marked amplitude, and estimate it by maximum-likelihood amplitude estimation (MLQAE) with Grover iterations and finite shots. The oracle reproduces a Bragg-shaped depth-deposit profile agreeing with a classical MC of identical rules to within 0.27%, and Grover amplification matches sin⁡2((2k+1)θ)\sin^2((2k+1)θ)sin2((2k+1)θ) to machine precision up to k=32k=32k=32. At matched budget the MLQAE error falls as N−0.93N^{-0.93}N−0.93 against N−0.49N^{-0.49}N−0.49 for sampling, 4.8 times smaller at the largest budget. A three-gate resource analysis (output structure, amortization, error-corrected wall-clock) finds full dose maps structurally unfavourable irrespective of hardware, and the scalar statistic short of a wall-clock crossover at clinical scale: the oracle's derived cost of 1.0×1061.0 \times 10^61.0×106 logical gates per call (3.5×1073.5 \times 10^73.5×107 with rotation synthesis), dominated by the multiplexed coin, is 160 to 5400 times the permitted budget. We report the reduction that would be required and identify the term responsible for it.
Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical ε∝N−1/2\varepsilon \propto N^{-1/2}ε∝N−1/2 sampling law with the Heisenberg-limited ε∝N−1\varepsilon \propto N^{-1}ε∝N−1 scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-RyR_yRy​ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against bmax⁡−1 ⁣∫0bmax⁡ ⁣sin⁡2 ⁣x dxb_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}xbmax−1​∫0bmax​​sin2xdx with bmax⁡=π/5b_{\max}=π/5bmax​=π/5 ,given results emerge. First, the noiseless limit it attains ε∝N−0.88\varepsilon \propto N^{-0.88}ε∝N−0.88, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and α≤ ⁣0α\le\!0α≤0 on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth m≥2m \ge 2m≥2, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.
Monte Carlo integration is fundamentally limited by the M^(-1/2) rate that the Cramer-Rao bound imposes on any sample-mean estimator of an expectation value, regardless of how the samples are drawn. Coined discrete-time quantum walks (DTQWs) are known to spread ballistically - their position variance scales as T^2 against the diffusive T of classical random walks - yet this faster spreading has not been exploited for numerical integration. We show that coupling the ballistic scaling of a 2D DTQW to the Hardy-Huxley asymptotic for Gauss circle lattice counts produces estimators whose dominant error is a deterministic number-theoretic residual controlled by walk depth T, not a statistical fluctuation controlled by sample count M. The construction replaces the empirical mean of a sample-mean estimator with the ratio N(R-hat)/R-hat^2 of a lattice count to the square of a radial position quantile, a structural change that sidesteps the Cramer-Rao barrier. A single batch of measurements then propagates through classically precomputed multipliers to cover an entire family of integrals simultaneously. We develop the framework for convex smooth domains via Kraetzel's lattice asymptotic and for smooth integrals with convex or annular super-level sets via Cavalieri's principle, and provide a parameter-free identity for the bias floor (validated to within 1.5x across all tested depths). Every experiment is benchmarked against the classical random walk with the identical estimator to isolate the quantum contribution; the framework is oracle-free in the QAE sense (no controlled unitary encoding the integrand is required) and structurally distinct from quantum amplitude estimation and Szegedy-walk approaches. These ratios compare measurement counts at fixed precision and do not include quantum circuit execution cost.
We demonstrate quantum amplitude estimation (QAE) as a route to quadratic speedup for Monte Carlo-type expectation values in nuclear engineering. Using QPE-based QAE, we study two examples: a discrete fission-neutron-yield expectation and a U-238 resonance integral under a 1/E1/E1/E slowing-down spectrum. The toy problem is implemented as a gate-level Qiskit circuit, while the resonance-integral example is simulated through an exact eigendecomposition of the Grover operator to avoid state-preparation decomposition bottlenecks. In both cases, the squared error scales as O(1/T2)O(1/T^2)O(1/T2) with the number of oracle calls TTT, compared with the classical Monte Carlo scaling O(1/N)O(1/N)O(1/N). For the U-238 example, QAE recovers the resonance integral to approximately 0.030.03%0.03 relative error with m=14m=14m=14 phase-estimation qubits.
High-performance computing heavily relies on Monte Carlo (MC) simulation, but achieving high precision imposes massive computational loads due to its low convergence rate. To overcome this classical bottleneck, Quantum Amplitude Estimation (QAE) has emerged as a powerful algorithmic alternative, theoretically offering a quadratic speedup by offloading these workloads to quantum accelerators. However, mitigating Quantum Fourier Transform (QFT) discretization errors typically require Maximum Likelihood Estimation (MLE). MLE introduces prohibitive iterative latency and struggles with shot-noise in low-measurement regimes. To address this, we propose a comprehensive, hardware-efficient framework that integrates uniform state preparation with a novel Peak Estimation Refinement (PER) readout technique. PER exploits the symmetric conjugate eigenvalues of the quantum operator to provide deterministic,O(1){O}(\mathrm{1})O(1)probability extraction. This eliminates classical iterative optimization, achieving an approximately600×600 \times600×reduction in post-processing latency while inherently amplifying the signal-to-noise margin to resist stochastic fluctuations in low-shot environments. Validated via an RTL-to-quantum compilation flow and a 10 -qubitπ\piπ-estimation synthesis benchmark, we demonstrate an estimation error of 0.007 %, proving the viability of migrating complex probabilistic workloads to real-time quantum accelerators
Solving the Vehicle Routing Problem (VRP) in Stochastic Transportation Networks (STNs), a core task in Intelligent Transportation Systems (ITS), introduces estimation challenges for stochastic path travel times and the resulting VRP objective function. These challenges have typically been addressed through computationally expensive sampling-based techniques such as Monte Carlo simulation, whose performance depends on sample size, the sampling strategy, and the underlying travel time distributions. To address these issues, this study proposes and validates a quantum computing technique, Quantum Amplitude Estimation (QAE) for path-level travel time estimation in STNs. Without relying on sampling or prior assumptions of the travel time distribution, the proposed framework encodes all feasible travel time realizations into a quantum superposition, enabling a theoretical quadratic speed-up over Monte Carlo simulation. Four QAE variants are implemented in IBM's Qiskit framework, namely Canonical AE (CAE), Iterative AE (IAE), Maximum Likelihood AE (MLAE), and Faster AE (FAE), together with four rotation-angle scaling strategies for handling different discrete travel time distributions. Experiments on a small-scale STN show that the choice of scaling method and rotation-angle range significantly affects estimation accuracy, while the four QAE variants produce comparable estimates across all tested conditions, with IAE exhibiting the most stable overall performance. The results provide practical guidance on parameter selection for future hybrid quantum-classical optimization frameworks in ITS applications.
Quantum amplitude estimation can reduce the sampling cost of rare-event probability estimation, but applying it to correlated Ising graphical models is limited by the difficulty of preparing the target distribution and building a practical event oracle. This work explores two approximate strategies for mitigating these challenges. We introduce a sample-free state-preparation method combining loopy belief propagation with the Chow--Liu algorithm. The resulting tree approximation is compiled into a quantum circuit with linear gate count and depth, and its accuracy is evaluated across graph families spanning different topologies, coupling strengths, and coupling signs. We also construct a structural oracle that evaluates threshold rules with reversible Boolean gates. Using a twenty-node supply-chain disruption model as a case study, we compare maximum likelihood amplitude estimation against four classical Monte Carlo baselines. Under the fixed-depth schedule used throughout this work, the quantum estimator has the same asymptotic error scaling as the classical methods but achieves lower estimation error by a constant factor. This reduction narrows when amplitude-encoding queries replace raw shots as the resource metric. We separate statistical error from the deterministic errors caused by approximate state preparation and oracle construction, and identify the requirements for achieving an improvement beyond a constant factor.