Realizing an adiabatic quantum search algorithm with shortcuts to adiabaticity in an ion-trap system

Adiabatic quantum computing (AQC) is an approach for solving optimization problems and has advantages against environmental decoherence and certain kinds of random unitary perturbations; however, long coherence time of quantum systems is required to meet the adiabatic criteria for the implementation of AQC. To break the dilemma of evolution time in AQC, the method of shortcuts to adiabaticity (STA) is employed to speed up the evolution process and suppress the nonadiabatic transitions. In this work we demonstrate the application of STA in AQC by implementing a fast two-bit Grover's algorithm with STA in an ion trap system, and the method here is also applicable for realizing Grover's algorithm with more entries.