2 citations · 2 across the 11 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-ph2025
Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips
Saber Dinpazhouh, Illya V. Hicks
We study a cost Hamiltonian compilation problem for the quantum approximate optimization algorithm (QAOA) applied to the Max-Cut problem, focusing on trapped-ion quantum computers.…