97 citations · 262 across the 7 of their papers we have counts for
1 paper · 1 filter
Eugenio Cocchi, Edoardo Tignone, Davide Vodola
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We pre…