Spectral quantum algorithm for passive scalar transport in shear flows
Philipp Pfeffer, Peter Brearley, Sylvain Laizet, Jörg Schumacher
TL;DR
The paper tackles non-unitary advection–diffusion of a passive scalar in fluids using a spectral quantum algorithm. It leverages the quantum Fourier transform to diagonalize advection and diffusion operators, and employs operator splitting (Lie–Trotter and Strang) to manage non-commuting terms in 2D laminar shear flows, while implementing boundary conditions via quantum cosine/sine transforms. Explicit quantum circuits are derived for advection, diffusion, and Neumann/Dirichlet boundaries, with statevector simulations validating accuracy and near-term hardware experiments on IBM and IonQ platforms demonstrating practical feasibility. The work suggests a viable path for quantum-accelerated CFD on regular meshes, with gate counts that scale polylogarithmically in grid size and clear guidance for future hardware improvements.
Abstract
The mixing of scalar substances in fluid flows by stirring and diffusion is ubiquitous in natural flows, chemical engineering, and microfluidic drug delivery. Here, we present a spectral quantum algorithm for scalar mixing by solving the advection-diffusion equation in a quantum computational fluid dynamics framework. The exact gate decompositions of the advection and diffusion operators in spectral space are derived. For all but the simplest one-dimensional flows, these operators do not commute. Therefore, we use operator splitting to construct quantum circuits capable of simulating arbitrary polynomial velocity profiles in multiple dimensions, such as the Blasius profile of a laminar boundary layer. Periodic, Neumann, and Dirichlet boundary conditions can be imposed with the appropriate quantum spectral transform. We evaluate the approach in statevector simulations of a Couette flow, plane Poiseuille flow, and a polynomial Blasius profile approximation. For an advection-diffusion problem in one dimension, we compare the time evolution of an ideal quantum simulation with those of real quantum computers with superconducting and trapped-ion qubits. The required number of two-qubit gates grows with the logarithm of the number of grid points raised to one higher power than the order of the polynomial velocity profile.
