Related papers: Quantum Data Loading for Carleman Linearized Syste…
The ordinary Landau problem consists of describing a charged particle in time-independent magnetic field. In the present case the problem is generalized onto time-dependent uniform electric fields with time-dependent mass and harmonic…
Real-time nonlinear Bayesian filtering algorithms are overwhelmed by data volume, velocity and increasing complexity of computational models. In this paper, we propose a novel ensemble based nonlinear Bayesian filtering approach which only…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $SU(2^n)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by S\'a Earp and Pachos…
Lattice gas algorithms (LGA) are a class of algorithms including, in chronological order, binary lattice gas cellular automata (LGCA), integer lattice gas algorithms (ILGA) and lattice Boltzmann method (LBM). They are largely used for…
We present a lattice Boltzmann algorithm based on an underlying free energy that allows the simulation of the dynamics of a multicomponent system with an arbitrary number of components. The thermodynamic properties, such as the chemical…
Quantum Internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This work deals with the problem of scheduling in an…
The local and non-local vector Non-linear Schrodinger Equation (NLSE) with a general cubic non-linearity are considered in presence of a linear term characterized, in general, by a non-hermitian matrix which under certain condition…
Solving linear ordinary differential equations (ODE) is one of the most promising applications for quantum computers to demonstrate exponential advantages. The challenge of designing a quantum ODE algorithm is how to embed non-unitary…
Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient…
Solving linear systems of equations is a frequently encountered problem in machine learning and optimisation. Given a matrix $A$ and a vector $\mathbf b$ the task is to find the vector $\mathbf x$ such that $A \mathbf x = \mathbf b$. We…
We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…
Lattice Boltzmann (LB) on quantum devices must reconcile unitary gate evolution with the dissipative \emph{collision} step. In the multiple-relaxation-time (MRT) class, we work in the common setting of \emph{modewise diagonal} moment…
We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of…
We introduce random-LCHS, a circuit-efficient randomized-compilation framework for simulating linear non-unitary dynamics of the form $\partial_t u(t) = -A(t) u(t) + b(t)$ built on the linear combination of Hamiltonian simulation (LCHS). We…
In this work, we present a memory-efficient, high-performance GPU framework for moment-based lattice Boltzmann methods (LBM) with fluid-solid coupling. We introduce a split-kernel scheme that decouples fluid updates from solid boundary…
Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource…
Quantum computation offers potential exponential speedups for simulating certain physical systems, but its application to nonlinear dynamics is inherently constrained by the requirement of unitary evolution. We propose the quantum Koopman…
In this paper, new implicit methods with reduced memory are developed for solving the time-dependent Boltzmann transport equation (BTE). One-group transport problems in 1D slab geometry are considered. The reduced-memory methods are…
One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the…