Improved Algorithm and Lower Bound for Variable Time Quantum Search.
Andris AmbainisMartins KokainisJevgenijs VihrovsPublished in: TQC (2023)
Keyphrases
- improved algorithm
- lower bound
- upper bound
- search algorithm
- branch and bound algorithm
- original version
- optimization strategy
- search space
- variable ordering
- branch and bound
- search efficiency
- search methods
- exhaustive search
- sufficiently accurate
- objective function
- global search
- search strategies
- search strategy
- np hard