Related papers: A new perturbative approach to the adiabatic appro…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
Existing approaches to analogue quantum simulations of time-dependent quantum systems rely on perturbative corrections to quantum simulations of time-independent quantum systems. We overcome this restriction to perturbative treatments with…
Iterative phase estimation has long been used in quantum computing to estimate Hamiltonian eigenvalues. This is done by applying many repetitions of the same fundamental simulation circuit to an initial state, and using statistical…
We consider a dynamical system subjected to weak but adiabatically slow fluctuations of external origin. Based on the ``adiabatic following'' approximation we carry out an expansion in \alpha/|\mu|, where \alpha is the strength of…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We revisit the adiabatic criterion in stimulated Raman adiabatic passage for the three-level $\Lambda$-system, and compare the situation with and without nonlinearity. In linear systems, the adiabatic condition is derived with the help of…
A $\textit{shortcut to adiabaticity}$ is a recipe for generating adiabatic evolution at an arbitrary pace. Shortcuts have been developed for quantum, classical and (most recently) stochastic dynamics. A shortcut might involve a…
This study looks at the finite-dimensional adiabatic evolution influenced by weak perturbations, extending the analysis to the asymptotic time limit. Beginning with the fundamentals of adiabatic transformations and time-dependent effective…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
Recently, it has been shown (Gavrilov et al., Nonlinear Dyn, 112, 2024) that in a linear solid discrete-continuous system with several slowly time-varying parameters, the amplitude of a strongly localized mode (a trapped wave) can be…
There are many problems that lead to analysis of dynamical systems in which one can distinguish motions of two types: slow one and fast one. An averaging over fast motion is used for approximate description of the slow motion. First…
A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state…
We develop a time-dependent real-space renormalization-group approach which can be applied to Hamiltonians with time-dependent random terms. To illustrate the renormalization-group analysis, we focus on the quantum Ising Hamiltonian with…
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…
A shortcut to adiabaticity (STA) is concerned with the fast and robust manipulation of the dynamics of a quantum system that reproduces the effect of an adiabatic process. A recently proposed method enables the generation of shortcuts from…
We propose a novel non-Hermitian adiabatic quantum optimization algorithm. One of the new ideas is to use a non-Hermitian auxiliary "initial'' Hamiltonian that provides an effective level repulsion for the main Hamiltonian. This effect…
With the aim of describing real-time electron dynamics, we introduce an adiabatic approximation for the equation of motion of the one-body reduced-density matrix (one-matrix). The eigenvalues of the one-matrix, which represent the…