activity
20052020
most citedTopology of Pareto sets of strongly convex problems

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

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2020

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes

Yuya Sugie, Yuki Yoshida, Normann Mertig +7

Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum an…