arXiv Analytics

Sign in

arXiv:1808.07177 [quant-ph]AbstractReferencesReviewsResources

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

Kazutaka Takahashi

Published 2018-08-22Version 1

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.

Comments: 10 pages, 8 figures, article for JPSJ Special Topics
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:0905.2376 [quant-ph] (Published 2009-05-14)
Quantum Adiabatic Brachistochrone
arXiv:2107.01743 [quant-ph] (Published 2021-07-04)
Remark on using quantum states prepared by the adiabatic quantum computation
arXiv:quant-ph/0206003 (Published 2002-06-01)
How Powerful is Adiabatic Quantum Computation?