Quantum Modeler · Set Cover
Set Cover
Choose minimum-cost sets whose union covers every required element. Coverage slack is included in the eight-qubit budget; uncovered elements are reported as infeasible.
Execute at most 8 total qubits using an ideal classical statevector simulator. Symbolic scaling does not execute or solve a larger instance.
Build your problem
The starter covers A, B, C with sets 0 and 1, costing 4. It needs 3 selection + 4 slack = 7 qubits.
Ready to validate a small instance.
Open the simulator to purchase more runs, then return here.
Results describe the last completed build.
Explain this model
Small-instance simulation
Independent classical reference
Scaling formula
Sampled states
| Bits | Count | Probability | Penalized energy | Feasible objective | Penalty constraints | Assignment |
|---|
Full probability distribution
| Bits | Count | Probability | Penalized energy | Feasible objective | Penalty constraints | Assignment |
|---|
Circuit artifacts
x0 is the leftmost assignment bit. Measurements map xi → q[i] → c[i]; tools displaying c[N−1]…c[0] require register-order conversion.
Variable mapping
QUBO and Ising coefficients
Generated DSL
OpenQASM 2.0
Planned model families
TSP · Job Scheduling · Vehicle Routing remain roadmap items, not executable solvers.
No quantum advantage, real-QPU performance, physical-qubit requirement, or production-scale solution quality is claimed.