QUBOs for Sorting Lists and Building Trees

Christian Bauckhage, Thore Gerlach, Nico Piatkowski

We show that the fundamental tasks of sorting lists and building search trees or heaps can be modeled as quadratic unconstrained binary optimization problems (QUBOs). The idea is t…