Related papers: On models of nonlinear evolution paths in adiabati…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function…
We first discuss the geometrical construction and the main mathematical features of the maximum-entropy-production/steepest-entropy-ascent nonlinear evolution equation proposed long ago by this author in the framework of a fully quantum…
Unitary and dissipative models of quantum dynamics are linear maps on the space of states or density matrices. This linearity encodes the superposition principle, a key feature of quantum theory. However, this principle can break down in…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
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 adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter $\epsilon$. Under suitable assumptions the solution of the…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
Shortcuts to adiabaticity are alternative fast processes which reproduce the same final state as the adiabatic process in a finite or even shorter time, which have been extended from Hermitian systems to non-Hermitian systems in recent…
A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…
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…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bath and in the presence of a time-dependent Hamiltonian. The merit of these models is that they can be solved exactly, and will help us to…
The adiabatic theorem is an important concept in quantum mechanics, it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its Hamiltonian as it initially in. In…
An adiabatic change of parameters along a closed path may interchange the (quasi-)eigenenergies and eigenspaces of a closed quantum system. Such discrepancies induced by adiabatic cycles are refereed to as the exotic quantum holonomy, which…
Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
A stable and fast path linking two arbitrary states of a quantum system is generally required for state-engineering protocols, such as stimulated Raman adiabatic passage, shortcuts to adiabaticity, and holonomic transformation. Such a path…