Related papers: Limitations of some simple adiabatic quantum algor…
Adiabatic optimal control schemes are essential for advancing the practical implementation of quantum technologies. However, the vast array of possible adiabatic protocols, combined with their dependence on the particular quantum system and…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) $P$ on a graph with a set of unknown marked vertices, one can define a…
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from…
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…
Adiabatic $U(2)$ geometric phases are studied for arbitrary quantum systems with a three-dimensional Hilbert space. Necessary and sufficient conditions for the occurrence of the non-Abelian geometrical phases are obtained without actually…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
Open quantum systems described by a non-Hermitian Hamiltonian exhibit rich dynamics due to the topology of their complex energy spectrum. By encircling an exceptional point degeneracy, this topology allows for topological state transport,…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of…
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…
The adiabatic approximation in open systems is formulated through the effective Hamiltonian approach. By introducing an ancilla, we embed the open system dynamics into a non-Hermitian quantum dynamics of a composite system, the adiabatic…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a…
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…
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…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a…
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…
Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…
Recent advances in the field of adiabatic quantum computing and the closely related field of quantum annealers has centered around using more advanced and novel Hamiltonian representations to solve optimization problems. One of these…