Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing

Adrian Harkness, Hamidreza Validi, Ramin Fakhimi +4

Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this…