Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

Abstract

We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is $2^{\varOmega (n/log n)}$ and present quantum OBDD of width $O(n^2)$. It is bigger gap for explicit function that was known before for OBDD of width more than linear. Using this result we prove the width hierarchy for complexity classes of Boolean functions for quantum OBDDs.

Additionally, we prove the width hierarchy for complexity classes of Boolean functions for bounded error probabilistic OBDDs. And using “reordering” method we extend a hierarchy for k-OBDD of polynomial size, for $k=o(n/log^3n)$. Moreover, we proved a similar hierarchy for bounded error probabilistic k-OBDD. And for deterministic and probabilistic k-OBDDs of superpolynomial and subexponential size.

K. Khadiev—Partially supported by ERC Advanced Grant MQC. The work is performed according to the Russian Government Program of Competitive Growth of Kazan Federal University.