Project Case Study
Approximation Algorithms for Quantum Max-d-Cut
September 19, 2023
The Quantum Max-d-Cut problem seeks quantum states maximizing antisymmetric subspace energy in d-dimensional systems, generalizing Max-d-Cut. The authors provide a polynomial-time approximation algorithm with performance guarantees and prove its tightness using a gap instance for d≥3.