Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
Year: 2025
Type: article
Abstract: An ordered binary decision diagram (OBDD) is a directed acyclic graph representing a Boolean function . Since OBDDs have many nice properties as data structures, they have been extensively studied for decades in theoretical and practical fields, such as VLSI (Very Large Scale Integration) 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 variables are to be 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. Friedman and Supowit provided a clever deterministic algorithm with time/space complexity O ⁎ ( 3 n ) ⁎ , where n is the number of variables of the function, which is much better than the trivial brute-force bound O ⁎ ( n ! 2 n ) . This paper shows that a further speedup is possible with quantum computers by presenting a quantum algorithm that produces a minimum OBDD together with the corresponding variable ordering in O ⁎ ( 2.77286 n ) time and space with an exponentially small error probability. Moreover, this algorithm can be adapted to constructing other minimum decision diagrams, such as zero-suppressed BDDs (ZBDDs or ZDDs).
Source: Theoretical Computer Science
Author: Seiichiro Tani
Institution: NTT (Japan)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,880
OpenAlex ID: W4409199285