1 paper · 1 filter
Ali Lotfi, Adam Carter, Mohammad Meysami +4
We consider the encoding of graph problems as Quadratic Unconstrained Binary Optimization (QUBO) problems, which are solvable by either quantum or classical annealers. Yet, the cla…