Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
arXiv:2503.05393 · doi:10.1063/5.0268240
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 (CFD) 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 timesteps. 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 towards developing a more general quantum SPH algorithm for solving practical engineering problems on gate-based quantum computers.
Original manuscript (DOI: 10.1063/5.0268240) and erratum (DOI: 10.1063/5.0288850) published in Physics of Fluids special issue for "Proceedings of the 33rd Discrete Simulation of Fluid Dynamics Conference (DSFD'24)." This arxiv submission contains the corrections described in erratum
References in corpus (25)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum algorithm for solving linear systems of equations
- Quantum Simulation
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Error Correction for Quantum Memories
- Strong quantum computational advantage using a superconducting quantum processor
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Exponential algorithmic speedup by quantum walk
- Quantum Error Mitigation
- On the relationship between continuous- and discrete-time quantum walk
- Quantum Error Correction: An Introductory Guide
- Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
- Variational Quantum Algorithms for Computational Fluid Dynamics
- Beyond the swap test: optimal estimation of quantum state overlap
- Hybrid quantum algorithms for flow problems
- Quantum Lattice Boltzmann is a quantum walk
- Efficient quantum amplitude encoding of polynomial functions
- Lattice Boltzmann-Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number
- Potential quantum advantage for simulation of fluid dynamics
- A Hybrid Quantum-Classical CFD Methodology with Benchmark HHL Solutions
- Cycle discrete-time quantum walks on a noisy quantum computer
- Quantum Algorithm for Smoothed Particle Hydrodynamics
- Quantum state preparation of gravitational waves