168 citations · 2k across the 70 of their papers we have counts for
Showing 2013 · quant-phShow all
3 papers · 2 filters
quant-ph2013★ 26 cited
Period Finding with Adiabatic Quantum Computation
Itay Hen
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 tha…
quant-ph2013★ 17 cited
Continuous-Time Quantum Algorithms for Unstructured Problems
Itay Hen
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classica…
quant-ph2013★ 11 cited
How Fast Can Quantum Annealers Count?
Itay Hen
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic p…