Fourier-transforming with quantum annealers

Frontiers in Physics

Itay eHen¹ 

[1] University of Southern California;

关键词: adiabatic quantum computing;    Quantum adiabatic algorithm;    Quantum Fourier Transform;    Integer factorization;    Shor's algorithm;   

DOI  :  10.3389/fphy.2014.00044

来源: DOAJ

【 摘 要 】

We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines,in the onstruction 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 quantum annealing 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.

【 授权许可】

Unknown