Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems

Computer Science

• Classical Computer 100%
• Class Classification 50%
• Graph Coloring 50%
• Knapsack 50%
• Constraint Term 50%
• Hamiltonian Cycle 50%
• Combinatorial Optimization Problem 50%
• Job Shop Scheduling Problems 50%
• Computer Science 50%
• Transistor 50%

Keyphrases

• D-Wave Quantum Annealer 12%
• Traveling Salesperson 12%
• Four-class Classification 12%