Related papers: Limits of Short-Time Evolution of Local Hamiltonia…
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for…
We extend the concept of Anderson localization, the confinement of quantum information in a spatially irregular potential, to quantum circuits. Considering matchgate circuits, generated by time-dependent spin-1/2 XY Hamiltonians, we give an…
We study random Hamiltonians on finite-size cubes and waveguide segments of increasing diameter. The number of random parameters determining the operator is proportional to the volume of the cube. In the asymptotic regime where the cube…
We consider a generic one dimensional spin system of length $ L $, arbitrarily large, with strictly local interactions, for example nearest neighbor, and prove that the dynamical $ \alpha $-R\'enyi entropies, $ 0 < \alpha \le 1 $, of an…
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the…
We study the problem of learning the Hamiltonian of a many-body quantum system from experimental data. We show that the rate of learning depends on the amount of control available during the experiment. We consider three control models: one…
This paper develops a new approach to small time local attainability of smooth manifolds of any dimension, possibly with boundary and to prove H\"older continuity of the minimum time function. We give explicit pointwise conditions of any…
The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation…
We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of…
Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based…
We present a numerical method to simulate the time evolution, according to a Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of the entanglement involved…
Quantum speed limit (QSL) is the study of fundamental limits on the evolution time of quantum systems. For instance, under the action of a time-independent Hamiltonian, the evolution time between an initial and a final quantum state obeys…
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.…
The presence of noise or the interaction with an environment can radically change the dynamics of observables of an otherwise isolated quantum system. We derive a bound on the speed with which observables of open quantum systems evolve.…
Hamiltonian Monte Carlo (HMC) algorithms which combine numerical approximation of Hamiltonian dynamics on finite intervals with stochastic refreshment and Metropolis correction are popular sampling schemes, but it is known that they may…
Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior.…
We consider $d$-dimensional quantum systems which for positive times evolve with a time-independent Hamiltonian in a nonequilibrium state that we keep generic in order to account for arbitrary evolution at negative times. We show how the…
We continue the study of time-dependent Hamiltonians with an isolated singularity in their time dependence, describing propagation on singular space-times. In previous work, two of us have proposed a "minimal subtraction" prescription for…
Evolution time of a qubit under a Hamiltonian operation is one of the key issues in quantum control, quantum information processing and quantum computing. It has a lower bound in Hermitian system, which is limited by the coupling between…
Krylov subspace methods in quantum dynamics identify the minimal subspace in which a process unfolds. To date, their use is restricted to time evolutions governed by time-independent generators. We introduce a generalization valid for…