Efficient quantum algorithm for identifying hidden polynomials.
Thomas DeckerJan DraismaPawel WocjanPublished in: Quantum Inf. Comput. (2009)
Keyphrases
- experimental evaluation
- dynamic programming
- worst case
- segmentation algorithm
- high accuracy
- probabilistic model
- matching algorithm
- np hard
- k means
- high efficiency
- learning algorithm
- detection algorithm
- computationally efficient
- theoretical analysis
- highly efficient
- particle swarm optimization algorithm
- tree structure
- single pass
- particle swarm optimization
- computational cost
- cost function
- search space
- genetic algorithm
- clustering method
- hidden markov models
- memory requirements
- convergence rate
- selection algorithm
- computational complexity
- data structure
- pruning strategy