Polynomial Time Quantum Algorithm for Search Problem and Its Application.
Satoshi IriyamaMasanori OhyaPublished in: QI (2013)
Keyphrases
- search strategy
- search space
- worst case
- computational complexity
- np hard
- dynamic programming
- significant improvement
- strongly polynomial
- detection algorithm
- experimental evaluation
- times faster
- exhaustive search
- particle swarm optimization algorithm
- search procedure
- global search
- convergence rate
- k means
- objective function
- information retrieval
- optimal solution
- probabilistic model
- search algorithm
- quantum inspired
- search mechanism
- search efficiency
- branch and bound search
- segmentation algorithm
- space complexity
- recognition algorithm
- solution space
- search methods
- particle swarm optimization
- high accuracy
- preprocessing
- decision trees