An efficient quantum algorithm for lattice problems achieving subexponential approximation factor.
Lior EldarSean HallgrenPublished in: CoRR (2022)
Keyphrases
- worst case
- particle swarm optimization
- experimental evaluation
- np hard
- test problems
- expectation maximization
- approximation algorithms
- benchmark problems
- cost function
- computational complexity
- optimal solution
- detection algorithm
- lattice structure
- recognition algorithm
- combinatorial optimization
- theoretical analysis
- computationally efficient
- objective function
- linear programming
- dynamic programming
- search space
- preprocessing
- data structure
- learning algorithm
- simulated annealing
- optimization algorithm
- high accuracy
- clustering method
- convex hull
- error bounds
- convergence rate
- significant improvement
- optimal or near optimal
- polynomial time approximation