Related papers: Non-Hermitian Adiabatic Quantum Optimization
A non-Hermitian shortcut to adiabaticity is introduced. By adding an imaginary term in the diagonal elements of the Hamiltonian of a two state quantum system, we show how one can cancel the nonadiabatic losses and perform an arbitrarily…
Open-system quantum dynamics described by non-Hermitian effective Hamiltonians have become a subject of considerable interest. Studies of non-Hermitian physics have revealed general principles, including relationships between the topology…
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…
It is still a challenge to experimentally realize shortcuts to adiabaticity (STA) for a non-Hermitian quantum system since a non-Hermitian quantum system's counterdiabatic driving Hamiltonian contains some unrealizable auxiliary control…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
In this paper the evolution of a quantum system drived by a non-Hermitian Hamiltonian depending on slowly-changing parameters is studied by building an universal high-order adiabatic approximation(HOAA) method with Berry's phase ,which is…
We propose to use a quantum adiabatic and simulated-annealing framework to compute theground state of small molecules. The initial Hamiltonian of our algorithms is taken to be themaximum commuting Hamiltonian that consists of a maximal set…
We introduce an alternative way to derive the generalized form of the master equation recently presented by J. P. Pekola et al. [Phys. Rev. Lett. 105, 030401 (2010)] for an adiabatically steered two-level quantum system interacting with a…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state…
We generalize the concept of population for non-Hermitian systems in different ways and identify the one best suited to characterize adiabaticity. An approximate adiabaticity criterion consistent with this choice is also worked out.…
We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states…
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Suba\c{s}i et al., Phys. Rev. Lett.…
Non-Hermitian systems are widespread in both classical and quantum physics. The dynamics of such systems has recently become a focal point of research, showcasing surprising behaviors that include apparent violation of the adiabatic theorem…
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…