论文标题
用于排序清单和建造树木的Qubos
QUBOs for Sorting Lists and Building Trees
论文作者
论文摘要
我们表明，分类列表和构建搜索树或堆的基本任务可以建模为二次无约束的二进制优化问题（QUBOS）。这个想法是将这些任务理解为置换问题，并设计其解决方案代表适当排列矩阵的Qubos。我们讨论如何使用Hopfield Nets或绝热计算来构建此类Qubos以及如何解决它们。简而言之，我们表明神经计算方法或量子计算机可以解决通常与抽象数据结构相关的问题。
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.
