betaFeedback

WorksPhysics and Astronomy

Quantum computing for fluids: where do we stand?

Abstract

We present a pedagogical introduction to the current state of quantum computing algorithms for the simulation of classical fluids. Different strategies, along with their potential merits and liabilities, are discussed and commented on.

Introduction. –

Quantum computing is one of the most uproaring topics of modern science, holding promises of spectacular applications far beyond the reach of classical electronic computers, at least for selected applications [1]. The manifesto of quantum computing can be traced back to Richard Feynman’s epoch-making paper, in which he famously observed that physics ”ain’t classical”, hence it ought to be simulated on quantum computers [2].

Following Feynman’s observations, early theoretical work on quantum computing was performed in the 1980s, e.g. Deutsch’s work on the link between quantum theory, universal quantum computers and the Church–Turing principle [3]. Then, with the publication of Shor’s algorithm for integer factoring and Grover’s search algorithm in the middle of the 1990s, the research area gathered significant momentum in terms of theoretical work and quantum computing hardware as well. The research area of quantum computing has continued to grow ever since [4, 5, 6]. In terms of applications for quantum computers, the simulation of quantum many-body systems has received the most attention, due to its scientific and industrial applications, as well as the relatively close link with quantum hardware, as per Feynman’s original proposal. In this Perspective, however, we shall focus on a much less beaten track, namely the use of quantum computers for the simulation of classical fluids 1. To this purpose, let us refer to a physics-computing plane defined by the following four-quadrants:

CC: Classical computing for Classical physics;

CQ: Classical computing for Quantum physics;

QC: Quantum computing for Classical physics;

QQ: Quantum computing for Quantum physics.

as represented graphically in Figure 1. Feynman was probably referring to the CQ sector shown in Figure 1, where one is often faced with exponential complexity barriers (in his Nobel speech, Walter Kohn defines the many-body Schrödinger wavefunction as ”unphysical” precisely because of this reason [8]). The basic idea is that these barriers are unphysical because we are using the wrong formalism to ask the question that lie behind them. Unlike Kohn, Feynman takes no issue at the N-body Schrödinger equation, but simply observes that it is unphysical only if we insist in solving it on the CQ quadrant instead of the QQ one. In line with this observation, the simulation of quantum many-body systems has received most of the quantum computing attention in the recent past [9, 10].

The four quadrants in the Physics-Computing plane

Figure 1. The four quadrants in the Physics-Computing plane. The CC and CQ quadrants are the mainstay of current simulation work. QQ is the quadrant invoked by Feynman, and QC is the quadrant addressed by the present Perspective.

In this Perspective, we shall focus on the much less explored off-diagonal QC quadrant, the natural question being whether the power of quantum computing can be brought to the benefit of classical physics as well, with specific focus on classical fluid dynamics.

Yet, there is another, subtler, motivation along the Kohn-Feynman discussion above: while it is undeniable that physics is quantum, it is no less true that physics has a very strong innate tendency to become classical at sufficiently large scales (high temperature). Such tendency, the major source of troubles for quantum computing, remains only partially understood and therefore the ”foundational” question is whether at some point, classical computing takes over and cannot be beaten by any quantum algorithm. This is just the opposite of the standard notion of ”Quantum Advantage”, hence we may dub it ”Classical Advantage”.

Speaking of Classical Advantage, the starting observation is that many classical problems feature two major elephants in the quantum computing room: non-linearity and non-hermicity (dissipation). How does quantum computing deal with the two ”elephants” above? This is the main question addressed by this Perspective, with specific focus on classical fluids [11].

Challenges facing quantum computational fluid dynamics (QCFD).

As mentioned in the introduction, realising the potential of quantum computing means leveraging distinctive features of quantum mechanics that, by definition, are not available on classical computers. However, it also follows that it is precisely these specific features that expose major challenges in realising simulations with a quantum advantage.

The main quantum mechanical concepts spawning the potential benefit of quantum algorithms are quantum superposition and quantum parallelism. The quantum state in an QQ-qubit coherent register can be described by the Schrödinger wave function, defined by 2Q2^Q complex amplitudes for 2Q2^Q states in superposition. The square of each of these amplitudes defines the probability of finding the system in the corresponding state after quantum measurement. By encoding classical data in terms of these amplitudes an exponential saving in storage can be achieved when the number of qubits is compared to required number of classical bits.

Let us illustrate the idea for the specific case of turbulent flow simulation. Turbulence features a Re3Re^3 complexity, where the Reynolds number ReRe represents the relative strength of convection (nonlinearity) versus dissipation. Most real life problems feature Reynolds numbers in the many-millions; for instance an airplane features Re∼108Re \sim10^8, implying O(1024)O(10^{24}) floating-point operations per simulation. This is basically the best one can afford on a nearly-ideal Exascale classical computer. The simulation of regional atmospheric circulation flows takes us at least another two decades above in the Reynolds number, hence totally out of reach for any foreseeable classical computer [12, 13]. On the other hand, the minimum number of qubits QQ required to represent Re3Re^3 complexity can be roughly estimated as 2Q=Re32^Q = Re^3, namely:

Q∼10log⁡10Re(1)Q \sim10\log_{10}Re \tag*{(1)}

This simple estimate shows that 80 qubits match the requirement of full-scale airplane design, while O(100)O(100) qubits would enable regional atmospheric models. However, several key challenges stand in the way of this task. First, quantum measurement needed to extract classical information collapses the quantum wave vector. Hence, to get classical values for each of the amplitudes, multiple realisations of the quantum state vector are needed with an associated set of measurements. Second, in the quantum circuit model, the ’classical’ information is not available to the quantum gate operations performed in the circuit. Specifically, gate operations can be conditional on the state of one or more control qubits, while specifying gate operations conditional on one or more of the complex amplitudes defining the wave function is impossible. Therefore, when classical data is encoded in terms of amplitudes, for example, a rotation angle in a quantum gate operation, this information is required at the time the circuit is compiled. During the execution of the circuit, this angle cannot be changed as a function of ’classical’ data encoded in quantum amplitudes. Third, In an algorithm involving multiple iterations or time-steps, the overhead associated with quantum measurements used to extract classical data and re-initialization of the quantum state for a next iteration, scale quadratically with the grid size [14] and consequently they severely tax the quantum CFD efficiency. Associated with these challenges, it should be observed that the well-known HHL [15] algorithm for linear system solution, assumes that the input and output data are encoded in terms of quantum amplitudes without including the cost of setting up the quantum state and extracting the classical solution.

With the exception of quantum measurement operations, quantum mechanical operators are unitary, linear and reversible. These operators are implemented using a series of unitary quantum gates (quantum circuit model). If we further assume that the velocity field is represented in terms of amplitude encoding [16], i.e. the components of velocity vector at all grid points are represented in terms of the amplitudes defining the wavefunction, then the no-cloning theorem prevents the use of (temporary) copies of any of these amplitudes. So, evaluation of u2u^2 or u∂u∂xu\frac{\partial u}{\partial x} cannot be performed by storing a temporary copy temp=utemp = u, to perform the computation of the value of u2u^2 as u×tempu \times temp. Also, for data encoded in terms of the complex amplitudes of the Schrödinger wavefunction, there is a need for this state vector to have a unit norm, since these amplitudes represent probabilities of states. This means that for an operator attempting to compute the squares of these complex amplitudes, the resulting state vector loses unitarity. So, even without the no-cloning theorem complicating such a step, this points to a further problem with computing non-linear terms. A similar argument runs for orthogonality of the eigenstates, since a nonlinear propagator rotates the state by an angle which depends on the state itself.

Dissipation is also a concern, since it breaks hermicity of the quantum propagator. However, several ways out can be conceived, one of the most popular ones being to augment the system with its hermitian conjugate, so that the doubled system is hermitian by construction.

To summarize, dealing with non-linear terms can be regarded as one of the main challenges for Quantum Computational Fluid Dynamics (QCFD).

Hybrid quantum/classical approaches. –

The challenges sketched above relating to non-linearity, non-hermicity, in combination with quantum circuit depth limitations imposed by NISQ-era hardware, have resulted in the fact that most of the existing work in QCFD is based on a hybrid quantum/classical approach, with the quantum processor performing computations for which efficient quantum algorithms exist, while the output is then passed on to classical hardware to perform further computational tasks not (yet) amenable to quantum algorithms.

Figure 2 provides an illustration of the main concepts in this approach. As shown, quantum state ψ0\psi_0 is advanced to the next quantum state ψ1\psi_1 via a QQ algorithm. The quantum state ψ1\psi_1 is then used to generate classical observables C1C_1 which are advanced to C2C_2 by a CC algorithm. The classical observables C2C_2 are then used to reconstruct the quantum state ψ2\psi_2, ready for the next QQ step. The Q2C conversion shown in Figure 2 involves quantum measurements and requires averaging over a statistical samples of quantum states, since none of them can be reused. The C2Q reconstruction requires the preparation of all the quantum eigenstates, hence a full reset of the quantum circuits from scratch. Both operations impose a substantial computational burden on the hybrid algorithm. Specifically, the cost of initialization of an arbitrary quantum state with QQ qubits scales exponentially with QQ. Initialization techniques with smaller overhead have been developed for a limited set of specific quantum states.

Hybrid quantum-classical algorithm

Figure 2. Sketch of a hybrid quantum-classical algorithm. The illustration shows the steps involved in a single time step or single iteration, including preparation of the subsequent step/iteration.

Examples of previous works using the hybrid quantum/classical approach include the works of Steijl [17], Gaitan [19] and Budinski [20]. The algorithm presented by Gaitan uses Kacewicz’s quantum amplitude estimation QDE algorithm [21] as applied to the set of non-linear ODE’s resulting from standard discretization of the Navier-Stokes equations. As shown, for certain ’non-smooth’ problems (illustrated using the quasi-1D flow in converging-diverging duct with normal shock wave), the complexity analysis shows potential for exponential speed-

up, so that the challenges associated with hybrid quantum/classical computing can potentially be overcome. For the linear advection-diffusion equation, Budinski [22] presented a quantum algorithm based on the Lattice Boltzmann method [23]. The algorithm can perform multiple successive time steps with no need for quantum measurements and re-initialization of qubit register between the time steps if suitable re-scaling of solution vector is applied to deal with non-unitarity. In the quantum circuit model, the fact that velocity field is unchanged between successive timestep means that an operator implementing ∂u∂x\frac{\partial u}{\partial x} can be re-used in multiple time steps. Budinski [20] then extended the work to Navier-Stokes equations in streamfunction-vorticity formulation. Then, velocity-field updates during each time step means that quantum-circuit implementation of convection terms cannot be re-used during multiple timestep and that the ’classical’ value of uu (as well as other flow field data) is needed to define the quantum circuit implementation of for the next time step. This shows that it is the non-linearity that forces the use of a hybrid quantum/classical approach, similar to previous work where Navier-Stokes equations were discretized, e.g. the hybrid quantum/classical algorithms for fluid simulations based on quantum-Poisson solvers [17].

In summary, key challenges for the hybrid quantum/classical approach are: i) Cost and complexity of (repeated) measurements; ii) Statistical noise due to sampling of the quantum solution; iii) Cost and complexity of (repeated) re-initialization.

Quantum fluid dynamics strategies. –

For the sake of concreteness, let us consider thw Navier-Stokes equations for time-dependent incompressible flows: write as follows:

∂u∂t+u⋅∂u∂x=−∂P∂x+νΔu(2)\frac{\partial u}{\partial t} + u \cdot\frac{\partial u}{\partial x} = -\frac{\partial P}{\partial x} + \nu\Delta u \tag*{(2)}
∇⋅u=0(3)\nabla\cdot\mathbf{u} = 0 \tag*{(3)}

where u\mathbf{u} is the velocity vector, PP pressure, defined for location x\mathbf{x} as function of time tt. The kinematic viscosity (assumed independent of temperature) is defined by ν\nu and density has been conventionally set to a unit constant value. Equation (3) enforces mass conservation, while Equation (2) is based on momentum conservation in each coordinate direction. Equations (2) and (3) highlight that it is the convection term that represents the non-linearity, i.e. the second term on the left-hand side of Equation (2). Writing the Navier-Stokes equations in non-dimensional form, such that x\mathbf{x} and u\mathbf{u} are scaled by reference length LrefL_{ref} and UrefU_{ref}, respectively, it follows that in Equation (2) the term ν\nu is replaced by 1/Re1/Re, where Reynolds number Re=UrefLref/νRe = U_{ref}L_{ref}/\nu. For Stokes flow, i.e. with Reynolds approaching 0, nonlinear terms are vanishingly small, but still not to be neglected since they are responsible for non trivial long-range correlations especially important in biological flows [18]. For high Reynolds number (turbulent) flows, obviously the nonlinear terms play the leading role.

In the following we present a cursory view of various existing strategies to simulate fluid dynamics on quantum computers.

Nonlinear quantum ODE solvers.

A straight approach to quantum simulation of fluids consists in tackling the non-linearity head-on, without trying to establish any parallel to quantum mechanics. In this case, one would discretize the Navier-Stokes equations, turn them into set of nonlinear ODE’s, to be solved by appropriate quantum nonlinear ODE solvers. Symbolically:

dudt=f(u)(4)\frac{d\mathbf{u}}{dt} = f(\mathbf{u}) \tag*{(4)}

where u\mathbf{u} is a shorthand for the full set of unknowns hosted by the computational grid. A standard time marching scheme yields

u(t+Δt)=u(t)+∫tt+Δtf(u(z)) dz(5)\mathbf{u}(t+\Delta t) = \mathbf{u}(t) + \int_{t}^{t+\Delta t} f(\mathbf{u}(z))\,dz \tag*{(5)}

and the quantum algorithm takes charge of performing the discrete summation implementing the time-integration at the right hand side.

This approach has been pioneered by Gaitan [19] for the case of a Laval nozzle with encouraging results on grids with O(30−60)O(30-60) grid points over 1400 timesteps. The dangling issue, though, is identification of an appropriate quantum oracle for evaluating the right hand side f(u)f(\mathbf{u}), a task that as already mentioned, Gaitan leaves to classical computers.

Nonlinear variational quantum eigenvalue solvers.

Always in the spirit of taking non-linearity head-on, but this time with a close eye to quantum physics, it has recently be proposed that variational quantum eigenvalue (VQE) solvers, a major tool of the QQ sector, might be extended to the fluid equations as well [24]. The basic idea behind VQE is to use quantum computing to construct variational eigenfunctions and minimize the energy functional through a classical procedure. In [24] the authors propose to use a similar technique for the Navier-Stokes equations, i.e 1) construct variational trial functions and 2) minimize the associated (dissipative) functional via a classical procedure. Formally, step 1 consists in expressing the flow field in variational form

u(x,t;λ)=∑nun(t)ϕn(x;λ)(6)\mathbf{u}(\mathbf{x},t;\lambda) = \sum_n \mathbf{u}_n(t)\phi_n(\mathbf{x};\lambda) \tag*{(6)}

where ϕn\phi_n is a suitable set of basis functions parametrically dependent on a set of variational parameters λ\lambda. Such variational parameters are then fixed by minimizing the energy dissipation functional D(λ)=ν∫(∇u(x;λ))2dxD(\lambda) = \nu\int(\nabla\mathbf{u}(\mathbf{x};\lambda))^2dx where the integral runs over the entire volume occupied by the fluid. The appeal of this idea is twofold: first, it may borrow a lot of QQ know-how, second it bypasses the issue of quantum time marching. We are not aware of any practical implementation of the idea, but best guess is that they will become available soon.

Linearization: Carleman embedding.

It is long known that any nonlinear problem can be mapped into a linear one in a space of higher dimensions, a technique also known as Carleman embedding or Carleman linearization [25]. Spatial discretization of the non-dimensional form of Equation (2) using a spatial grid consisting of l=1,Gl=1,G lattice sites, results in the following set of equations,

∂ul∂t=−ul⋅(∂u∂x)l−1ρ(∂P∂x)l+1Re(Δu)l(7)\frac{\partial u_l}{\partial t} = -u_l\cdot\left(\frac{\partial\mathbf{u}}{\partial x}\right)_l - \frac{1}{\rho}\left(\frac{\partial P}{\partial x}\right)_l + \frac{1}{Re}(\Delta u)_l \tag*{(7)}

where ( )l(\ )_l indicates that derivatives are evaluated at lattice site ll and ul\mathbf{u}_l represents the velocity vector at lattice site ll. Introducing indices mm and nn to denote interacting neighbors, and using Einstein summation, Equation (7) can be rewritten in terms of a linear operator L\mathcal{L} and quadratic operator Q\mathcal{Q}, as follows,

duldt=Llmulm+Re Qlmnumun(8)\frac{du_l}{dt} = \mathcal{L}_{lm}u_{lm} + Re\,\mathcal{Q}_{lmn}u_mu_n \tag*{(8)}

The pressure term was removed for simplicity, although this all but a minor item, since pressure-flow-stress coupling is going to heavily affect the structure of the Carleman matrix. At this stage, it should be noted that in the discretization of the velocity derivatives at lattice point ll, the values of the velocity at one or more neighboring lattice points is used. This means that when the Carleman linearization is used to introduce a new variable Vlm=ulumV_{lm}=u_lu_m to formally generate a linear system, marching the system of equations forward in time produces an ever growing hierarchy in which the Carleman variables at level kk involve the Carleman variables at the next level k+1k+1. Note that at each level we are faced with a tensor of rank kk, with O(Gk−1)O(G^{k-1}) independent components, kk being the sparsity of the Q\mathcal{Q} matrix. Furthermore the tensors occupy a neighborhood of the original field whose diameter grows linearly with the Carleman level. This shows that there is a major prize to pay to uplift the nonlinearity of the fluid equations, both in terms of increasing dimensionality and loss of locality.

Nevertheless, in [26] the authors present an algorithm based on Carleman linearization along with the use of a quantum linear system solution approach for the solution of the one-dimensional Burgers equation. The presented algorithm shows a polylog scaling with the number of grid points, i.e. an exponential improvement over classical approach. However, for a given time span TT, the algorithm shows a complexity T2Poly⁡(log⁡T)T^{2}\operatorname{Poly}(\log T), i.e. a significantly increased time-complexity compared to classical case. The authors simulate shock formation in a one-dimensional Burgers flow, with 16 grid points over 4000 time-steps, with a fourth order Carleman truncation. They reach Reynolds numbers up to 40, an order of magnitude larger than predicted by the theoretical no-go analysis, a welcome discrepancy which begs for further analysis.

The key question then is: how fast does the Carleman procedure converge as a function of the Reynolds number? As we shall see, preliminary results offer room for optimism.

Carleman Lattice Boltzmann.

The answer may depend on the chosen representation of the fluid equations, the Lattice Boltzmann (LB) method being a prominent candidate in this respect. In equations:

∂tfi+vi⋅∇fi=−fi−fieqτ(9)\partial_t f_i + \mathbf{v}_i \cdot\nabla f_i = -\frac{f_i-f_i^{eq}}{\tau} \tag*{(9)}

where f(x,v,t)=∑ifi(x,t)δ(v−vi)f(\mathbf{x},\mathbf{v},t)=\sum_i f_i(\mathbf{x},t)\delta(\mathbf{v}-\mathbf{v}_i), is the probability to find a representative particle with discrete velocity vi\mathbf{v}_i at position x\mathbf{x} and time tt, fieqf_i^{eq} is the corresponding discrete local equilibrium and τ\tau is a local relaxation time, fixing the viscosity of the lattice fluid. Importantly, the local equilibrium is a quadratic function of the Mach number Ma=u/csMa=u/c_s, csc_s being the speed of sound.

A key point of using the discrete-velocity Boltzmann formalism instead of Navier-Stokes is that, owing to the double dimensional phase-space, in the latter non-locality (streaming) is linear while non-linearity (collision) is local, while in Navier-Stokes the two merge into a single u∇u\mathbf{u}\nabla\mathbf{u} convective term. On classical computers this disentanglement proves extremely beneficial and the idea is that similar benefits apply to the quantum case as well. Indeed, most importantly for the quantum case, in the Boltzmann formulation the nonlinearity is not measured by the Reynolds number, but by the Mach number instead, which is typically well below 1, thereby dramatically lowering the nonlinearity barrier.

Based on the Lattice Boltzmann method, Itani et al. [27] employ Carleman linearization to develop an approach termed Carleman for second-quantized Lattice Boltzmann. This terminology stems from the fact that the Boltzmann operator, defined by: Bfi=−vi⋅∇fi−fi−fieqτ\mathcal{B}f_i=-\mathbf{v}_i\cdot\nabla f_i-\frac{f_i-f_i^{eq}}{\tau}, can be expressed in terms of the second-quantization annihilation and generation operators via the relation ∇=(a^−a^†)\nabla=(\hat{a}-\hat{a}^{\dagger}). As a result, the formal solution ft=eBtf0f_t=e^{\mathcal{B}t}f_0 can be computed in close analogy with quantum mechanics.

The quantum computing algorithm for streaming is based on the approach used by Steijl and co-workers [28], while collisions follow the bosonic encoding first proposed by Mezzacapo et al, whereby dissipative effects are represented as a weighted sum of two unitary operators [29]. The scheme is as “Feynmansque” as it can possibly get, as it builds on a one-to-one analogy between LB and the Dirac equation, first proposed in [30]. However, it is subject to a number of additional questions: primarily truncation effects due to the finite number of bosonic excitations and the long-time behaviour of non-unitarity errors [31].

Recently, Cheung and coworkers performed a Taylor-Green vortex simulation based on a Carleman-LB scheme, showing excellent agreement at moderate Mach number, with just three Carleman iterations [32]. Although much more work is needed to consolidate these preliminary results, there appears to be room for some optimism on the use of Lattice-Boltzmann-Carleman quantum computing schemes.

Functional Liouville Approach.

The Carleman embedding provides a linearization of the actual equations of fluid motion. An alternative procedure is to take the statistical dynamics approach, whereby one seeks the probability distribution function (PDF) of the fluid velocity field [33]. This is formally straightforward since the PDF obeys a functional continuity equation, best know as Liouville equation:

∂tP[u]+δδu(f(u)P[u])=0(10)\partial_t P[\mathbf{u}]+\frac{\delta}{\delta\mathbf{u}}\big(f(\mathbf{u})P[\mathbf{u}]\big)=0 \tag*{(10)}

where P=P[u]P=P[\mathbf{u}] is the functional PDF and u˙=f(u)\dot{\mathbf{u}}=f(\mathbf{u}) is the nonlinear equation of motion (hence f(u)f(\mathbf{u}) is an operator in function space). Note that regardless of the nonlinearity of the dynamics, reflected by f(u)f(\mathbf{u}), the functional equation is linear, by construction. Once the fluid equations are discretized on a grid with GG lattice nodes, the Liouville distribution PGP_G becomes a GG-variate PDF PG(u1…uG)P_G(u_1\ldots u_G) which lives in a O(G)O(G)-dimensional space, where for large-scale turbulent flow applications, GG can reach values of multi-billions. However, it should be noted that for most practical purposes, the GG-body Liouville PDF is an hotel with vastly more rooms than customers, meaning that (much) lower order marginals often suffice to deliver the essential physical information. Key to the success of the program is the ability to find an appropriate closure, namely an effective kinetic equation for the lower order marginals. This is a classical topic in non-equilibrium statistical physics, which may draw significant benefits from modern developments in tensor networks theory [34, 35].

In [36], the authors develop a general and elegant framework based on the Koopman-von Neumann and the levelset approach to classical nonlinear field theories [36]. The formalism is applied to hyperbolic PDE’s and Hamilton-Jacobi equations, but its extension to the Navier-Stokes equations is addressed only marginally, making it difficult to draw firm conclusions.

Quantum-Fluid Duality: Inverse Madelung Transform.

Formal analogies between quantum mechanics and fluid dynamics have been noted since the early days of quantum physics, most notably with the work of Madelung, who noted that upon writing the wavefunction in eikonal form Ψ=ρ1/2eiθ\Psi= \rho^{1/2}e^{i\theta}, the imaginary part of the Schroedinger equation turns into the continuity equation, while the real one provides the follow madelung fluid equation

∂tu+u⋅∇u=−∇(VC+VQ)(11)\partial_t\mathbf{u}+\mathbf{u}\cdot\nabla\mathbf{u}=-\nabla(V_C+V_Q) \tag*{(11)}

where u=(ℏ/m)∇θ\mathbf{u}=(\hbar/m)\nabla\theta is the fluid velocity, VCV_C the classical potential and VQ=(ℏ2/2m)ρ−1/2Δρ1/2V_Q=(\hbar^2/2m)\rho^{-1/2}\Delta\rho^{1/2} is the so-called quantum potential. The Madelung formulation shows that the Schroedinger equation behaves like an inviscid, irrotational fluid subject to the classical potential VCV_C plus a genuinely quantum potential VQV_Q. This analogy has interesting interpretations for the hidden-variables theory of quantum mechanics, which are beyond scope of this Perspective. Here we simply wish to highlight its operational value, i.e. it permits to solve quantum problems using numerical methods for fluids. In the context of quantum computing, we are interested in taking the opposite path, namely using quantum computers to solve fluid problems in quantum mechanical vests. This is a fascinating possibility, with the major caveat that the Madelung fluid is a far distant relative of classical Navier-Stokes fluids, the main points of departure being i) dissipation, ii) non-gradient flow, iii) absence of quantum potential. Very recent work has shown how to mend points ii) and iii) using quaternions, but still leaves item i) open [37]. It is of decided interest to explore whether a generalized Schroedinger equation matching exactly Navier-Stokes fluids can be found and efficiently simulated on quantum computers.

Low-Reynolds flows. –

Last but definitely not least, the physics of fluids is littered with interesting problems at low-Reynolds, especially in microfluidics, soft matter and biology [38, 39, 40]. For instance, it would be of great interest to devise a quantum multi-scale application, coupling quantum algorithms for biomolecules swimming in a water solvent described by a quantum algorithm for low-Reynolds fluid flow. Given that low-Reynolds flows are nonlocal, perhaps the inherent nonlocality of quantum mechanics could prove helpful in representing the classical nonlocality of low-Reynolds flows.

Conclusions. –

In summary, we have presented a survey of the main current approaches to the quantum simulation of classical fluids. Various obstacles stand in the way of the efficient simulation of fluid flows on quantum computers, especially at high-Reynolds numbers, mostly on account of the strong nonlinear effects. A few ways out have been illustrated, but their practical implementation commands major advances in quantum technology [41]. On philosophical grounds, it can’t be ruled out that high Reynolds flows would show ”classical advantage”, namely no quantum algorithm can ever beat a classical one beyond a given threshold of nonlinearity. Indeed, as observed earlier on, while it is true that Nature isn’t classical, it is equally true that Nature has a very strong innate tendency to become classical at macroscopic scales/high temperatures. Assessing to what extent quantum computers can withstand such tendency, or possibly even take advantage of it, is not only of practical but also of major foundational interest. Quantum computers offer indeed a unique opportunity to ask questions that the founding fathers of quantum mechanics could only formulate as ”Gedanken Experiments”.

Schematic of the quantum-fluid duality

Figure 3. Schematics of the quantum-fluid duality. The Schroedinger equation (SCE) maps one to one to the Madelung fluid (MAF), which is compressible, inviscid, irrotational and subject to quantum potential (pressure). The idea of the inverse Madelung transform is to generate a generalized Schroedinger equation (GSCE) equivalent to the compressible Navier-Stokes fluid. By solving the GSCE on a quantum computer one would then solve the Navier-Stokes physics.

    • *

The authors have benefited from valuable discussions with many colleagues, particularly S.S. Bharadwaj, D. Buaria, P. Coveney, N. Defenu, G. Galli, M. Grossi, B. Huang, A. Mezzacapo, S. Ruffo, A. Solfanelli and T. Weaving. S.S. wishes to acknowledge enlightening discussion with M. Berry. He also acknowledges financial support form the Italian National Centre for HPC, Big Data and Quantum Computing (CN00000013).

References

  1. [1]M.A. Nielson, I.L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition, Cam- bridge University Press, 2010.
  2. [2]R. Feynman, Simulating Physics with Computers, Int. J. Mod Phys, 6, 467, (1982)
  3. [3]D. Deutsch, Quantum theory, the Church–Turing principle and the universal quantum computer, Proceedings of the Royal Society of London A. 400(1818):97-117, (1985)DOI
  4. [4]J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum, 2, 79, (2018)DOI
  5. [5]https://www.ibm.com/quantum/roadmap
  6. [6]S. Bravyi, O. Dial, J.M. Gambetta, D. Gil and Z. Nazario, The future of quantum computing with superconducting qubits, Journal of Applied Physics, 132(16) 160902 (2022)DOI
  7. [7]J. Yepez, Quantum lattice-gas models for computational fluid dynamics, Phys. Rev. E, 63, 046702, (2001)pubmed.ncbi.nlm.nih.gov/11308976
  8. [8]W. Kohn, Nobel Lecture: Electronic structure of matter—wave functions and density functionals, Rev. Mod. Phys., 71, 1253, (1999)DOI
  9. [9]P. JJ O’Malley et al, Scalable quantum simulation of molecular energies, Phys. Rev. X, 6(3) 031007, (2016)
  10. [10]C. Vorwerk, N. Sheng, M. Govoni, B. Huang and G. Galli, Quantum embedding theories to simulate condensed systems on quantum computers, Nat. Comput. Sci. 2, 424 (2022)arxiv.org/abs/2105.04736
  11. [11]SS Bharadwaj, KR Sreenivasan Quantum computation of fluid dynamics, arXiv preprint arXiv:2007.09147, 15 (2020)DOI
  12. [12]M. Sprague, S. Boldyrev, P. Fischer, R. Grout, W.I. Gustafson and R. Moser, Turbulent flow simulations at the Exascale: opportunities and challenges workshop, Aug 4-5, 2015, Washington D.C. (2017)
  13. [13]F. Tennie and TN Palmer, Quantum computers for weather and climate prediction: the good the bad and the noisy, arXiv:2210.17460v1 [quant-ph] 31 Oct 2022DOI
  14. [14]K. P. Griffin, S. S. Jain, T. J. Flint and D W. H. R. Chan. Investigation of quantum algorithms for direct numerical simulation of the Navier-Stokes equations. Center for Turbulence Research Annual Research Briefs, 347 (2019)DOI
  15. [15]A.W. Harrow, A. Hassidim, S. Lloyd, Quantum Algorithm for Linear Systems of Equations, Phys. Rev. Lett., 103 (15), 150502 (2009)pubmed.ncbi.nlm.nih.gov/19905613
  16. [16]G. Brassard, P. Høyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, AMS Contemporary Mathematics, 305:53-74, (2002)DOI
  17. [17]R. Steijl, Quantum algorithms for fluid simulations, http://dx.doi.org/10.5722/intechopen.86685 (2019)
  18. [18]M. Bernaschi, S. Melchionna, S. Succi, Mesoscopic simulations at the physics-chemistry-biology interface, Rev. of Mod. Phys., 91 (2), 025004 (2019)DOI
  19. [19]F. Gaitan, Finding flows of a Navier-Stokes fluid through quantum computing, Npj Quantum Information, 60 (2020)DOI
  20. [20]L. Budinski, Quantum algorithm for the Navier–Stokes equations by using the streamfunction-vorticity formulation and the lattice Boltzmann method, International Journal of Quantum Information, 20 (2), 2150039, (2022)DOI
  21. [21]B. Kacewicz, Randomized and Quantum Algorithms Yield a Speed-Up for Initial Value Problems, arXiv:quant-ph/0311148, 21 Nov 2003DOI
  22. [22]L. Budinski, Quantum algorithm for the advection–diffusion equation simulated with the Lattice Boltzmann method, Quantum Information Processing, 20 (2), 57, (2021)DOI
  23. [23]S. Succi, The Lattice Boltzmann Equation (for fluids and beyond), Oxford Univ. Press, (2001)
  24. [24]M. Lubasch, J. Joo, P. Moinier, M. Kiffner, D. Jaksch, Variational quantum algorithms for nonlinear problems, Phys. Rev. A 101 (1), 010301(R) (2021)DOI
  25. [25]T. Carleman, Application of the theory of linear integration equations to nonlinear systems of differential equations, Acta Mathematica, 59, 63 (1932)
  26. [26]J.P. Liu, H. O. Kolden, H. K. Krovi et al, Efficient quantum algorithm for dissipative nonlinear differential equations, PNAS, 118(35) e2026805118 (2021)DOI
  27. [27]W. Itani and S. Succi, Analysis of Carleman linearization of lattice Boltzmann Fluids, 7 (1) 24, (2022)DOI
  28. [28]B.N. Todorova, R. Steijl, Quantum Algorithm for the collisionless Boltzmann equation, J. Comp. Phys., 409, 109347, (2020)DOI
  29. [29]A Mezzacapo, M Sanz, L Lamata, IL Egusquiza, S Succi, E Solano, Quantum simulator for transport phenomena in fluid flows, Scientific reports 5 (1), 1-7 (2015)DOI
  30. [30]S. Succi, R. Benzi, Lattice Boltzmann equation for quantum mechanics, Physica D: Nonlinear Phenomena 69 (3-4), 327-332 (1993)DOI
  31. [31]W. Itani, K. Sreenivasan and S. Succi, Quantum Algorithm for Lattice Boltzmann (QALB) Simulation of Incompressible Fluids with a Nonlinear Collision Term, arXiv preprint arXiv:2304.05915, (2023)arxiv.org/abs/2304.05915
  32. [32]X. Li, X. Yin, N. Wiebe, J. Chun, GK Schenter, M. Cheung, J. Muelmenstadt, Potential quantum advantage for simulation of fluid dynamics, arXiv:2303.16550v2[quant-ph] 8 Apr 2023DOI
  33. [33]S. Succi, W. Itani, K. Sreenivasan and R. Steijl, Ensemble fluid dynamic simulations on quantum computers, arXiv preprint arXiv:2304.05915
  34. [34]R. Orus, Tensor networks for complex quantum systems, Nature Reviews, 538, (1), September 2019.DOI
  35. [35]N. Gourianov, M. Lubasch, S. Dolgov et al, A quantum-inspired approach to exploit turbulence structures, Nature Comp. Sci., 2, 30-37, (2022)DOI
  36. [36]S. Jin, N. Liu, Y. Yu, Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations, J. Comp. Phys., 487, 112149, (2023)DOI
  37. [37]Z. Meng and Y, Yang, Quantum computing of fluid dynamics using the hydrodynamic Schroedinger equation, arXiv:2302.09741.v1 [physics-flu-dyn] 20 Feb 2023DOI
  38. [38]HA Stone, AD Stroock, A Ajdari, Engineering flows in small devices: Microfluidics Toward a Lab-on-a-Chip, Annu. Rev. Fluid Mech. 2004. 36:381–411 (2004)DOI
  39. [39]F Diotallevi, L Biferale, S Chibbaro, A Lamura, G Pontrelli, M Sbragaglia, S. Succi, Capillary filling using lattice Boltzmann equations: The case of multi-phase flows, The European Physical Journal Special Topics 166, 111-116, (2009)arxiv.org/abs/0707.0945
  40. [40]S. Succi, The Lattice Boltzmann Equation for Complex States of Flowing Matter, Oxford Univ. Press, (2018)
  41. [41]S. Das Sarma, Quantum computing has a hype problem, MIT Technological Review, March 28, (2022) https://www.technologyreview.com/2022/03/28/1048355/quantum-computing-has-a-hype-problem/

Paper details

vlnc:W_6z55uqjz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents