Related papers: Beyond adiabatic elimination: A hierarchy of appro…
Adiabatic elimination methods allow the reduction of the space dimension needed to describe systems dynamics which exhibits separation of time scale. For open quantum system, it consists in eliminating the fast part assuming it has almost…
Large amplitude collective motion is investigated for a model pairing Hamiltonian containing an avoided level crossing. A classical theory of collective motion for the adiabatic limit is applied utilising either a time-dependent mean-field…
We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm…
In quantum mechanics, adiabatic elimination is a standard tool that produces a low-lying reduced Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher energy. Suppose this powerful…
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…
An adiabatic-connection fluctuation-dissipation theorem approach based on a range separation of electron-electron interactions is proposed. It involves a rigorous combination of short-range density functional and long-range random phase…
A new and intuitive perturbative approach to time-dependent quantum mechanics problems is presented, which is useful in situations where the evolution of the Hamiltonian is slow. The state of a system which starts in an instantaneous…
Combinatorial optimization problems are crucial for widespread applications but remain difficult to solve on a large scale with conventional hardware. Novel optical platforms, known as coherent or photonic Ising machines, are attracting…
We shall revisit the conventional adiabatic or Markov approximation, which --contrary to the semiclassical case-- does not preserve the positive-definite character of the corresponding density matrix, thus leading to highly non-physical…
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…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
We provide model reduction formulas for open quantum systems consisting of a target component which weakly interacts with a strongly dissipative environment. The time-scale separation between the uncoupled dynamics and the interaction…
We introduce a perturbative approach to solving the time dependent Schroedinger equation, named adiabatic perturbation theory (APT), whose zeroth order term is the quantum adiabatic approximation. The small parameter in the power series…
In the field of atom optics, the basis of many experiments is a two level atom coupled to a light field. The evolution of this system is governed by a master equation. The irreversible components of this master equation describe the…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
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…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…