Hamiltonian engineering for adiabatic quantum computation: Lessons from shortcuts to adiabaticity

TL;DR

This paper explores how shortcuts to adiabaticity can enhance adiabatic quantum computation, specifically applying these techniques to Grover's algorithm through two different implementation methods.

Contribution

It introduces and analyzes two novel methods for implementing shortcuts to adiabaticity in quantum algorithms, advancing the practical application of adiabatic quantum computing.

Findings

Successful application of STA to Grover's algorithm

Comparison of quantum adiabatic brachistochrone and Lewis-Riesenfeld methods

Potential for faster adiabatic quantum computations

Abstract

We discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the adiabatic algorithm of the Grover's problem. We discuss two possible implementations of STA for the adiabatic quantum computations: the method of quantum adiabatic brachistochrone and the Lewis-Riesenfeld invariant-based inverse engineering.