Sub-universal variational circuits for combinatorial optimization problems.
Gal WeitzLirandë PiraChris FerrieJoshua CombesPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- optimization problems
- combinatorial optimization
- metaheuristic
- discrete optimization
- ant colony optimization
- job shop scheduling
- shortest path problem
- job shop scheduling problem
- high speed
- min cost
- image segmentation
- traveling salesman problem
- optical flow
- circuit design
- continuous optimization problems
- neural network
- information retrieval systems
- evolutionary algorithm
- optimal solution
- minmax regret
- energy function
- tabu search
- simulated annealing
- upper bound
- data structure
- machine learning