Related papers: Efficient simulation of quantum evolution using dy…
Non-autonomous dynamical systems appear in a very wide range of interesting applications, both in classical and quantum dynamics, where in the latter case it corresponds to having a time-dependent Hamiltonian. However, the quantum…
While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
We review our results on a mathematical dynamical theory for observables for open many-body quantum nonlinear bosonic systems for a very general class of Hamiltonians. We show that non-quadratic (nonlinear) terms in a Hamiltonian provide a…
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution…
Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity.…
A temporally varying discretization often features in discrete gravitational systems and appears in lattice field theory models subject to a coarse graining or refining dynamics. To better understand such discretization changing dynamics in…
The discretization approximation method commonly used to simulate the dynamics of quantum system coupled to the environment in continuum often suffers from the periodically partial recovery of initial state because of the effect of finite…
A discussion is given of the quantisation of a physical system with finite degrees of freedom subject to a Hamiltonian constraint by treating time as a constrained classical variable interacting with an unconstrained quantum state. This…
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…
We introduce a numerical algorithm to simulate the time evolution of a matrix product state under a long-ranged Hamiltonian. In the effectively one-dimensional representation of a system by matrix product states, long-ranged interactions…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Modeling a high-dimensional Hamiltonian system in reduced dimensions with respect to coarse-grained (CG) variables can greatly reduce computational cost and enable efficient bottom-up prediction of main features of the system for many…
We present an effective evolution equation for a coarse-grained distribution function of a long-range-interacting system preserving the symplectic structure of the non-collisional Boltzmann, or Vlasov, equation. We first derive a general…
Discrete and continuous variables oftentimes require different treatments in many learning tasks. Identifying the Hamiltonian governing the evolution of a quantum system is a fundamental task in quantum learning theory. While previous works…
This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
We demonstrate that the dynamics of an open quantum system can be calculated efficiently and with predefined error, provided a basis exists in which the system-environment interactions are local and hence obey the Lieb-Robinson bound. We…