Bad Qubits — Learn Quantum by Doing

|q⟩ Bad Qubits

Multiple choice

In the Max-Cut problem, vertices are partitioned into two sets S and its complement. When is an edge (u, v) counted as 'cut'?

When the edge connects a vertex to itself
When both u and v are placed in S
When u and v land in different sets (z_u != z_v)
When u and v land in the same set (z_u == z_v)