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

• URL: http://arxiv.org/abs/2607.10772v1
• Date: Sun, 12 Jul 2026 14:03:29 GMT
• Title: Demonstrating Quadratic Monte Carlo Speedup via Quantum Amplitude Estimation: Nuclear Engineering Examples
• Abstract summary: We demonstrate quantum amplitude estimation (QAE) as a route to quadratic speedup for Monte Carlo-type expectation values in nuclear engineering.<n>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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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.

Related papers

• 1D Cluster State Generation On Superconducting Hardware [0.0]
  Measurement-based Quantum Computation utilize entanglement as resource for performing quantum computation.<n> generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC.<n>We provide analytical derivations and numerical validations for 4-qubit cluster state.
  arXiv  Detail & Related papers  (2025-08-29T17:24:35Z)
• Non-Hermitian Quantum Metrology Enhancement and Skin Effect Suppression in PT-Symmetric Bardeen-Cooper-Schrieffer Chains [0.0]
  We outline a theoretical framework for quantum metrology in non-Hermitian systems.<n>Through biorthogonal quantum Fisher information analysis, we identify two distinct regimes.<n>NHSE suppresses sensitivity exponentially, while $mathcalPT$-symmetry enables Heisenberg-limited enhancement.
  arXiv  Detail & Related papers  (2025-08-06T18:54:45Z)
• Quantum Error-Corrected Computation of Molecular Energies [0.7018475907464546]
  We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation.<n>We calculate the ground-state energy of molecular hydrogen, using quantum phase estimation (QPE) on qubits encoded with the $[7,3]]$ color code on Quantinuum H2-2.<n>We find that orienting the QEC protocols towards higher memory noise protection is the most promising avenue to improve our experimental results.
  arXiv  Detail & Related papers  (2025-05-14T04:34:48Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum Metropolis-Hastings algorithm with the target distribution calculated by quantum Monte Carlo integration [0.0]
  Quantum algorithms for MCMC have been proposed, yielding the quadratic speedup with respect to the spectral gap $Delta$ compered to classical counterparts. We consider not only state generation but also finding a credible interval for a parameter, a common task in Bayesian inference. In the proposed method for credible interval calculation, the number of queries to the quantum circuit to compute $ell$ scales on $Delta$, the required accuracy $epsilon$ and the standard deviation $sigma$ of $ell$ as $tildeO(sigma/epsilon
  arXiv  Detail & Related papers  (2023-03-10T01:05:16Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Phase Estimation of Local Hamiltonians on NISQ Hardware [6.0409040218619685]
  We investigate a binned version of Quantum Phase Estimation (QPE) set out by [Somma 2019] and known as the Quantum Eigenvalue Estimation Problem (QEEP) Within this framework, we find that our techniques reduce the threshold at which it becomes possible to perform the minimum two-bin instance of this algorithm by an order of magnitude. We propose an application, which we call Randomized Quantum Eigenvalue Estimation Problem (rQeep)
  arXiv  Detail & Related papers  (2021-10-26T11:33:54Z)
• Emulating Quantum Interference with Generalized Ising Machines [0.0]
  This paper presents an exact and general procedure for mapping any sequence of quantum gates onto a network of probabilistic p-bits. We can view this structure as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of qubits to a final configuration. Our results for mapping an arbitrary quantum circuit to a Boltzmann machine with a complex energy function should help push the boundaries of the simulability of quantum circuits with probabilistic resources.
  arXiv  Detail & Related papers  (2020-07-14T22:10:29Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.