Related papers: Quantum Data Loading for Carleman Linearized Syste…
We present hybrid quantum-classical pipelines for solving the Duffing equation that leverage Carleman linearization and the Variational Quantum Linear Solver (VQLS). First, we demonstrate that Carleman linearization accurately approximates…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
We present a variational quantum algorithm (VQA) to solve the nonlinear one-dimensional Bratu equation. By formulating the boundary value problem within a variational framework and encoding the solution in a parameterized quantum neural…
We propose an explicit, oracle-free quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work to incorporate (a) Robin boundary conditions - which include Neumann and…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
We devise a lattice Boltzmann method (LBM) for a matrix-valued quantum Boltzmann equation, with the classical Maxwell distribution replaced by Fermi-Dirac functions. To accommodate the spin density matrix, the distribution functions become…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
In this work, the lattice Boltzmann method (LBM) is assessed as a time-domain numerical approach for electromagnetic wave scattering. Owing to its explicit formulation and suitability for parallel computation on structured grids, LBM…
We develop a theoretical and computational approach to deal with systems that involve a disparate range of spatio-temporal scales, such as those comprised of colloidal particles or polymers moving in a fluidic molecular environment. Our…
In this paper we present a topology optimization technique applicable to a broad range of flow design problems. We propose also a discrete adjoint formulation effective for a wide class of Lattice Boltzmann Methods (LBM). This adjoint…
We propose a hybrid model, coupling Lattice Boltzmann and Molecular Dynamics models, for the simulation of dense fluids. Time and length scales are decoupled by using an iterative Schwarz domain decomposition algorithm. The MD and LB…
We propose a scalable encoding of combinatorial optimization problems with arbitrary connectivity, including higher-order terms, on arrays of trapped neutral atoms requiring only a global laser drive. Our approach relies on modular…
The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale architectures. This problem can be alleviated by alternative algorithms that reduce the…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
The Logarithmic Linear Relaxation (LLR) algorithm is an efficient method for computing densities of states for systems with a continuous spectrum. A key feature of this method is exponential error reduction, which allows us to evaluate the…
An elegant and uniform relaxation-rate formula is presented for the entropic lattice Boltzmann method (ELBM). The formula not only guarantees the discrete time H-theorem at numerical level but also gives full consideration to the…
We present a quantum computational framework for SU(2) lattice gauge theory, leveraging continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields. We consider a ladder as well as…