VIRAL, a classical algorithm, now provides stronger provable bounds for Max-Cut on high-girth regular graphs than the quantum approximate optimization algorithm (QAOA), challenging quantum advantage claims in this computational regime.

VIRAL, a classical algorithm, now provides stronger provable bounds for Max-Cut on high-girth regular graphs than the quantum approximate optimization algorithm (QAOA), challenging quantum advantage claims in this computational regime.
Researchers demonstrate efficient MaxCut solutions using sparse Pauli/Walsh correlators with only 0.3% of conventional parameters, achieving >92% approximation ratios while outperforming traditional search methods.