On constant-time quantum annealing and guaranteed approximations for graph optimization problems.
Arthur BraidaSimon MartielIoan TodincaPublished in: CoRR (2022)
Keyphrases
- optimization problems
- evolutionary algorithm
- metaheuristic
- simulated annealing
- cost function
- optimization methods
- graph representation
- weighted graph
- graph theory
- graph model
- random walk
- graph structure
- directed graph
- traveling salesman problem
- connected components
- quantum computation
- combinatorial optimization
- monte carlo
- structured data
- directed acyclic graph
- multi objective
- objective function
- graph theoretic
- graph search
- graph based algorithm
- stable set
- search engine