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 locally simulate the projected large-scale statevector.

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.

Executable instance · 2–8 qubits Vertices Edges (one pair per line) Use vertex indices 0 through N−1. No duplicate edges or self-loops. An empty edge list is allowed.

Execution settings QAOA depth Measurement shots Sampling seed

A bounded parameter grid chooses γ and β using exact simulated probabilities. The seed makes measurement sampling reproducible. One build uses one run when usage limits are enabled.

Target scale · projection only Target vertices Target edges (optional estimate) No larger graph is invented. Leave edges blank if unknown; edge-dependent estimates will be unavailable. Enter at most 9,007,199,254,740,991 edges in this browser form.

Ready to validate a small instance.

These results describe the last completed build. Rebuild after changing inputs.

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.

EXECUTED

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.

Open in Simulator

VERIFIED

C · Classical verification

Exhaustive classical search checks every assignment of this small instance. The ratio compares the best measured cut with the exact optimum.

PROJECTED — NOT EXECUTED

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.

Top measured states
Bitstring	Count	Probability	Cut

Full statevector probability distribution

Bitstring	Count	Probability	Cut

Circuit artifacts

Generated DSL

OpenQASM 2.0

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.