Related papers: Staying adiabatic with unknown energy gap
We analyze the crossing of a quantum critical point based on exact results for the transverse XY model. In dependence of the change rate of the driving field, the evolution of the ground state is studied while the transverse magnetic field…
Motivated by transitionless quantum driving, we construct shortcuts to adiabatic passage in a three-atom system to create a singlet state with the help of quantum zeno dynamics and non-resonant lasers. The influence of various decoherence…
A master equation approach to the study of environmental effects in the adiabatic population transfer in three-state systems is presented. A systematic comparison with the non-Hermitian Hamiltonian approach [N. V. Vitanov and S. Stenholm,…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
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…
In this paper, we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector…
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
We expand upon the standard quantum adiabatic theorem, examining the time-dependence of quantum evolution in the near-adiabatic limit. We examine a Hamiltonian that evolves along some fixed trajectory from $\hat{H}_0$ to $\hat{H}_1$ in a…
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.,…
We use elementary variational arguments to prove, and improve on, gap estimates which arise in simulating quantum circuits by adiabatic evolution.
We introduce a method to speed up adiabatic protocols for creating entanglement between two qubits dispersively coupled to a transmission line, while keeping fidelities high and maintaining robustness to control errors. The method takes…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
We have studied the decoherence properties of adiabatic quantum computation (AQC) in the presence of in general non-Markovian, e.g., low-frequency, noise. The developed description of the incoherent Landau-Zener transitions shows that the…
We show how one can perform arbitrary rotation of any qubit, using delayed laser pulses through nonadiabatic evolution, i.e., via transitions among the adiabatic states. We use a double-Lambda scheme and use a set of control parameters such…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Shortcut to adiabaticity in various quantum systems has attracted much attention with the wide applications in quantum information processing and quantum control. In this paper, we concentrate on stimulated Raman shortcut-to-adiabatic…
We propose a variational principle to compute a quantum adiabatic brachistochrone (QAB) for open systems. Using the notion of "adiabatic speed" based on the energy gaps, we derive a Lagrangian associated to the functional measuring the time…