Related papers: Time-dependent Real-space Renormalization-Group Ap…
In this paper we consider quantum Hamiltonians with time-dependent interaction strengths, and following the recently formulated generalized Bethe ansatz framework [P. R. Pasnoori, Phys. Rev. B 112, L060409 (2025)], we show that constraints…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
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…
We present two applications of emergent local Hamiltonians to speed up quantum adiabatic protocols for isolated noninteracting and weakly interacting fermionic systems in one-dimensional lattices. We demonstrate how to extract maximal work…
Different methods have been recently put forward and implemented experimentally to inverse engineer the time dependent Hamiltonian of a quantum system and accelerate slow adiabatic processes via non-adiabatic shortcuts. In the…
The time-evolution operator for an explicitly time-dependent Hamiltonian is expressed as the product of a sequence of unitary operators. These are obtained by successive time-dependent unitary transformations of the Hilbert space followed…
We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization. This is applied to random-field antiferromagnetic Ising spin models. The algorithm is catalyzed in such a way that the evolution…
We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic…
Adiabatic processes driven by non-Hermitian, time-dependent Hamiltonians may be sped up by generalizing inverse engineering techniques based on Berry's transitionless driving algorithm or on dynamical invariants. We work out the basic…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
Critical transition points between symmetry-broken phases are characterized as fixed points in the renormalization group (RG) theory. We show that, following the standard Wilsonian procedure that traces out the large momentum modes, this…
We apply a real-space block renormalization group approach to study the critical properties of the random transverse-field Ising spin chain with multispin interactions. First we recover the known properties of the traditional model with…
We study the non-equilibrium dynamics due to slowly taking a quasiperiodic Hamiltonian across its quantum critical point. The special quasiperiodic Hamiltonian that we study here has two different types of critical lines belonging to two…
This article deals with non-adiabatic processes (i.e. processes excluded by the adiabatic theorem) from the geometrical (group-theoretical) point of view. An approximated formula for the probabilities of the non-adiabatic transitions is…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
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…
The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…
We propose a nonadiabatic approach to quantum annealing, in which we repeat quantum annealing in nonadiabatic time scales, and collect the final states of many realizations to find the ground state among them. In this way, we replace the…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
We model quantum space-time on the Planck scale as dynamical networks of elementary relations or time dependent random graphs, the time dependence being an effect of the underlying dynamical network laws. We formulate a kind of geometric…