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 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.
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.
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.
Quantum algorithms hold the promise of fundamentally changing the way we approach problems in physics, chemistry, computer science, and engineering. This thesis explores new provably efficient quantum algorithms for three fundamental directions in quantum computing: simulation, optimization, and estimation. Together, our results in each of these directions contribute to the broader effort of making quantum computation a practical tool for science and engineering. First, in the area of quantum simulation, we propose Wave Matrix Lindbladization, a set of algorithms that extend the philosophy of density matrix exponentiation to Lindbladian dynamics by working with program-state encodings of Lindblad operators. Specifically, when these operators are local, we show that these algorithms are provably efficient by analyzing their sample and gate complexities. Second, for optimization, we study quantum Boltzmann machines as a variational ansatz for ground-state energy estimation, proving efficient gradient estimation and convergence to approximate stationary points. We also propose hybrid quantum-classical algorithms for semidefinite programming, establish rigorous convergence guarantees, and validate their robustness to noise through numerical simulations for applications such as MaxCut. Finally, for estimation, we develop the tapered quantum phase estimation algorithm, a coherent phase estimation method that leverages taper/window functions from signal processing to reach optimal query complexity without relying on expensive coherent median techniques, and we provide error guarantees in both asymptotic and non-asymptotic regimes along with efficient taper state preparation.
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of the quantum register. These states can be efficiently created in a quantum computer, but they are also efficiently stored, manipulated and probed using Matrix-Product States techniques. Inspired by this idea, we present eight quantum-inspired numerical analysis algorithms, that include Fourier sampling, interpolation, differentiation and integration of partial derivative equations. These algorithms combine classical ideas – finite-differences, spectral methods – with the efficient encoding of quantum registers, and well known algorithms, such as the Quantum Fourier Transform. When these heuristic methods work , they provide an exponential speed-up over other classical algorithms, such as Monte Carlo integration, finite-difference and fast Fourier transforms (FFT). But even when they don't, some of these algorithms can be translated back to a quantum computer to implement a similar task.
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we study the application of quantum computers to computational problems in science and engineering, and to combinatorial optimization problems. We outline the results below. Algorithms for scientific computing require modules, i.e., building blocks, implementing elementary numerical functions that have well-controlled numerical error, are uniformly scalable and reversible, and that can be implemented efficiently. We derive quantum algorithms and circuits for computing square roots, logarithms, and arbitrary fractional powers, and derive worst-case error and cost bounds. We describe a modular approach to quantum algorithm design as a first step towards numerical standards and mathematical libraries for quantum scientific computing. A fundamental but computationally hard problem in physics is to solve the time-independent Schrödinger equation. This is accomplished by computing the eigenvalues of the corresponding Hamiltonian operator. The eigenvalues describe the different energy levels of a system. The cost of classical deterministic algorithms computing these eigenvalues grows exponentially with the number of system degrees of freedom. The number of degrees of freedom is typically proportional to the number of particles in a physical system. We show an efficient quantum algorithm for approximating a constant number of low-order eigenvalues of a Hamiltonian using a perturbation approach. We apply this algorithm to a special case of the Schrödinger equation and show that our algorithm succeeds with high probability, and has cost that scales polynomially with the number of degrees of freedom and the reciprocal of the desired accuracy. This improves and extends earlier results on quantum algorithms for estimating the ground state energy. We consider the simulation of quantum mechanical systems on a quantum computer. We show a novel divide and conquer approach for Hamiltonian simulation. Using the Hamiltonian structure, we can obtain faster simulation algorithms. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under mild assumptions. We turn to combinatorial optimization problems. An important open question is whether quantum computers provide advantages for the approximation of classically hard combinatorial problems. A promising recently proposed approach of Farhi et al. is the Quantum Approximate Optimization Algorithm (QAOA). We study the application of QAOA to the Maximum Cut problem, and derive analytic performance bounds for the lowest circuit-depth realization, for both general and special classes of graphs. Along the way, we develop a general procedure for analyzing the performance of QAOA for other problems, and show an example demonstrating the difficulty of obtaining similar results for greater depth. We show a generalization of QAOA and its application to wider classes of combinatorial optimization problems, in particular, problems with feasibility constraints. We introduce the Quantum Alternating Operator Ansatz, which utilizes more general unitary operators than the original QAOA proposal. Our framework facilitates low-resource implementations for many applications which may be particularly suitable for early quantum computers. We specify design criteria, and develop a set of results and tools for mapping diverse problems to explicit quantum circuits. We derive constructions for several important prototypical problems including Maximum Independent Set, Graph Coloring, and the Traveling Salesman problem, and show appealing resource cost estimates for their implementations.