Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing.
Arthur BraidaSimon MartielIoan TodincaPublished in: CoRR (2023)
Keyphrases
- approximation ratio
- worst case
- lower bound
- np hard
- approximation algorithms
- upper bound
- greedy algorithm
- special case
- simulated annealing
- search algorithm
- generalization error bounds
- approximately optimal
- quantum computation
- approximation guarantees
- quantum computing
- error bounds
- minimum cost
- optimal solution
- constant factor
- quantum inspired
- probability ranking principle
- branch and bound
- quantum mechanics
- knapsack problem
- randomized algorithms
- computational complexity
- objective function
- machine learning
- sample complexity
- multi class
- case study