The complexity of the Quantum Adiabatic Algorithm.
A. P. YoungSergey KnyshVadim N. SmelyanskiyPublished in: Comput. Phys. Commun. (2011)
Keyphrases
- worst case
- computational complexity
- simulated annealing
- computational cost
- dynamic programming
- space complexity
- preprocessing
- detection algorithm
- optimal solution
- objective function
- similarity measure
- experimental evaluation
- learning algorithm
- selection algorithm
- linear complexity
- upper bound
- optimization algorithm
- computationally efficient
- expectation maximization
- linear programming
- times faster
- information retrieval
- convex hull
- cost function
- improved algorithm
- estimation algorithm
- matching algorithm
- high computational complexity
- least squares
- segmentation algorithm
- high accuracy
- data sets
- probabilistic model
- np hard
- multi objective
- significant improvement
- reinforcement learning
- neural network