Related papers: Time complexity analysis of quantum algorithms via…
Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…
This work studies quantum algorithms to solve high-dimensional stochastic differential equations (SDEs) $\mathrm{d} \mathbf{X}_t = A(t) \mathbf{X}_t \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_t$. Aiming for a speed-up in the dimension $N$ of…
We present a novel variational quantum framework for nonlinear partial differential equation (PDE) constrained optimization problems. The proposed work extends the recently introduced bi-level variational quantum PDE constrained…
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a…
The density-matrix and Heisenberg formulations of quantum mechanics follow--for unitary evolution--directy from the Schr"odinger equation. Nevertheless, the symmetries of the corresponding evolution operator, the Liouvillian L=i[.,H], need…
It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomogeneous media. A Dyson map points to a unitary field qubit…
Simulating large scale lattice dynamics directly is computationally demanding due to the high complexity involved, yet such simulations are crucial for understanding the mechanical and thermal properties of many physical systems. In this…
We study a number of filtering schemes for the reduction of the statistical error in non-adiabatic calculations by means of the quantum-classical Liouville equation. In particular, we focus on a scheme based on setting a threshold value on…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…
The non-Markovian dynamics of open quantum systems is still a challenging task, particularly in the non-perturbative regime at low temperatures. While the Stochastic Liouville-von Neumann equation (SLN) provides a formally exact tool to…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…
Estimating the eigenvalues of non-normal matrices is a foundational problem with far-reaching implications, from modeling non-Hermitian quantum systems to analyzing complex fluid dynamics. Yet, this task remains beyond the reach of standard…
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass…
We derive the equations of quantum mechanics and quantum thermodynamics from the assumption that a quantum system can be described by an underlying classical system of particles. Each component $\phi_j$ of the wave vector is understood as a…
We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
Quaternion-valued differential equations (QDEs) is a new kind of differential equations which have many applications in physics and life sciences. The largest difference between QDEs and ODEs is the algebraic structure. On the…
Lie systems in Quantum Mechanics are studied from a geometric point of view. In particular, we develop methods to obtain time evolution operators of time-dependent Schrodinger equations of Lie type and we show how these methods explain…