Quantum Modeler · 0/1 Knapsack

Choose what matters. Stay within capacity.

Select items to maximize value without exceeding a weight limit. Translate that decision into a quantum model, explain the mathematics, run a small QAOA circuit, and check the result against an exact classical solution.

The eight-qubit execution limit includes item decisions and capacity slack. Larger targets are projections only. QAOA samples can violate the capacity constraint; those samples are never reported as valid solutions.

Items, value, and capacity

Presets replace problem inputs. Your execution and projection settings stay as entered. Edit any input, then build to calculate new results.

Executable instance Rows are Item 0, Item 1, etc. Positive integers only: weight 1–127, value 1–1000. At most seven items, with room for slack qubits.

Execution settings

A bounded grid chooses angles by minimizing expected penalized energy. Opening the explanation uses the completed result and consumes no additional run.

Target scale · projection onlyExample: 100 items with capacity 1000. Change these values to match your target. Supply both or leave both blank to project the current size. Estimates assume positive integer item weights and the same binary-slack encoding. No larger item list or solution is invented.

Ready to validate a small selection problem.

NOT CLAIMED

Encoding evidence, explicit limits

This is an ideal, noiseless simulation on classical hardware. It demonstrates a small formulation and independent verification, not quantum advantage, QPU execution, physical-qubit requirements, fault tolerance, or large-scale performance. No production resource-allocation quality is guaranteed.

Understand and audit this model

Mathematical methodology · Worked examples · Full DSL specification → · OpenQASM compatibility