QUBO Benchmark Suite
Benchmark suite for Quadratic Unconstrained Binary Optimization (QUBO), the standard formulation for mapping combinatorial problems onto quantum hardware. Compares quantum solvers (D-Wave Hybrid Solver, gate-based QAOA) against quantum-inspired solvers (Toshiba SBM, Fujitsu Digital Annealer) and classical heuristics on established instance libraries including MQLib, random NAE 3-SAT, and Sherrington-Kirkpatrick models.[1]
- Algorithm: Quantum Annealing / QAOA / Simulated Bifurcation
- Category: optimization
- Framework: D-Wave Ocean, Qiskit
- Hardware: D-Wave, Fujitsu Digital Annealer, Toshiba SBM
- Reproducible: Yes
- Published:
- QUBO
- quantum-annealing
- combinatorial-optimization
- D-Wave
- benchmark-suite
What algorithm does QUBO Benchmark Suite use?
QUBO Benchmark Suite uses the Quantum Annealing / QAOA / Simulated Bifurcation algorithm, categorized under optimization.
Frequently Asked Questions
What is the QUBO Benchmark Suite benchmark?
Benchmark suite for Quadratic Unconstrained Binary Optimization (QUBO), the standard formulation for mapping combinatorial problems onto quantum hardware. Compares quantum solvers (D-Wave Hybrid Solver, gate-based QAOA) against quantum-inspired solvers (Toshiba SBM, Fujitsu Digital Annealer) and classical heuristics on established instance libraries including MQLib, random NAE 3-SAT, and Sherrington-Kirkpatrick models.
Is QUBO Benchmark Suite reproducible?
Yes, this benchmark is reproducible.