1 citations · 1 across the 4 of their papers we have counts for
Showing quant-phShow all
2 papers · 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…
quant-ph2021★ 1 cited
Characterization of QUBO reformulations for the maximum -colorable subgraph problem
Rodolfo Quintero, David Bernal, Tamás Terlaky +1
Quantum devices can be used to solve constrained combinatorial optimization (COPT) problems thanks to the use of penalization methods to embed the COPT problem's constraints in its…