2 papers
quant-ph2022
Compilation and scaling strategies for a silicon quantum processor with sparse two-dimensional connectivity
O. Crawford, J. R. Cruise, N. Mertig +1
Inspired by the challenge of scaling up existing silicon quantum hardware, we investigate compilation strategies for sparsely-connected 2d qubit arrangements and propose a spin-qub…
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…