Approximation Algorithms for Quantum Max-$d$-Cut

Abstract.The Quantum Max-$d$-Cut problem seeks quantum states maximizing antisymmetric subspace energy in $d$-dimensional systems, generalizing Max-$d$-Cut. We provide a polynomial-time approximation algorithm with performance guarantees and prove its tightness using a gap instance for $d \geq 3$.