We introduce a set of quantum adiabatic evolutions that we argue may be used as “building blocks,” or subroutines, in the construction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT) with the same complexity and resources as its gate-model counterpart. One implication of the above construction is the theoretical feasibility of implementing Shor’s algorithm for integer factorization in an optimal manner, and any other algorithm that makes use of QFT, on quantumannealing devices.We discuss the possible advantages, as well as the limitations, of the proposed approach as well as its relation to traditional adiabatic quantum computation.
Hen, I. (2014). Fourier-transforming with quantum annealers. Frontiers in Physics, 2. https://doi.org/10.3389/fphy.2014.00044