Faster quantum and classical SDP approximations for quadratic binary optimization.
Fernando G. S. L. BrandãoRichard KuengDaniel Stilck FrançaPublished in: CoRR (2019)
Keyphrases
- semidefinite
- semi definite programming
- semidefinite programming
- quadratically constrained quadratic
- quantum computation
- spectral relaxation
- quantum mechanics
- optimization problems
- objective function
- convex programming
- efficient computation
- constrained optimization
- global optimization
- optimization algorithm
- optimal solution
- reinforcement learning
- optimization methods
- optimization method
- np hard
- evolutionary algorithm
- computational complexity