Now showing items 1-2 of 2
A note on the switching adiabatic theorem
(AIP Publishing, 2012-10)
We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class G(alpha) as a function of time, and we ...
On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
(AIP Publishing, 2012-03)
We present an extension of adiabatic quantum computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a ...