Related papers: Rapid adiabatic preparation of injective PEPS and …
Given a finite lifetime, a ubiquitous challenge in quantum systems is how to prepare a target state in the shortest possible time. This issue is particularly relevant for Rydberg atom arrays in optical tweezers where the dephasing time is…
Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this…
We present schemes for geometric phase compensation in adiabatic passage which can be used for the implementation of quantum logic gates with atomic ensembles consisting of an arbitrary number of strongly interacting atoms. Protocols using…
We consider the preparation of matrix product states (MPS) on quantum devices via quantum circuits of local gates. We first prove that faithfully preparing translation-invariant normal MPS of $N$ sites requires a circuit depth…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic…
We propose a method to obtain optimal protocols for adiabatic ground-state preparation near the adiabatic limit, extending earlier ideas from [D. A. Sivak and G. E. Crooks, Phys. Rev. Lett. 108, 190602 (2012)] to quantum non-dissipative…
Preparation of quantum thermal states of many-body systems is a key computational challenge for quantum processors, with applications in physics, chemistry, and classical optimization. We provide a simple and efficient algorithm for thermal…
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…
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard…
Quantum many-body phases offer unique properties and emergent phenomena, making them an active area of research. A promising approach for their experimental realization in model systems is to adiabatically follow the ground state of a…
The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
Considering the unique energy level structure of the one-axis twisting Hamiltonian in combination with standard rotations, we propose the implementation of a rapid adiabatic passage scheme on the Dicke state basis. The method permits to…
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We propose to apply stimulated adiabatic passage to transfer atoms from their ground state into Rydberg excited states. Atoms a few micrometers apart experience a dipole-dipole interaction among Rydberg states that is strong enough to shift…
Simulating of exotic phases of matter that are not amenable to classical techniques is one of the most important potential applications of quantum information processing. We present an efficient algorithm for preparing a large class of…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively.…