Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2312.09784 · Physical Review A

Quantum algorithm for solving the advection equation using Hamiltonian simulation

Peter Brearley, Sylvain Laizet

Published Jul 9, 2024• 38 citations
arXivHTMLPDF

Abstract

A quantum algorithm for solving the advection equation by embedding the discrete time-marching operator into Hamiltonian simulations is presented. One-dimensional advection can be simulated directly since the central finite-difference operator for first-order derivatives is anti-Hermitian. Here this is extended to industrially relevant multidimensional flows with realistic boundary conditions and arbitrary finite-difference stencils. A single copy of the initial quantum state is required and the circuit depth grows linearly with the required number of time steps, the sparsity of the time-marching operator, and the inverse of the allowable error. State-vector simulations of a scalar transported in a two-dimensional channel flow and lid-driven cavity configuration are presented as a proof of concept of the proposed approach. Published by the American Physical Society 2024

DOI
10.1103/physreva.110.012430

Related papers

Quantum algorithm for the advection-diffusion equation by direct block encoding of the time-marching operator

Paul Over, Sergio Bengoechea, Peter Brearley +2 more

A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic success probability of the squared solution norm without the need for amplitude amplification, thereby retaining a linear dependence on the simulation time. The algorithm separates the explicit time-marching operator into an advection-like component and a corrective shift operator. The advection-like component is mapped to a Hamiltonian simulation and combined with the shift operator through the linear combination of unitaries algorithm. State-vector simulations of a scalar transported in a steady two-dimensional Taylor-Green vortex support the theoretical findings.

arXiv:2410.07909•Physical Review A•Jun 4, 2025•21 citations

Quantum algorithm for the advection-diffusion equation by direct block encoding of the time-marching operator

Over, Paul, Sergio Bengoechea, Peter Brearley +2 more

A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic success probability of the squared solution norm without the need for amplitude amplification, thereby retaining a linear dependence on the simulation time. The algorithm separates the explicit time-marching operator into an advection-like component and a corrective shift operator. The advection-like component is mapped to a Hamiltonian simulation and combined with the shift operator through the linear combination of unitaries algorithm. State-vector simulations of a scalar transported in a steady two-dimensional Taylor-Green vortex support the theoretical findings.

•Jul 1, 2025•0 citations

Spectral quantum algorithm for passive scalar transport in shear flows

Philipp Pfeffer, Peter Brearley, Sylvain Laizet +1 more

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.

arXiv:2505.10136•Scientific Reports•Nov 21, 2025•6 citations

Quantum dynamics simulation of the advection-diffusion equation

Hirad Alipanah, Feng Zhang, Yong-Xin Yao +6 more

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 − 5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

arXiv:2503.13729•Physical Review Research•Oct 19, 2025•16 citations

Quantum HHL Algorithm for Solving 1D Linear Advection Equation Using Explicit and Implicit Finite Difference Schemes

Batuhan Yalcin, Lucy Zhang

This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.

arXiv:2611.01167•Oct 31, 2026•0 citations

Hamiltonian Simulation for Solving the Advection Equation With Arbitrary Velocity Field

Niladri Gomes, Gautam Sharma, Jay Pathak

We present a novel approach to solving the advection equation under arbitrary velocity fields using a quantuminspired ‘Schrödingerisation’ technique for Hamiltonian simulation. Although numerous methods exist for solving partial differential equations (PDEs), Hamiltonian simulation remains a relatively underexplored yet promising direction-particularly in the context of long-term, fault-tolerant quantum computing. Building on this potential, our quantum algorithm is designed to accommodate non-trivial, spatially varying velocity fields and is applicable to both 2D and 3D advection problems. To ensure numerical stability, the algorithm incorporates an upwinding discretization scheme, which we adapt for quantum implementation through a combination of approximation and optimization techniques. We demonstrate the algorithm's effectiveness on benchmark cases involving rotational and shear flows in two and three dimensions. Moreover, we successfully implement the 2D advection equation using 16 qubits on IBM Quantum hardware, validating the approach and showcasing its practical applicability and robustness.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
A quantum algorithm for solving the advection equation by embedding the discrete time-marching operator into Hamiltonian simulations is presented. One-dimensional advection can be simulated directly since the central finite-difference operator for first-order derivatives is anti-Hermitian. Here this is extended to industrially relevant multidimensional flows with realistic boundary conditions and arbitrary finite-difference stencils. A single copy of the initial quantum state is required and the circuit depth grows linearly with the required number of time steps, the sparsity of the time-marching operator, and the inverse of the allowable error. State-vector simulations of a scalar transported in a two-dimensional channel flow and lid-driven cavity configuration are presented as a proof of concept of the proposed approach. Published by the American Physical Society 2024
A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic success probability of the squared solution norm without the need for amplitude amplification, thereby retaining a linear dependence on the simulation time. The algorithm separates the explicit time-marching operator into an advection-like component and a corrective shift operator. The advection-like component is mapped to a Hamiltonian simulation and combined with the shift operator through the linear combination of unitaries algorithm. State-vector simulations of a scalar transported in a steady two-dimensional Taylor-Green vortex support the theoretical findings.
A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic success probability of the squared solution norm without the need for amplitude amplification, thereby retaining a linear dependence on the simulation time. The algorithm separates the explicit time-marching operator into an advection-like component and a corrective shift operator. The advection-like component is mapped to a Hamiltonian simulation and combined with the shift operator through the linear combination of unitaries algorithm. State-vector simulations of a scalar transported in a steady two-dimensional Taylor-Green vortex support the theoretical findings.
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.
The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 − 5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.
This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.
We present a novel approach to solving the advection equation under arbitrary velocity fields using a quantuminspired ‘Schrödingerisation’ technique for Hamiltonian simulation. Although numerous methods exist for solving partial differential equations (PDEs), Hamiltonian simulation remains a relatively underexplored yet promising direction-particularly in the context of long-term, fault-tolerant quantum computing. Building on this potential, our quantum algorithm is designed to accommodate non-trivial, spatially varying velocity fields and is applicable to both 2D and 3D advection problems. To ensure numerical stability, the algorithm incorporates an upwinding discretization scheme, which we adapt for quantum implementation through a combination of approximation and optimization techniques. We demonstrate the algorithm's effectiveness on benchmark cases involving rotational and shear flows in two and three dimensions. Moreover, we successfully implement the 2D advection equation using 16 qubits on IBM Quantum hardware, validating the approach and showcasing its practical applicability and robustness.