A note on “On validity of quantum partial adiabatic search”

Abstract

In this note, we clarify a small problem concerning our recent work “On validity of quantum partial adiabatic search”. The conclusion here is that, the success probability of the quantum partial adiabatic search algorithm in the paper indeed can be bounded by the same quantity as that of early work of Kay’s, even though the Hamiltonian settings in those works are different. This fact is not mentioned in our prior paper, so the purpose here is to explicitly point it out for clarity.