Q-AICONQuantum and AI Computing, Optimization, and Networking
Local simulationWorks offline · Live numerical simulation
← Back to home

INTERACTIVE QUANTUM LABORATORY 01 / MAX-CUT

EQE-QAOA

Explore QAOA on a Max-Cut graph, then use global symmetry to build an exactly equivalent circuit with fewer qubits.

EQUIVALENCE, PRESERVED.
|ψoriginal⟩ = V|ψreduced⟩
A smaller space · The same state and measurement distribution
EXPERIMENTShared experiment settings
Advanced settings

01 From graphs to quantum operators

Max-Cut: Find the best partition.

Choose a graph. Max-Cut maximizes the number of edges crossing the two node groups.

Unweighted · Undirected

Problem input: nodes and edges

PROBLEM INPUT · UNASSIGNED
Select the same node again to cancel.
Gray nodes · No partition assignedInput edges · QAOA searches for a cut

MAX-CUT OBJECTIVE

Maximize crossing edges.

The graph defines the problem; a measured bitstring will define its partition.

C

Cost Hamiltonian

Edit the edge list

Gray nodes are unassigned. Select two nodes to edit an edge, then continue to optimization.

OPTIONAL · CLASSICAL DEMONSTRATION Classical partition demo (manual; separate from QAOA)

Toggle node groups to see how a cut is scored. These demo colors, bitstrings, and reference optima are separate from QAOA inputs and measured outputs.

MANUAL DEMO · NOT ALGORITHM OUTPUT

MANUAL PARTITION

Demo bitstring|z⟩
—
Demo cut(z)—

The leftmost bit is q₀; node i corresponds to qubit i.

Group A / 0Group B / 1Cut edge · +1
CLASSICAL REFERENCE Enumerate all classical solutions (reference)

For small-scale teaching and numerical checks only. QAOA does not require all solutions to be listed in advance; enumeration is a reference, not an algorithm output.

Problem graph → Optimize parameters → Sample → View the measured partition.