Graph partitioning is a key problem to enable efficient solving of a wide range of computational tasks and querying over large-scale graph data, such as computing node centralities using iterative ...

Abstract: We demonstrate an adiabatic evolution scheme to evolve from the ground state of a known Hamiltonian to a Mattis-spin glass Hamiltonian, which corresponds to solving a two-way ...

Abstract: Design space exploration (DSE) has long been a very important topic in electronic design automation (EDA), but the growing diversity of applications and the complexity of integrated circuits ...