On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
arXiv:1004.4911 · doi:10.1063/1.3690045
Abstract
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 small counting subroutine. Our other results include a lower bound on the amount of time needed to perform a general Hamiltonian-based quantum search, a lower bound on the evolution time needed to perform a search that is valid in the presence of control error and a generic upper bound on the minimum eigenvalue gap for evolutions. In particular, we demonstrate that quantum speedup for the unstructured search using AQC type algorithms may only be achieved under very rigid control precision requirements.
arXiv comment17 pages, no figures, to appear in JMP
References in corpus (17)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Strengths and Weaknesses of Quantum Computing
- Quantum Search by Local Adiabatic Evolution
- Robustness of adiabatic quantum computation
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum Counting
- Anderson localization casts clouds over adiabatic quantum optimization
- Adiabatic Theorem without a Gap Condition
- How Powerful is Adiabatic Quantum Computation?
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Decoherence in adiabatic quantum computation
- Accuracy vs run time in adiabatic quantum search
- Improved Error-Scaling for Adiabatic Quantum State Transfer
- Adiabatic Quantum Computation with a 1D projector Hamiltonian
- Optimal parametrizations of adiabatic paths
- A strong operator topology adiabatic theorem