Approximation of a quantum algorithm for order finding.
Alexander N. ProkopenyaPublished in: Program. Comput. Softw. (2016)
Keyphrases
- detection algorithm
- computational complexity
- computational cost
- dynamic programming
- experimental evaluation
- computationally efficient
- learning algorithm
- preprocessing
- error bounds
- np hard
- high accuracy
- matching algorithm
- input data
- recognition algorithm
- improved algorithm
- significant improvement
- objective function
- similarity measure
- approximation methods
- convergence rate
- error tolerance
- closed form
- quantum inspired
- segmentation algorithm
- expectation maximization
- linear programming
- simulated annealing
- scheduling problem
- special case
- k means
- optimal solution