Period finding with adiabatic quantum computation
Information Sciences Institute, University of Southern California - Marina del Rey, CA 90292, USA
Received: 13 January 2014
Accepted: 5 March 2014
We outline an efficient quantum-adiabatic algorithm that solves Simon's problem, in which one has to determine the “period”, or xor mask, of a given black-box function. We show that the proposed algorithm is exponentially faster than its classical counterpart and has the same complexity as the corresponding circuit-based algorithm. Together with other related studies, this result supports a conjecture that the complexity of adiabatic quantum computation is equivalent to the circuit-based computational model in a stronger sense than the well-known, proven polynomial equivalence between the two paradigms. We also discuss the importance of the algorithm and its theoretical and experimental implications for the existence of an adiabatic version of Shor's integer factorization algorithm that would have the same complexity as the original algorithm.
PACS: 03.67.Ac – Quantum algorithms, protocols, and simulations / 03.67.Lx – Quantum computation architectures and implementations
© EPLA, 2014