Given an unweighted graph (edge list), generate steps to formulate a Max-Cut QAOA instance: cost & mixer Hamiltonians, initial state, parameterization, and classical optimizer loop. Output Python-like pseudocode and a JSON block describing inputs/outputs. Include a note on noise-aware depth.
