31 citations · 41 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 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…
cs.CG2020★ 2 cited
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato +1
Given points in the plane, we propose algorithms to compile connected crossing-free geometric graphs into directed acyclic graphs (DAGs). The DAGs allow efficient counting, enu…