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…