most citedGenerating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2025

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…