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

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

Over, Paul, Sergio Bengoechea, Peter Brearley, Sylvain Laizet, Thomas Rung

Published Jul 1, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.15480/882.15368

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 time-marching algorithms for solving linear transport problems including boundary conditions

Sergio Bengoechea, Paul Over, Thomas Rung

This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while arbitrary boundary conditions are enforced by the method of images only at the cost of one additional qubit per spatial dimension. As an alternative to the non-periodic reflection, the direct encoding of Neumann conditions by the unitary decomposition of the discrete time-marching operator is proposed. All presented algorithms indicate optimal success probabilities while maintaining linear time complexity, thereby securing the practical applicability of the quantum algorithm on fault-tolerant quantum computers. The proposed time-marching method is demonstrated through state-vector simulations of the heat equation in combination with Neumann, Dirichlet, and mixed boundary conditions.

quant-pharXiv:2511.04271•International Journal for Numerical Methods in Engineering•Nov 7, 2025•5 citations

Quantum algorithm for solving the advection equation using Hamiltonian simulation

Peter Brearley, Sylvain Laizet

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

arXiv:2312.09784•Physical Review A•Jul 9, 2024•38 citations

A quantum advection-diffusion solver using the quantum singular value transform

Gard Olav Helle, Tommaso Benacchio, Anna Bomme Ousager +1 more

We present a quantum algorithm for the simulation of the linear advection-diffusion equation based on block encodings of high order finite-difference operators and the quantum singular value transform. Our complexity analysis shows that the higher order methods significantly reduce the number of gates and qubits required to reach a given accuracy. The theoretical results are supported by numerical simulations of one- and two-dimensional benchmarks.

quant-pharXiv:2512.22163•Dec 18, 2025•0 citations

Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems

I. Novikau, Ilon Joseph

We propose an explicit algorithm based on the Linear Combination of Hamiltonian Simulations technique to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman–von Neumann formulation of nonlinear dynamics . By including dissipation into the model, through an upwind discretization of the advection operator, we avoid spurious parasitic oscillations which usually accompany standard finite difference discretizations of the advection equation. In contrast to prior works on quantum simulation of nonlinear problems , we explain in detail how different components of the algorithm can be implemented by using the Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) methods. In addition, we discuss the general method for implementing the block-encoding (BE) required for QSP and QSVT circuits and provide explicit implementations of the BE oracles tailored to our specific test cases. We simulate the resulting circuit on a digital emulator of quantum fault-tolerant computers and investigate its complexity and success probability. The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations including the KvN and Carleman embeddings of nonlinear systems , the semiclassical Koopman-van Hove (KvH) equation, as well as the advection and Liouville equations.

arXiv:2410.03985•Computer Physics Communications•Jan 8, 2025•26 citations

A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation

David M. Wawrzyniak, Josef M. Winter, Steffen J. Schmidt +4 more

We present a versatile and efficient quantum algorithm based on the Lattice Boltzmann method (LBM) approximate solution of the linear advection-diffusion equation (ADE). We emphasize that the LBM approximation modifies the diffusion term of the underlying exact ADE and leads to a modified equation (mADE). Due to its versatility in terms of operator splitting, the proposed quantum LBM algorithm for the mADE provides a building block for future quantum algorithms to solve the linearized Navier-Stokes equation on quantum computers. We split the algorithm into four operations: initialization, collision, streaming, and calculation of the macroscopic quantities. We propose general quantum building blocks for each operator, which adapt intrinsically from the general three-dimensional case to smaller dimensions and apply to arbitrary lattice-velocity sets. Based on (sub-linear) amplitude data encoding, we propose improved initialization and collision operations with reduced complexity and efficient sampling-based simulation. Quantum streaming algorithms are based on previous developments. The proposed quantum algorithm allows for the computation of successive time steps, requiring full state measurement and reinitialization after every time step. It is validated by comparison with a digital implementation and based on analytical solutions in one and two dimensions. Furthermore, we demonstrate the versatility of the quantum algorithm for two cases with non-uniform advection velocities in two and three dimensions. Various velocity sets are considered to further highlight the flexibility of the algorithm. We benchmark our optimized quantum algorithm against previous methods employed in sampling-based quantum simulators. We demonstrate sampling efficiency, with sampling accelerated convergence requiring fewer shots. • Novel LBM quantum algorithm for solving the linear advection-diffusion equation with variable velocity as a building block. • Modular quantum algorithm for 1 through 3 spatial dimensions and all common lattice-velocity sets. • Significant reduction in quantum-algorithm complexity achieved through efficient encoding strategy leveraging symmetries. • Improved collision quantum-algorithm building block leading to higher success rates for the collision operator. • Benchmarking shows faster convergence and reduced shot requirements compared to previous algorithms.

Computer Physics Communications•Sep 10, 2024•38 citations
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.
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while arbitrary boundary conditions are enforced by the method of images only at the cost of one additional qubit per spatial dimension. As an alternative to the non-periodic reflection, the direct encoding of Neumann conditions by the unitary decomposition of the discrete time-marching operator is proposed. All presented algorithms indicate optimal success probabilities while maintaining linear time complexity, thereby securing the practical applicability of the quantum algorithm on fault-tolerant quantum computers. The proposed time-marching method is demonstrated through state-vector simulations of the heat equation in combination with Neumann, Dirichlet, and mixed boundary conditions.
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
We propose an explicit algorithm based on the Linear Combination of Hamiltonian Simulations technique to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman–von Neumann formulation of nonlinear dynamics . By including dissipation into the model, through an upwind discretization of the advection operator, we avoid spurious parasitic oscillations which usually accompany standard finite difference discretizations of the advection equation. In contrast to prior works on quantum simulation of nonlinear problems , we explain in detail how different components of the algorithm can be implemented by using the Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) methods. In addition, we discuss the general method for implementing the block-encoding (BE) required for QSP and QSVT circuits and provide explicit implementations of the BE oracles tailored to our specific test cases. We simulate the resulting circuit on a digital emulator of quantum fault-tolerant computers and investigate its complexity and success probability. The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations including the KvN and Carleman embeddings of nonlinear systems , the semiclassical Koopman-van Hove (KvH) equation, as well as the advection and Liouville equations.
We present a versatile and efficient quantum algorithm based on the Lattice Boltzmann method (LBM) approximate solution of the linear advection-diffusion equation (ADE). We emphasize that the LBM approximation modifies the diffusion term of the underlying exact ADE and leads to a modified equation (mADE). Due to its versatility in terms of operator splitting, the proposed quantum LBM algorithm for the mADE provides a building block for future quantum algorithms to solve the linearized Navier-Stokes equation on quantum computers. We split the algorithm into four operations: initialization, collision, streaming, and calculation of the macroscopic quantities. We propose general quantum building blocks for each operator, which adapt intrinsically from the general three-dimensional case to smaller dimensions and apply to arbitrary lattice-velocity sets. Based on (sub-linear) amplitude data encoding, we propose improved initialization and collision operations with reduced complexity and efficient sampling-based simulation. Quantum streaming algorithms are based on previous developments. The proposed quantum algorithm allows for the computation of successive time steps, requiring full state measurement and reinitialization after every time step. It is validated by comparison with a digital implementation and based on analytical solutions in one and two dimensions. Furthermore, we demonstrate the versatility of the quantum algorithm for two cases with non-uniform advection velocities in two and three dimensions. Various velocity sets are considered to further highlight the flexibility of the algorithm. We benchmark our optimized quantum algorithm against previous methods employed in sampling-based quantum simulators. We demonstrate sampling efficiency, with sampling accelerated convergence requiring fewer shots. • Novel LBM quantum algorithm for solving the linear advection-diffusion equation with variable velocity as a building block. • Modular quantum algorithm for 1 through 3 spatial dimensions and all common lattice-velocity sets. • Significant reduction in quantum-algorithm complexity achieved through efficient encoding strategy leveraging symmetries. • Improved collision quantum-algorithm building block leading to higher success rates for the collision operator. • Benchmarking shows faster convergence and reduced shot requirements compared to previous algorithms.