Efficient and robust uncertainty quantification (UQ) is essential in aerospace systems, as emphasized by both NASA’s CFD Vision 2030 and Certification by Analysis (CbA) 2040 initiatives. However, the extensive computational resources required by traditional UQ methods, especially when coupled with high-fidelity computational fluid dynamics (CFD) simulations, pose significant barriers. Quantum computing (QC) has been identified by the CFD Vision 2030 study as a promising technology to address these challenges, but has not yet been extensively explored in the context of UQ. In this study, a Quantum Computing-based Monte Carlo (QCMC) algorithm is implemented using a Qiskit simulator. This method utilizes Quantum Amplitude Estimation (QAE), specifically tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) computers. The QCMC method demonstrates comparable accuracy to classical Monte Carlo (MC) methods on a two-dimensional heat diffusion problem while reducing the required number of samples (oracle calls) by ∼8X. By substantially lowering the computational overhead of UQ, this quantum computing-based algorithm could be a promising tool required to enable robust uncertainty-informed aerospace design.
Efficient and robust uncertainty quantification (UQ) is essential in aerospace systems, as emphasized by both NASA’s CFD Vision 2030 and Certification by Analysis (CbA) 2040 initiatives. However, the extensive computational resources required by traditional UQ methods, especially when coupled with high-fidelity computational fluid dynamics (CFD) simulations, pose significant barriers. Quantum computing (QC) has been identified by the CFD Vision 2030 study as a promising technology to address these challenges, but has not yet been extensively explored in the context of UQ. In this study, a Quantum Computing-based Monte Carlo (QCMC) algorithm is implemented using a Qiskit simulator. This method utilizes Quantum Amplitude Estimation (QAE), specifically tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) computers. The QCMC method demonstrates comparable accuracy to classical Monte Carlo (MC) methods on a two-dimensional heat diffusion problem while reducing the required number of samples (oracle calls) by ∼8X. By substantially lowering the computational overhead of UQ, this quantum computing-based algorithm could be a promising tool required to enable robust uncertainty-informed aerospace design.
Quantum computing is a very active and diverse area, with immense research and development occurring in quantum hardware design and algorithm creation for applications in various scientific fields. The key motivation behind such efforts is the potential for significant speed-up relative to simulations on classical computers. Quantum Monte Carlo Integration (QMCI) is a quantum algorithm that promises a quadratic advantage in terms of the required number of samples for a required accuracy over classical Monte Carlo Integration (MCI), which is a key statistical resource for integrating multi-dimensional space. In this study, we explore the reality of this potential, specifically for applications in Computational Fluid Dynamics (CFD). We perform an eigenvalue stability analysis for a 1D convection-diffusion equation, in which the coefficients depend on a random number. The quantum algorithm utilized uses quantum amplitude estimation (QAE) to accelerate the integral estimation process. Numerical values obtained from QMCI results are compared against numerical integration techniques, and acceptably low errors are observed. The performance of QMCI is compared against MCI by equating the number of oracle calls in QMCI with the number of samples required in MCI. No significant difference in this metric is observed, with QMCI requiring more oracle calls. This suggests that the expected quantum supremacy is not attainable for the considered numerical integration problem and its quantum-circuit implementation. Extension to available Noisy-Intermediate-Scale-Quantum (NISQ) hardware is expected to reveal more about the algorithm implementation and the simulator emulation. Potential future directions that can be explored in algorithmic development based on this preliminary research are outlined.
The Quantum Amplitude Estimation (QAE) algorithm is a major quantum algorithm designed to achieve a quadratic speed-up. Until fault-tolerant quantum computing is achieved, being competitive over classical Monte Carlo (MC) remains elusive. Alternative methods have been developed so as to require fewer resources while maintaining an advantageous theoretical scaling. We compared the standard QAE algorithm with two Noisy Intermediate-Scale Quantum (NISQ)-friendly versions of QAE on a numerical integration task, with the Monte Carlo technique of Metropolis–Hastings as a classical benchmark. The algorithms were evaluated in terms of the estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the solutions, respectively. The effectiveness of the two QAE alternatives was tested on an 11-qubit trapped-ion quantum computer in order to verify which solution can first provide a speed-up in the integral estimation problems. We concluded that an alternative approach is preferable with respect to employing the phase estimation routine. Indeed, the Maximum Likelihood estimation guaranteed the best trade-off between the length of the quantum circuits and the precision in the integral estimation, as well as greater resistance to noise.
This paper presents a novel approach to simulating complex fluid dynamics, specifically turbulent flows, utilizing quantum-inspired algorithms. Traditional numerical methods, such as Navier-Stokes solvers, often struggle with the computational demands of accurately representing turbulence, leading to significant processing times and limitations in practical applications. We introduce a simulation strategy based on quantum amplitude estimation (QAE), a technique inspired by quantum computing principles, to accelerate the solution process. The core idea is to approximate the probability amplitude associated with different fluid states, thereby reducing the number of iterations required to reach a stable solution. We demonstrate, through theoretical analysis and a simplified numerical framework, that QAE offers a promising path toward more efficient and accurate simulations of turbulent flows, potentially bridging the gap between classical computational fluid dynamics (CFD) and the computational benefits anticipated from full-scale quantum simulation. This work lays the groundwork for future research exploring the full potential of quantum-inspired algorithms in tackling complex fluid dynamics problems.
This review is designed to introduce mathematicians and computational scientists to quantum computing (QC) through the lens of uncertainty quantification (UQ) by presenting a mathematically rigorous and accessible narrative for understanding how noise and intrinsic randomness shape quantum computational outcomes in the language of mathematics. By grounding quantum computation in statistical inference, we highlight how mathematical tools such as probabilistic modeling, stochastic analysis, Bayesian inference, and sensitivity analysis, can directly address error propagation and reliability challenges in today's quantum devices. We also connect these methods to key scientific priorities in the field, including scalable uncertainty-aware algorithms and characterization of correlated errors. The purpose is to narrow the conceptual divide between applied mathematics, scientific computing and quantum information sciences, demonstrating how mathematically rooted UQ methodologies can guide validation, error mitigation, and principled algorithm design for emerging quantum technologies, in order to address challenges and opportunities present in modern-day quantum high performance and fault-tolerant quantum computing paradigms.
This paper explores the application of quantum-inspired algorithms to accelerate the simulation of fluid dynamics. Traditional computational fluid dynamics (CFD) methods, particularly those solving the Navier-Stokes equations, are often computationally expensive, limiting their applicability in real-time simulations and complex scenarios. This research investigates the potential of mimicking quantum phenomena, specifically wave interference and amplitude estimation, through the design and implementation of novel algorithms. The core idea is to leverage techniques inspired by quantum computing to achieve a significant speedup in solving these equations. We present a framework utilizing amplitude estimation to efficiently approximate solutions, offering a potential pathway to overcome the computational bottlenecks inherent in conventional CFD. The presented approach provides a novel methodology for simulating fluid dynamics with reduced computational cost, opening opportunities for advancements in areas such as aerospace, automotive, and weather forecasting.
This paper introduces a novel approach to uncertainty quantification (UQ) by drawing inspiration from quantum mechanics. Traditional UQ methods, particularly Monte Carlo simulations, often struggle with the curse of dimensionality, exhibiting diminishing returns as the number of variables increases. We propose a framework utilizing simulated quantum measurement processes to efficiently explore probability spaces, aiming for significant improvements in both speed and accuracy. The core concept involves translating probabilistic programming logic into a sequence of simulated quantum measurements, mimicking the principles of superposition and entanglement. This approach moves beyond the limitations of classical sampling techniques and potentially unlocks exponential speedups in complex system modeling. The presented methodology focuses on a new programming language and runtime designed specifically for this quantum-inspired probabilistic programming paradigm. We explore the theoretical underpinnings and outline the key components of this system, highlighting the advantages it offers over conventional UQ methods. The design prioritizes computational efficiency and scalability, crucial aspects for tackling real-world problems characterized by high-dimensional uncertainty. The ultimate goal is to develop a robust and practical tool for accurately assessing risk and making informed decisions in complex, uncertain environments.