# Period Finding with Adiabatic Quantum Computation

Title | Period Finding with Adiabatic Quantum Computation |

Publication Type | Journal Article |

Year of Publication | 2013 |

Authors | I. Hen |

Journal | arXiv:1307.6538 |

Abstract | 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 implications for the existence of an optimal-complexity adiabatic version of Shor's integer factorization algorithm and the experimental implementation of the latter. |

URL | http://arXiv.org/abs/1307.6538 |