寻找二元决策图最优变量排序的量子算法
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
AI总结:
针对OBDD最优变量排序的NP难问题,本文提出一种量子算法,以$O^\ast(2.77286^n)$时间和空间输出最小OBDD及排序,并可扩展至零抑制BDD。
摘要:
有序二元决策图(OBDD)是一种表示布尔函数的有向无环图。在复杂性理论领域,OBDD也被称为无知觉只读一次分支程序的特例。由于OBDD作为数据结构具有许多优良性质,数十年来它们在理论和实践领域都得到了广泛研究,例如VLSI设计、形式化验证、机器学习和组合问题。可以说,使用OBDD时最关键的问题在于:当它们表示同一函数时,其规模可能因变量排序(即读取变量的顺序)而呈指数级变化。事实上,为给定函数寻找使OBDD最小化的最优变量排序是NP难的。因此,已有大量研究寻求寻找最优变量排序的启发式方法。从实践和理论角度来看,寻找能够以比简单暴力算法更低的(指数)时间复杂度输出最优解的算法也很重要。Friedman和Supowit提出了一种巧妙的确定性算法,其时间/空间复杂度为$O^\ast(3^n)$,其中$n$是函数的变量数,这远优于简单暴力界$O^\ast(n!2^n)$。本文通过证明存在一种量子算法,表明利用量子计算机可以进一步加速:该算法能在$O^\ast(2.77286^n)$时间和空间内生成最小OBDD及相应变量排序,且误差指数小。此外,该算法还可适配于构造其他最小决策图,例如零抑制BDD;这类图为稀疏集合提供紧凑表示,并常用于离散优化和枚举领域。
英文摘要:
An ordered binary decision diagram (OBDD) is a directed acyclic graph that represents a Boolean function. OBDDs are also known as special cases of oblivious read-once branching programs in the field of complexity theory. Since OBDDs have many nice properties as data structures, they have been extensively studied for decades in both theoretical and practical fields, such as VLSI design, formal verification, machine learning, and combinatorial problems. Arguably, the most crucial problem in using OBDDs is that they may vary exponentially in size depending on their variable ordering (i.e., the order in which the variable are to read) when they represent the same function. Indeed, it is NP hard to find an optimal variable ordering that minimizes an OBDD for a given function. Hence, numerous studies have sought heuristics to find an optimal variable ordering. From practical as well as theoretical points of view, it is also important to seek algorithms that output optimal solutions with lower (exponential) time complexity than trivial brute-force algorithms do. Friedman and Supowit provided a clever deterministic algorithm with time/space complexity $O^\ast(3^n)$, where $n$ is the number of variables of the function, which is much better than the trivial brute-force bound $O^\ast(n!2^n)$. This paper shows that a further speedup is possible with quantum computers by demonstrating the existence of a quantum algorithm that produces a minimum OBDD together with the corresponding variable ordering in $O^\ast(2.77286^n)$ time and space with an exponentially small error. Moreover, this algorithm can be adapted to constructing other minimum decision diagrams such as zero-suppressed BDDs, which provide compact representations of sparse sets and are often used in the field of discrete optimization and enumeration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。