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:2503.05393 · Physics of Fluids

Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks

Rhonda Au-Yeung, Viv M. Kendon, Steven Lind

Published May 1, 2025• 9 citations
arXivHTMLPDF

Abstract

Recent years have seen great progress in quantum computing, providing opportunities to overcome computational bottlenecks in many scientific applications. In particular, the intersection of computational fluid dynamics and quantum computing has become an active area of research with exponential computational speedup as an ultimate goal. In this work, we propose a quantum algorithm for the time-dependent smoothed particle hydrodynamics (SPH) method. Our algorithm uses concepts from discrete-time quantum walks to solve the one-dimensional advection partial differential equation via an SPH formalism. Hence, we construct a quantum circuit to carry out the calculations for a two-particle system over one, two, and three time steps. We compare its outputs with results from the classical SPH algorithm and show there is excellent agreement. The methodology and findings, here, are a key step toward developing a more general quantum SPH algorithm for solving practical engineering problems on gate-based quantum computers.

DOI
10.1063/5.0268240

Related papers

Quantum algorithm for smoothed particle hydrodynamics

Rhonda Au-Yeung, A. J. Williams, Viv M. Kendon +1 more

We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method. We use a normalization procedure to encode the SPH operators and domain discretization in a quantum register. We then perform the SPH summation via an inner product of quantum registers. Using a one-dimensional function, we test the approach in a classical sense for the kernel sum and first and second derivatives of a one-dimensional function, using both the Gaussian and Wendland kernel functions, and compare various register sizes against analytical results. Error convergence is exponentially fast in the number of qubits. We extend the method to solve the one-dimensional advection and diffusion partial differential equations, which are commonly encountered in fluids simulations. This work provides a foundation for a more general SPH algorithm, eventually leading to highly efficient simulations of complex engineering problems on gate-based quantum computers.

arXiv:2006.06719•Computer Physics Communications•Sep 4, 2023•11 citations

A Quantum Computing Algorithm for Smoothed Particle Hydrodynamics

A. J. Williams, Steven Lind

This paper presents a quantum computing algorithm for the determination of function and gradient approximations in the Smoothed Particle Hydrodynamics (SPH) method. The SPH operators and domain discretisation are encoded in a quantum register using a careful normalisation procedure. The SPH summation is then performed via an inner product of quantum registers. This approach is tested in a classical sense for the kernel sum and first and second gradients of a function, using both the Gaussian and Wendland kernel functions, with comparisons for various register sizes made against analytical results. Error convergence is exponential in the number of qubits. It is hoped that this one-dimensional work will provide the foundation for a more general SPH algorithm, eventually leading to the highly efficient simulation of complex engineering problems on emerging quantum computers.

•Jun 11, 2020•0 citations

A Novel Hierarchy of Quantum Kernel Networks on Smoothed Particle Hydrodynamics

Yudong Li, Wenkui Shi, Chunfa Wang +3 more

This study proposed the hierarchy of quantum kernel networks by combing multi quantum networks with smoothed particle hydrodynamics (SPH). The Lagrangian quantum network model was further developed based on an improved quantum multilayer perceptron (QMLP). A sequential hybrid quantum-classical framework was constructed to ensure robust particle gradient-based optimization and mitigate barren plateaus for computational particle dynamics. This approach combines smoothing kernels with quantum learning, establishing a novel quantum intelligent particle paradigm. The framework was validated through some benchmarks on multifarious quantum neural networks, static multi-level vortex reconstructions and transient scalar advective transports. Numerical results show that while elementary quantum circuits struggle with generalization in unstructured domains, the hybrid crossed-QMLP matches the fitting accuracy of classical SPH in quantum optimized space. Despite current limitations in computational efficiency and hardware implementation, this work paves the way for a new investigation on quantum-particle approach by mapping unstructured Lagrangian particle topologies into integrated quantum networks.

quant-pharXiv:2604.24159•Apr 28, 2026•0 citations

A probabilistic imaginary-time evolution quantum algorithm for advection-diffusion equation: Explicit gate-level implementation and comparisons to quantum linear system algorithms

Xinchi Huang, Hirofumi Nishi, Taichi Kosugi +2 more

Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we propose a quantum algorithm for solving the advection-diffusion-reaction equation by employing a novel approximate probabilistic imaginary-time evolution (PITE) operator. First, the effectiveness of the proposed approximate PITE operator is justified by the theoretical evaluation of the error. Next, we construct the explicit quantum circuit to realize the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation, whose gate complexity is logarithmic regarding the size of the discretized Hamiltonian matrix. Compared to the existing algorithms for the quantum linear system problem, our algorithm achieves an exponential speedup regarding the matrix size at the cost of a worse dependence on the error bound. Moreover, numerical simulations using gate-based quantum emulator for 1D/2D examples are also provided to verify our algorithm. Finally, we extend our algorithm to the coupled system of advection-diffusion equations to show the prospects for practical applications.

arXiv:2409.18559•Sep 27, 2024•11 citations

Quantum-Inspired Simulation of Fluid Dynamics

Jincheng Zhang

This paper explores the application of quantum-inspired algorithms to accelerate the simulation of fluid dynamics. Traditional computational fluid dynamics (CFD) methods, particularly those solving the Navier-Stokes equations, are often computationally expensive, limiting their applicability in real-time simulations and complex scenarios. This research investigates the potential of mimicking quantum phenomena, specifically wave interference and amplitude estimation, through the design and implementation of novel algorithms. The core idea is to leverage techniques inspired by quantum computing to achieve a significant speedup in solving these equations. We present a framework utilizing amplitude estimation to efficiently approximate solutions, offering a potential pathway to overcome the computational bottlenecks inherent in conventional CFD. The presented approach provides a novel methodology for simulating fluid dynamics with reduced computational cost, opening opportunities for advancements in areas such as aerospace, automotive, and weather forecasting.

•Sep 5, 2026•0 citations

Quantum computing of fluid dynamics using the hydrodynamic Schrödinger equation

Zhaoyuan Meng, Yue Yang

Simulating fluid dynamics on a quantum computer is intrinsically difficult due to the nonlinear and non-Hamiltonian nature of the Navier-Stokes equation (NSE). We propose a framework for quantum computing of fluid dynamics based on the hydrodynamic Schr\"odinger equation (HSE), which can be promising in simulating three-dimensional turbulent flows in various engineering applications. The HSE is derived by generalizing the Madelung transform to compressible or incompressible flows with finite vorticity and dissipation. Since the HSE is expressed as a unitary operator on a two-component wave function, it is more suitable than the NSE for quantum computing. The flow governed by the HSE can resemble a turbulent flow consisting of tangled vortex tubes with the five-thirds scaling of energy spectrum. We develop a prediction-correction quantum algorithm to solve the HSE. This algorithm is implemented for simple flows on the quantum simulator Qiskit with partial exponential speedup.

arXiv:2302.09741•Physical Review Research•Sep 12, 2023•93 citations
Recent years have seen great progress in quantum computing, providing opportunities to overcome computational bottlenecks in many scientific applications. In particular, the intersection of computational fluid dynamics and quantum computing has become an active area of research with exponential computational speedup as an ultimate goal. In this work, we propose a quantum algorithm for the time-dependent smoothed particle hydrodynamics (SPH) method. Our algorithm uses concepts from discrete-time quantum walks to solve the one-dimensional advection partial differential equation via an SPH formalism. Hence, we construct a quantum circuit to carry out the calculations for a two-particle system over one, two, and three time steps. We compare its outputs with results from the classical SPH algorithm and show there is excellent agreement. The methodology and findings, here, are a key step toward developing a more general quantum SPH algorithm for solving practical engineering problems on gate-based quantum computers.
We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method. We use a normalization procedure to encode the SPH operators and domain discretization in a quantum register. We then perform the SPH summation via an inner product of quantum registers. Using a one-dimensional function, we test the approach in a classical sense for the kernel sum and first and second derivatives of a one-dimensional function, using both the Gaussian and Wendland kernel functions, and compare various register sizes against analytical results. Error convergence is exponentially fast in the number of qubits. We extend the method to solve the one-dimensional advection and diffusion partial differential equations, which are commonly encountered in fluids simulations. This work provides a foundation for a more general SPH algorithm, eventually leading to highly efficient simulations of complex engineering problems on gate-based quantum computers.
This paper presents a quantum computing algorithm for the determination of function and gradient approximations in the Smoothed Particle Hydrodynamics (SPH) method. The SPH operators and domain discretisation are encoded in a quantum register using a careful normalisation procedure. The SPH summation is then performed via an inner product of quantum registers. This approach is tested in a classical sense for the kernel sum and first and second gradients of a function, using both the Gaussian and Wendland kernel functions, with comparisons for various register sizes made against analytical results. Error convergence is exponential in the number of qubits. It is hoped that this one-dimensional work will provide the foundation for a more general SPH algorithm, eventually leading to the highly efficient simulation of complex engineering problems on emerging quantum computers.
This study proposed the hierarchy of quantum kernel networks by combing multi quantum networks with smoothed particle hydrodynamics (SPH). The Lagrangian quantum network model was further developed based on an improved quantum multilayer perceptron (QMLP). A sequential hybrid quantum-classical framework was constructed to ensure robust particle gradient-based optimization and mitigate barren plateaus for computational particle dynamics. This approach combines smoothing kernels with quantum learning, establishing a novel quantum intelligent particle paradigm. The framework was validated through some benchmarks on multifarious quantum neural networks, static multi-level vortex reconstructions and transient scalar advective transports. Numerical results show that while elementary quantum circuits struggle with generalization in unstructured domains, the hybrid crossed-QMLP matches the fitting accuracy of classical SPH in quantum optimized space. Despite current limitations in computational efficiency and hardware implementation, this work paves the way for a new investigation on quantum-particle approach by mapping unstructured Lagrangian particle topologies into integrated quantum networks.
Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we propose a quantum algorithm for solving the advection-diffusion-reaction equation by employing a novel approximate probabilistic imaginary-time evolution (PITE) operator. First, the effectiveness of the proposed approximate PITE operator is justified by the theoretical evaluation of the error. Next, we construct the explicit quantum circuit to realize the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation, whose gate complexity is logarithmic regarding the size of the discretized Hamiltonian matrix. Compared to the existing algorithms for the quantum linear system problem, our algorithm achieves an exponential speedup regarding the matrix size at the cost of a worse dependence on the error bound. Moreover, numerical simulations using gate-based quantum emulator for 1D/2D examples are also provided to verify our algorithm. Finally, we extend our algorithm to the coupled system of advection-diffusion equations to show the prospects for practical applications.
This paper explores the application of quantum-inspired algorithms to accelerate the simulation of fluid dynamics. Traditional computational fluid dynamics (CFD) methods, particularly those solving the Navier-Stokes equations, are often computationally expensive, limiting their applicability in real-time simulations and complex scenarios. This research investigates the potential of mimicking quantum phenomena, specifically wave interference and amplitude estimation, through the design and implementation of novel algorithms. The core idea is to leverage techniques inspired by quantum computing to achieve a significant speedup in solving these equations. We present a framework utilizing amplitude estimation to efficiently approximate solutions, offering a potential pathway to overcome the computational bottlenecks inherent in conventional CFD. The presented approach provides a novel methodology for simulating fluid dynamics with reduced computational cost, opening opportunities for advancements in areas such as aerospace, automotive, and weather forecasting.
Simulating fluid dynamics on a quantum computer is intrinsically difficult due to the nonlinear and non-Hamiltonian nature of the Navier-Stokes equation (NSE). We propose a framework for quantum computing of fluid dynamics based on the hydrodynamic Schr\"odinger equation (HSE), which can be promising in simulating three-dimensional turbulent flows in various engineering applications. The HSE is derived by generalizing the Madelung transform to compressible or incompressible flows with finite vorticity and dissipation. Since the HSE is expressed as a unitary operator on a two-component wave function, it is more suitable than the NSE for quantum computing. The flow governed by the HSE can resemble a turbulent flow consisting of tangled vortex tubes with the five-thirds scaling of energy spectrum. We develop a prediction-correction quantum algorithm to solve the HSE. This algorithm is implemented for simple flows on the quantum simulator Qiskit with partial exponential speedup.