01
Market Split
Multi-dimensional Subset Sum
These instances stress multi-constraint subset-sum structure, where feasibility is easy to state but difficult to certify at useful sizes.
- Instances
- 156
- Submissions
- 5
- Results
- 121
Quantum Optimization Benchmarking Library
Benchmark instances and solution submissions for quantum optimization.
QOBLIB collects ten challenging optimization problem classes with practical motivation, reference models, known solutions, and community-submitted results.
10
Problem classes
989
Instances
26
Submission sets
588
Ranked results
Contribute results
Submit a solution
Have a better bound, a new feasible solution, a quantum run, or a useful negative result? QOBLIB accepts benchmark submissions by pull request using the canonical summary CSV template.
Problem classes
Each card links to generated repository summaries and source files for the corresponding benchmark class.
02
LABS
Low Autocorrelation Binary Sequences
LABS is a canonical spin benchmark with direct links to communications, radar, and cryptography, and it becomes difficult as sequence length grows.
- Instances
- 103
- Submissions
- 5
- Results
- 207
03
Minimum Birkhoff Decomposition
Doubly Stochastic Matrix Decomposition
Minimum Birkhoff decomposition connects assignment structure, sparse representation, and quantum physics applications through a hard cardinality objective.
- Instances
- 108
- Submissions
- 3
- Results
- 80
04
Steiner Tree Packing
VLSI Design / Wire Routing
Steiner tree packing models wire routing pressure in VLSI-style grids, where many connection demands must coexist without conflicts.
- Instances
- 190
- Submissions
- 0
- Results
- 0
05
Sports Tournament Scheduling
Constraint Satisfaction Problem
Sports timetabling captures realistic constraint interactions from round-robin tournaments and includes instances selected for diversity and difficulty.
- Instances
- 249
- Submissions
- 1
- Results
- 0
06
Portfolio Optimization
Multi-period with Transaction Costs & Short Selling
Portfolio instances add transaction costs, short selling, borrowing costs, and time coupling to a familiar financial optimization model.
- Instances
- 32
- Submissions
- 3
- Results
- 2
07
Maximum Independent Set
Unweighted MIS
Maximum independent set is a fundamental graph problem with compact QUBO structure and hard instances from social, biological, and benchmark graphs.
- Instances
- 50
- Submissions
- 5
- Results
- 111
08
Network Design
Telecommunications Network Planning
Network design represents traffic-routing and degree-constrained infrastructure planning, with objective values tied to congestion.
- Instances
- 20
- Submissions
- 1
- Results
- 20
09
Vehicle Routing
VRP: TSP + Time Window + Knapsack
Vehicle routing combines route selection, capacity, and time-window pressure, reflecting core logistics and mobility applications.
- Instances
- 55
- Submissions
- 0
- Results
- 0
10
Topology Design
Graph Golf / Node-Degree-Diameter Problem
Topology design asks for low-diameter graphs under degree limits, a concise model for communication latency and network architecture.
- Instances
- 26
- Submissions
- 3
- Results
- 48
Complexity landscape
Difficulty summaries from the QOBLIB paper data included in the repository.
