Related papers: Efficient Hamiltonian Engineering for Adiabatic MI…
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…
The adiabatic manipulation of quantum states is a powerful technique that has opened up new directions in quantum engineering, enabling tests of fundamental concepts such as the Berry phase and its nonabelian generalization, the observation…
In a recent work we have developed a robust chainwise atom-molecule adiabatic passage scheme to produce ultracold ground-state molecules via photo-associating free atoms [J. Qian {\it et.al.} Phys. Rev. A 81 013632 (2010)]. With the help of…
Rydberg quantum gate serving as an indispensable computing unit for neutral-atom quantum computation, has attracted intense research efforts for the last decade. However the state-of-the-art experiments have not reached the high gate…
We use the approach of "transitionless quantum driving" proposed by Berry to construct shortcuts to the population transfer and the creation of maximal entanglement between two $\Lambda $-type atoms based on the cavity quantum electronic…
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…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
We propose a new design heuristic to tackle combinatorial optimisation problems, inspired by Hamiltonians for optimal state-transfer. The result is a rapid approximate optimisation algorithm. We provide numerical evidence of the success of…
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…
Spin models are the prime example of simplified manybody Hamiltonians used to model complex, real-world strongly correlated materials. However, despite their simplified character, their dynamics often cannot be simulated exactly on…
Pulse controlled non-adiabatic quantum state transmission (QST) was proposed many years ago. However, in practice environmental noise inevitably damages communication quality in the proposal. In this paper, we study the optimally controlled…
Adiabatic protocols are employed across a variety of quantum technologies, from implementing state preparation and individual operations that are building blocks of larger devices, to higher-level protocols in quantum annealing and…
We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic,…
We consider a classical and superadiabatic version of an iterative quantum adiabatic algorithm to solve combinatorial optimization problems. This algorithm is deterministic because it is based on purely classical dynamics, that is, it does…
We analyze a scheme for preparation of magnetically ordered states of two-component bosonic atoms in optical lattices. We compute the dynamics during adiabatic and optimized time-dependent ramps to produce ground states of effective spin…
State preparation plays a pivotal role in numerous quantum algorithms, including quantum phase estimation. This paper extends and benchmarks counterdiabatic driving protocols across three one-dimensional spin systems characterized by phase…