Related papers: Error-run-time trade-off in the adiabatic approxim…
The two main approaches to quantum computing are gate-based computation and analog computation, which are polynomially equivalent in terms of complexity, and they are often seen as alternatives to each other. In this work, we present a…
We review recent results concerning the exponential behaviour of transition probabilities across a gap in the adiabatic limit of the time-dependent Schr\"odinger equation. They range from an exponential estimate in quite general situations…
A simple proof of quantum adiabatic theorem is provided. Quantum adiabatic approximation is divided into two kinds. For Hamiltonian H(t/T), a relation between the size of the error caused by quantum adiabatic approximation and the parameter…
The adiabatic approximation in quantum mechanics is considered in the case where the self-adjoint hamiltonian $H_0(t)$, satisfying the usual spectral gap assumption in this context, is perturbed by a term of the form $\epsilon H_1(t)$. Here…
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
Adiabatic theorem and non-adiabatic corrections have been widely applied in modern quantum technology. Recently, non-adiabatic linear response theory has been developed to probe the many-body correlations in closed systems. In this work, we…
Two recent preprints [B. Altshuler, H. Krovi, and J. Roland, "Quantum adiabatic optimization fails for random instances of NP-complete problems", arXiv:0908.2782 and "Anderson localization casts clouds over adiabatic quantum optimization",…
The task of finding optimal protocols that minimize the energetic cost of thermodynamic processes of long yet finite duration $\tau$ is a pressing one. We approach this problem here in a rigorous and systematic fashion by means of the…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…
We analyze the problem of optimal adiabatic passage through a quantum critical point. We show that to minimize the number of defects the tuning parameter should be changed as a power-law in time. The optimal power is proportional to the…
Dimensionality reduction is the fundamental problem for machine learning and pattern recognition. During data preprocessing, the feature selection is often demanded to reduce the computational complexity. The problem of feature selection is…
We study linear problems of mathematical physics in which the adiabatic approximation is used in the wide sense. Using the idea that all these problems can be treated as problems with operator-valued symbol, we propose a general regular…
When globally optimal solutions of complicated optimization problems cannot be located by evolutionary algorithms (EAs) in polynomial expected running time, the hitting time/running time analysis is not flexible enough to accommodate the…
Validity conditions for the adiabatic approximation are useful tools to understand and predict the quantum dynamics. Remarkably, the resonance phenomenon in oscillating quantum systems has challenged the adiabatic theorem. In this scenario,…
The adiabatic approximation is a natural approach for the description of phenomena induced by low frequency laser radiation because the ratio of the laser frequency to the characteristic frequency of an atom or a molecule is a small…
We prove an adiabatic theorem for the Landau-Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fr\"ohlich Hamiltonian with large coupling…
We present a gauge-invariant formalism to study the evolution of curvature perturbations in a Friedmann-Robertson-Walker universe filled by multiple interacting fluids. We resolve arbitrary perturbations into adiabatic and entropy…
The design space of networked embedded systems is very large, posing challenges to the optimisation of such platforms when it comes to support applications with real-time guarantees. Recent research has shown that a number of inter-related…
In this paper we develop the theory of discrete averaging designed to study discrete time dynamical systems defined by iterates of a map. The discrete averaging uses weighted averages over a segment of trajectory to find an autonomous…