QUBOs for Sorting Lists and Building Trees
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 to understand these tasks as permutation problems and to devise QUBOs whose solutions represent appropriate permutation matrices. We discuss how to construct such QUBOs and how to solve them using Hopfield nets or adiabatic) quantum computing. In short, we show that neurocomputing methods or quantum computers can solve problems usually associated with abstract data structures.
- Published in:
arXiv - Type:
Article - Authors:
C. Bauckhage, T. Gerlach, N. Piatkowski - Year:
2022
Citation information
C. Bauckhage, T. Gerlach, N. Piatkowski: QUBOs for Sorting Lists and Building Trees, arXiv, 2022, https://doi.org/10.48550/arXiv.2203.08815, Bauckhage.etal.2022a,
@Article{Bauckhage.etal.2022a,
author={C. Bauckhage, T. Gerlach, N. Piatkowski},
title={QUBOs for Sorting Lists and Building Trees},
journal={arXiv},
url={https://doi.org/10.48550/arXiv.2203.08815},
year={2022},
abstract={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 to understand these tasks as permutation problems and to devise QUBOs whose solutions represent appropriate permutation matrices. We discuss how to construct such QUBOs and how to solve them using Hopfield nets or...}}