Bounds on approximating Max kXOR with quantum and classical local algorithms.
Kunal MarwahaStuart HadfieldPublished in: CoRR (2021)
Keyphrases
- upper and lower bounds
- learning algorithm
- recently developed
- computational cost
- worst case
- orders of magnitude
- computational complexity
- lower bound
- computational efficiency
- social networks
- upper bound
- optimization problems
- randomized algorithms
- database
- lower and upper bounds
- times faster
- theoretical analysis
- computationally efficient
- itemsets
- significant improvement
- objective function
- information retrieval
- data sets