Related papers: Shortcuts to Adiabaticity in Krylov Space
We provide a rigorous generalization of the quantum adiabatic theorem for open systems described by a Markovian master equation with time-dependent Liouvillian $\mathcal{L}(t)$. We focus on the finite system case relevant for adiabatic…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
The nonadiabatic dynamic of the electromagnetic field triggers photons generation from the quantum vacuum. Shortcuts to adiabaticity, instead, are protocols that mimic the field's adiabatic dynamic in a finite time. Here, we show how the…
We investigate the relationship between Krylov complexity and operator quantum speed limits (OQSLs) of the complexity operator and level repulsion in random/integrable matrices and many-body systems. An enhanced level-repulsion corresponds…
We investigate the loss of adiabaticity when cooling a many-body quantum system from an initial thermal state toward a quantum critical point. The excitation density, which quantifies the degree of adiabaticity of the dynamics, is found to…
We give a pedagogical introduction to dynamical invariant formalism of shortcuts to adiabaticity. For a given operator form of the Hamiltonian with undetermined coefficients, the dynamical invariant is introduced to design the coefficients.…
We propose a method to transfer the population and control the state of two-level and three-level atoms speeding-up Adiabatic Passage techniques while keeping their robustness versus parameter variations. The method is based on…
We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware.…
Adiabatic quantum state evolution can be accelerated through a variety of shortcuts to adiabaticity. In one approach, a counterdiabatic quantum Hamiltonian $\hat H_{CD}$ is constructed to suppress nonadiabatic excitations. In the analogous…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…
We propose a method for slowing particles by laser fields that potentially has the ability to generate large forces without the associated momentum diffusion that results from the random directions of spontaneously scattered photons. In…
Given the recent advances in quantum technology, the complexity of quantum states is an important notion. The idea of the Krylov spread complexity has come into focus recently with the goal of capturing this in a quantitative way. The…
We discuss the application of the adiabatic perturbation theory to analyze the dynamics in various systems in the limit of slow parametric changes of the Hamiltonian. We first consider a two-level system and give an elementary derivation of…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental…
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
We apply the recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) method to lattice gauge theories, using the Schwinger model with a $\theta$-term as a benchmark. SKQD approximates the ground state of a Hamiltonian,…
Surface hopping algorithms, as an important class of quantum dynamics simulation algorithms for non-adiabatic dynamics, are typically performed in the adiabatic representation, which can break down in the presence of ill-defined adiabatic…