Quantum Modeler · Custom QUBO
Model optimization problems as QUBOs. Validate small instances with quantum simulation.
Define a Binary Quadratic Model, inspect its Ising Hamiltonian, execute bounded QAOA, verify the original energy exactly, project larger models and export the circuit.
A QUBO (Quadratic Unconstrained Binary Optimization) uses binary variables and linear or pairwise interactions: E(x) = c + Σ aᵢxᵢ + Σ bᵢⱼxᵢxⱼ. Substituting xᵢ = (1 − Zᵢ)/2 gives the QAOA cost Hamiltonian.
API execution limit: 8 variables. Minimization only. Negate objective coefficients to convert maximization. Business constraints must already be encoded as penalty terms. An inadequate penalty can make an infeasible assignment optimal. Validate penalties independently: exhaustive verification checks the supplied bounded QUBO, not an unstated business constraint.
Define your QUBO
Presets replace problem inputs. Your execution and projection settings stay as entered. Edit any input, then build to calculate new results.
API JSON for current editor
Use Copy API JSON to validate and refresh this view. Includes this browser's session ID when copied; omit it where monetization is disabled.
Use Copy API JSON to generate a request.
Ready to validate a small binary objective.
Open the simulator to purchase more runs, then return here.
Results describe the last completed build. Rebuild after changing inputs.
Explain this model
Canonical QUBO → Ising Hamiltonian
Actual backend coefficients, including the constant offset. Circuit scaling does not change the reported objective energies.
Canonical QUBO
Derived Ising Hamiltonian
Small-instance QAOA
Exact original-energy reference
Ground states within tolerance
Target model resources
EXECUTED · Candidates
Up to 16 sampled states, ordered by lowest original energy. Probabilities come from the ideal statevector; counts come from seeded shots. “Optimal” uses the disclosed verification tolerance.
| Bits | Probability | Count | Energy | Optimal? |
|---|
Full probability distribution (at most 256 states)
| Bits | Probability | Count | Energy | Optimal? |
|---|
Model and circuit artifacts
AutomationGlance displays assignments in x0…xN−1 order. Some OpenQASM and Qiskit tools display classical count strings as c[N−1]…c[0]; map the returned bits before comparing assignments. Measurements map xi → q[i] → c[i].
Generated DSL
OpenQASM 2.0
NOT CLAIMED
Modelling evidence, explicit limits
Ideal/noiseless simulation on classical hardware; p=1 with at most 64 parameter evaluations. No quantum advantage, speedup, scalability proof, physical QPU execution, fault-tolerant resource estimates, QAOA global optimality or production optimization quality is demonstrated. Larger targets are symbolic projections only.
Understand and audit this model
Mathematical methodology · Worked examples · Full DSL specification → · OpenQASM compatibility