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:2006.06719 · Computer Physics Communications

Quantum algorithm for smoothed particle hydrodynamics

Rhonda Au-Yeung, A. J. Williams, Viv M. Kendon, Steven Lind

Published Sep 4, 2023• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1016/j.cpc.2023.108909

Related papers

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

Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks

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

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.

arXiv:2503.05393•Physics of Fluids•May 1, 2025•9 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

Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics

Bofeng Liu, Lixing Zhu, Zixuan Yang +1 more

We present quantum numerical methods for the typical initial boundary value problems (IBVPs) of convection-diffusion equations in fluid dynamics. The IBVP is discretized into a series of linear systems via finite difference methods and explicit time marching schemes. To solve these discrete systems in quantum computers, we design a series of quantum circuits, including four stages of encoding, amplification, adding source terms, and incorporating boundary conditions. In the encoding stage, the initial condition is encoded in the amplitudes of quantum registers as a state vector to take advantage of quantum algorithms in space complexity. In the following three stages, the discrete differential operators in classical computing are converted into unitary evolutions to satisfy the postulate in quantum systems. The related arithmetic calculations in quantum amplitudes are also realized to sum up the increments from these stages. The proposed quantum algorithm is implemented within the open-source quantum computing framework Qiskit [2]. By simulating one-dimensional transient problems, including the Helmholtz equation, the Burgers’ equation, and Navier-Stokes equations, we demonstrate the capability of quantum computers in fluid dynamics.

Communications in Computational Physics•Mar 12, 2023•17 citations

Fully Quantum Algorithm for the 1-dimensional linear Lattice Boltzmann Method

Mohammed Bediche, Matthijs van Waveren, Denis Ricot +1 more

A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.

quant-pharXiv:2606.16514•Communications in computer and information science•Jun 16, 2026•0 citations

Utilizing Quantum Computing for Solving Multidimensional Partial Differential Equations

Manu Chaudhary

Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.

•Jan 1, 2025•0 citations
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.
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.
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.
We present quantum numerical methods for the typical initial boundary value problems (IBVPs) of convection-diffusion equations in fluid dynamics. The IBVP is discretized into a series of linear systems via finite difference methods and explicit time marching schemes. To solve these discrete systems in quantum computers, we design a series of quantum circuits, including four stages of encoding, amplification, adding source terms, and incorporating boundary conditions. In the encoding stage, the initial condition is encoded in the amplitudes of quantum registers as a state vector to take advantage of quantum algorithms in space complexity. In the following three stages, the discrete differential operators in classical computing are converted into unitary evolutions to satisfy the postulate in quantum systems. The related arithmetic calculations in quantum amplitudes are also realized to sum up the increments from these stages. The proposed quantum algorithm is implemented within the open-source quantum computing framework Qiskit [2]. By simulating one-dimensional transient problems, including the Helmholtz equation, the Burgers’ equation, and Navier-Stokes equations, we demonstrate the capability of quantum computers in fluid dynamics.
A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.