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^{\Omega (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 }^{3}n)$. Moreover, we proved a similar hierarchy for bounded error probabilistic $k$-OBDD. And for deterministic and probabilistic $k$-OBDDs of superpolynomial and subexponential size.

arXiv commentsubmitted to CSR 2017

References in corpus (4)

• Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity
• Width Hierarchy for k-OBDD of Small Width
• On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs
• Quantum vs. Classical Read-once Branching Programs

Cited by in corpus (5)

• A Representative Framework for Implementing Quantum Finite Automata on Real Devices
• Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs
• Quantum Request-Answer Game with Buffer Model for Online Algorithms
• Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems
• Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs