Hamiltonian engineering for adiabatic quantum computation: Lessons from shortcuts to adiabaticity
classification
🪐 quant-ph
keywords
adiabaticquantumadiabaticitycomputationdiscussengineeringmethodshortcuts
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.