Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of ...
(a) Performance of two adiabatic paths for finding the maximum independent set. (b) Performance of traditional heuristic adiabatic paths for finding independent sets. Quantum annealing, as a prominent ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results