Related papers: Quantum Inspiration, Classical Advantage: Dequanti…
Quantum annealing (QA) is an efficient method for finding the ground-state energy of the problem Hamiltonian. However, in practical implementation, the system suffers from decoherence. On the other hand, recently, ``Localized virtual…
Quantum computation is one of the most promising new paradigms for the simulation of physical systems composed of electrons and atomic nuclei, with applications in chemistry, solid-state physics, materials science, and molecular biology.…
We explore the quantization of classical models with position-dependent mass (PDM) terms constrained to a bounded interval in the canonical position. This is achieved through the Weyl-Heisenberg covariant integral quantization by properly…
For solving the Poisson equation it is usually possible to discretize it into solving the corresponding linear system $Ax=b$.Variational quantum algorithms (VQAs) for the discreted Poisson equation have been studied before. We give a VQA…
In some instances of study of quantum evolution of classical backgrounds it is considered inevitable to resort to non-perturbative methods at the price of treating the system semiclassically. We show that a fully quantum perturbative…
Classical-quantum hybrid algorithms have recently garnered significant attention, which are characterized by combining quantum and classical computing protocols to obtain readout from quantum circuits of interest. Recent progress due to…
The dynamics of a quantum plasma can be described self-consistently by the nonlinear Schroedinger-Poisson system. Here, we consider a multistream model representing a statistical mixture of N pure states, each described by a wavefunction.…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
Existing approaches to solving the Vlasov equation treat the system as a partial differential equation on a phase space grid, and track in either an Eulerian, Lagrangian, or semi-Lagrangian picture. We present an alternative approach, which…
Variational quantum algorithms have been proposed to solve static and dynamic problems of closed many-body quantum systems. Here we investigate variational quantum simulation of three general types of tasks---generalised time evolution with…
In this paper, we consider a finite difference grid-based semi-Lagrangian approach in solving the Vlasov-Poisson (VP) system. Many of existing methods are based on dimensional splitting, which decouples the problem into solving linear…
We introduce a high-order finite element method for approximating the Vlasov-Poisson equations. This approach employs continuous Lagrange polynomials in space and explicit Runge-Kutta schemes for time discretization. To stabilize the…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…
Correlated classical and quantum many-particle systems out of equilibrium are of high interest in many fields, including dense plasmas, correlated solids, and ultracold atoms. Accurate theoretical description of these systems is challenging…
We present an end-to-end quantum algorithm for simulating nonlinear dynamics described by a system of stochastic dissipative differential equations with a quadratic nonlinearity. The stochastic part of the system is modeled by a Gaussian…
The decoherence phenomenon inevitably exists in quantum computing processes. Consequently, dynamic suppression of decoherence for instance via dynamical decoupling, quantum error correction codes (QECC) etc. is crucial in accurately…
We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations (ODEs), which may be generated from partial differential equations in plasma physics. We map a…
Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this work, we introduce a new benchmark for variational quantum algorithm (VQA), recently proposed as…
The present paper is devoted to the convergence analysis of an asymptotic preserving particle scheme designed to serve as a particle pusher in a Particle-In-Cell (PIC) method for the Vlasov equation with a strong inhomogeneous magnetic…
This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit…