An Improved Approximation Algorithm for Quantum Max-Cut

Understand

We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state.

• The SDP is used to choose the parameters of a variational quantum circuit.
• The entangled state is then represented as the quantum circuit applied to a product state.
• It achieves an approximation ratio of 0.582 on triangle-free graphs.