A Sublinear-Time Quantum Algorithm for Approximating Partition Functions.
Arjan CornelissenYassine HamoudiPublished in: SODA (2023)
Keyphrases
- computational complexity
- high accuracy
- np hard
- improved algorithm
- times faster
- optimization algorithm
- theoretical analysis
- computational cost
- worst case
- detection algorithm
- experimental evaluation
- dynamic programming
- significant improvement
- learning algorithm
- k means
- optimal solution
- input data
- search space
- segmentation algorithm
- lower bound
- preprocessing
- clustering method
- classification algorithm
- matching algorithm
- recognition algorithm
- objective function