Quantum Modeler · Max-Cut / QAOA
Model at quantum scale. Validate at 8 qubits.
Formulate a Max-Cut optimization problem as a quantum model, execute a small instance with AutomationGlance's statevector simulator, compare it with the exact classical optimum, and inspect how the same formulation scales toward larger quantum hardware.
Larger target sizes are projected only. AutomationGlance does not simulate the projected large-scale statevector. Bounded execution runs in the API.
Build your problem
Split vertices into two groups to maximize the number of edges crossing between them. Start with a sample or enter your own unweighted graph.
Presets replace problem inputs. Your execution and projection settings stay as entered. Edit any input, then build to calculate new results.
Ready to validate a small instance.
Open the simulator to purchase more runs, then return here.
These results describe the last completed build. Rebuild after changing inputs.
Explain this model
Understand the business interpretation, objective, Hamiltonian, circuit, complexity, and limits of this completed build.
A · Problem formulation
A binary choice per vertex
Each bit xᵢ assigns vertex i to group 0 or 1. Bitstrings list vertex 0 on the left.
Maximize C(x) = Σ(i,j)∈E (xᵢ ⊕ xⱼ)
Cost Hamiltonian: C = Σ (I − ZᵢZⱼ) / 2. Each cost interaction uses CX · RZ(−γ) · CX, followed by RX(2β) on each qubit.
B · 8-Qubit Micro-Execution
An executable up-to-8-qubit instance of a scalable quantum formulation, using an ideal, noiseless statevector simulator hosted on classical hardware.
C · Classical verification
Exhaustive classical search checks every assignment of this small instance. The ratio compares the best measured cut with the exact optimum.
D · Scale projection
Gate count includes initial Hadamards, mixer rotations, and three gates per cost interaction. It excludes measurements, routing, hardware compilation, and error correction. Logical problem qubits are not physical-qubit requirements.
EXECUTED · Measured states and probabilities
Top 16 states by sampled count. Probability is calculated from the statevector; cut values are classically decoded from each bitstring.
| Bitstring | Count | Probability | Cut |
|---|
Full statevector probability distribution
| Bitstring | Count | Probability | Cut |
|---|
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
Available now: Portfolio Selection · Set Cover · Fixed-K Graph Coloring. Each includes a validated encoding, an eight-qubit budget, an independent exact reference, and an explanation.
Routing and scheduling models
TSP · Job Scheduling · Vehicle Routing.
Each provides a bounded encoding, domain visualization, independent exact reference, and JSON Compiler support. Scheduling checks a supplied horizon; routing supports a small identical capacitated fleet. Larger models compile without local simulation.
NOT CLAIMED
Small-instance validation, explicit limits
This feature does not demonstrate quantum advantage, real-QPU performance, physical-qubit requirements, fault-tolerant overhead, or production-scale quantum performance. The 8-qubit simulation validates the small instance only. Larger targets are mathematical resource projections. No external quantum hardware is used.
Understand and audit this model
Mathematical methodology · Worked examples · Full DSL specification → · OpenQASM compatibility