A quantum polynomial time search algorithm for certain unsorted finite lists.
Stephane LemieuxPublished in: IACR Cryptol. ePrint Arch. (2022)
Keyphrases
- search algorithm
- finite automata
- approximation ratio
- finite sets
- special case
- branch and bound
- search space
- satisfiability problem
- finite number
- suboptimal solutions
- quantum mechanics
- tabu search
- computational complexity
- approximation algorithms
- search tree
- bounded treewidth
- channel capacity
- hill climbing
- heuristic search
- worst case
- scheduling problem
- quantum computing
- information retrieval
- unit length
- function symbols
- search methods
- video sequences