Optimizing Quantum Circuit Parameters via SDP: Algorithm 1 Is a 0.562-Approximation for Quantum Max CutResearch Paper
Quantum Max Cut asks for the highest energy of a two-qubit interaction Hamiltonian placed on the edges of a weighted graph. It is a quantum analogue of Max Cut: a classical cut assigns one of two labels to each vertex, while a quantum state can use correlations and entanglement across the qubits. Lee studies an approximation algorithm that first solves a…