Quantum Algorithm for Smoothed Particle Hydrodynamics
arXiv:2006.06719 · doi:10.1016/j.cpc.2023.108909
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.
Published in Computer Physics Communications, 14 pages
References in corpus (39)
- Quantum entanglement
- 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
- Variational Quantum Algorithms
- Quantum support vector machine for big data classification
- Noisy intermediate-scale quantum (NISQ) algorithms
- Adiabatic Quantum Computing
- Quantum principal component analysis
- The power of quantum neural networks
- Quantum walks: a comprehensive review
- Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
- Quantum algorithms for quantum chemistry and quantum materials science
- Elucidating Reaction Mechanisms on Quantum Computers
- Smoothed Particle Hydrodynamics and Magnetohydrodynamics
- Quantum computing for finance: overview and prospects
- Smoothed Particle Hydrodynamics in Astrophysics
- Quantum Annealing for Industry Applications: Introduction and Review
- Demonstration of fault-tolerant universal quantum gate operations
- Maximum Likelihood, Minimum Effort
- Learning the quantum algorithm for state overlap
- Quantum Computer Systems for Scientific Discovery
- Entanglement-Based Machine Learning on a Quantum Computer
- A divide-and-conquer algorithm for quantum state preparation
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- High-precision quantum algorithms for partial differential equations
- Grover Adaptive Search for Constrained Polynomial Binary Optimization
- Circuit-Based Quantum Random Access Memory for Classical Data
- A quantum algorithm for high energy physics simulations
- A random walk approach to quantum algorithms
- The emerging commercial landscape of quantum computing
- Modernizing Quantum Annealing using Local Searches
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Beyond the swap test: optimal estimation of quantum state overlap
- Quantum Fast Poisson Solver: the algorithm and modular circuit design
- Planetary Giant Impacts: Convergence of High-Resolution Simulations using Efficient Spherical Initial Conditions and SWIFT
- Circuit-based quantum random access memory for classical data with continuous amplitudes
- Understanding domain-wall encoding theoretically and experimentally
- High Weissenberg number simulations with incompressible Smoothed Particle Hydrodynamics and the log-conformation formulation