Related papers: Transition probability generating function of a tr…
We introduce a general framework for realizing $\mathcal{PT}$-like phase transitions in non-Hermitian systems without imposing explicit parity--time ($\mathcal{PT}$) symmetry. The approach is based on constructing a Hamiltonian as the…
We present a Lie algebraic approach to a Hamiltonian class covering driven, parametric quantum harmonic oscillators where the parameter set -- mass, frequency, driving strength, and parametric pumping -- is time-dependent. Our…
A precise definition of an adiabaticity parameter $\nu$ of a time-dependent Hamiltonian is proposed. A variation of the time-dependent perturbation theory is presented which yields a series expansion of the evolution operator…
Topological quantum computation has been extensively studied due to its robustness against decoherence. A conventional way to realize it is by adiabatic operations---it requires relatively long time to accomplish so that the speed of…
With the aim to solve the time-dependent Schr\"{o}dinger equation associated to a time-dependent non-Hermitian Hamiltonian, we introduce a unitary transformation that maps the Hamiltonian to a time-independent $\mathcal{PT}$-symmetric one.…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
The generator coordinate (GC) method is a variational approach to the quantum many-body problem in which interacting many-body wave functions are constructed as superpositions of (generally nonorthogonal) eigenstates of auxiliary…
We present a new technique for efficiently transitioning a quantum system from an initial to a final stationary state in less time than is required by an adiabatic (quasi-static) process. Our approach makes use of Nelson's stochastic…
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…
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…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Gate-based quantum computers can in principle simulate the adiabatic dynamics of a large class of Hamiltonians. Here we consider the cyclic adiabatic evolution of a parameter in the Hamiltonian. We propose a quantum algorithm to estimate…
We propose a general, fully gate-based quantum algorithm for counterdiabatic driving. The algorithm does not depend on heuristics as in previous variational methods, and exploits regularisation of the adiabatic gauge potential to suppress…
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to…
The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the…
We propose a general and experimentally accessible framework to quantify transition timing in discrete quantum systems via the time-of-flow (TF) distribution. Defined from the rate of population change in a target state, the TF distribution…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
Thouless pumping, the quantized transport of particles in a cyclic adiabatic evolution, faces a challenge: slow driving may exceed the coherent time, while fast driving may break quantization. To address this dilemma, we propose to speed up…