Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this work, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. The results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.
Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this work, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. The results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.
Monte Carlo methods use random sampling to estimate numerical quantities which are hard to compute deterministically. One important example is the use in statistical physics of rapidly mixing Markov chains to approximately compute partition functions. In this work, we describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting. The algorithm estimates the expected output value of an arbitrary randomized or quantum subroutine with bounded variance, achieving a near-quadratic speedup over the best possible classical algorithm. Combining the algorithm with the use of quantum walks gives a quantum speedup of the fastest known classical algorithms with rigorous performance bounds for computing partition functions, which use multiple-stage Markov chain Monte Carlo techniques. The quantum algorithm can also be used to estimate the total variation distance between probability distributions efficiently.
The rapid developments that have occurred in quantum computing platforms over the past few years raise important questions about the potential for applications of this new type of technology to fluid dynamics and combustion problems, and the timescales on which such applications might be possible. As a concrete example, here a quantum algorithm is developed and employed for predicting the rate of reactant conversion in the binary reaction of F+rO→(1+r) Product in non-premixed homogeneous turbulence. These relations are obtained by means of a transported probability density function equation. The quantum algorithm is developed to solve this equation and is shown to yield the rate of the reactants' conversion much more efficiently than current classical methods, achieving a quadratic quantum speedup, in line with expectations for speedups arising from quantum metrology techniques more broadly. This provides an important example of a quantum algorithm with a real engineering application, which can build a connection to present work in turbulent combustion modelling and form the basis for further development of quantum computing platforms and their applications to fluid dynamics.
We present a quantum-enhanced Markov chain Monte Carlo (QE-MCMC) method to sample turbulent acceleration vectors from a joint target distribution that depends on all three components and height to model the transport and dispersion of massless Lagrangian tracer particles in two turbulent shear flows. A homogeneous shear flow, characterized by a uniform shear rate S, is considered as the starting point. Secondly, a turbulent boundary layer, which forms in both halves of a plane turbulent channel flow at friction Reynolds number Re_tau = 1000, is considered, where the mean shear rate S(y) varies with distance from the wall y. In this hybrid quantum-classical method, the proposal distribution Q for the first of two Metropolis-Hastings sampling substeps is constructed by a parametric quantum circuit. The algorithm generates synthetic tracer particle tracks. The resulting scaling laws for tracer-particle pair dispersion, a central quantity to probe turbulent mixing from a Lagrangian perspective, agree with a stochastic transport model consisting of coupled Langevin equations and with the classical MCMC counterpart. Differently from the classical sampling method, QE-MCMC uses a tempered target distribution. Due to the height dependence of the tracer dynamics in turbulent channel flow, an effective height-weighted spectral gap between the first and second eigenvalue of the Markov-chain transition matrix is introduced. The latter is found to significantly exceed the one of classical MCMC when sampling from a multivariate distribution with cross-correlations at the highest qubit numbers and thus resolutions. Consequently, our results support the applicability of this one-shot algorithm as a generative Lagrangian quantum-computing module, possibly embedded in a complex fluid-flow problem. Our module is found to work reliably for a relatively small number of qubits per spatial dimension of Nq <= 6.
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.
Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy ε typically requires a number of function evaluations scaling as O(1/ε2). Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require 2q low discrepancy points, one can prepare a higher-resolution net of size 2Q, with Q>q, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.
We present a quantum-assisted generative algorithm for synthetic tracks of Lagrangian tracer particles in a simple turbulent shear flow. The parallelism, a result of the underlying tensor product structure of an n-qubit quantum register, and the sampling properties of quantum algorithms are used to build and optimize a parametric quantum circuit, which generates a quantum state that corresponds to the joint probability density function of the classical turbulent velocity components, p(u1′,u2′,u3′). Velocity samples are drawn by one-shot measurements on the quantum circuit. The hybrid quantum-classical algorithm is validated with two classical methods, a standard stochastic Lagrangian model and a classical sampling scheme in the form of a Markov-chain Monte Carlo approach. In detail, we consider a homogeneous turbulent shear flow with a constant shear rate S as a proof of concept for which the velocity fluctuations are Gaussian. The generation of the joint probability density function is also tested on a real quantum device, the 20-qubit IQM Resonance quantum computing platform for cases of up to 10 qubits. Our study paves the way to applications of Lagrangian small-scale parameterizations of turbulent transport in complex turbulent flows with quantum computers. A quantum advantage is possible by the efficient reconstruction of high-dimensional probability density functions, which can be sampled efficiently.