Reordering method and hierarchies for quantum and classical ordered binary decision diagrams

DOI10.1007/978-3-319-58747-9_16zbMATH Open1489.68061arXiv1703.00242OpenAlexW2594321785MaRDI QIDQ2399372FDOQ2399372

Authors: Aliya Khadieva, Kamil Khadiev 

Publication date: 22 August 2017

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/logn)}$ 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/lo{g}^{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.

Full work available at URL: https://arxiv.org/abs/1703.00242

Recommendations

• Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
• Reordering decision diagrams for quantum computing is harder than you might think
• Improving the quantum cost of reversible Boolean functions using reorder algorithm
• Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
• Binary superposed quantum decision diagrams
• scientific article; zbMATH DE number 1555978
• Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
• Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
• scientific article; zbMATH DE number 7724262
• Recursive quantum circuits for generating sequency ordering Walsh-Hadamard transform

zbMATH Keywords

computational complexityhierarchyquantum computingbranching programsquantum modelsquantum vs classicalprobabilistic OBDDquantum OBDD

Mathematics Subject Classification ID

Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Branching Programs and Binary Decision Diagrams
• Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
• Title not available (Why is that?)
• Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
• Extension of the hierarchy for \(k\)-OBDDs of small width
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
• Quantum branching programs and space-bounded nonuniform quantum complexity
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs
• On the computational power of probabilistic and quantum branching program
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• Width hierarchy for \(k\)-OBDD of small width
• Comparative complexity of quantum and classical OBDDs for total and partial functions
• The power of nondeterminism and randomness for oblivious branching programs
• Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
• Title not available (Why is that?)
• Developments in Language Theory

Cited In (16)

• Quantum online streaming algorithms with logarithmic memory
• Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
• Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
• New size hierarchies for two way automata
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• Error-Free Affine, Unitary, and Probabilistic OBDDs
• Quantum algorithm for dynamic programming approach for DAGs and applications
• Application of dynamic evidential networks in reliability analysis of complex systems with epistemic uncertainty and multiple life distributions
• Quantum versus classical online streaming algorithms with logarithmic size of memory
• Deterministic construction of QFAs based on the quantum fingerprinting technique
• Quantum online algorithms with respect to space and advice complexity
• Width hierarchy for \(k\)-OBDD of small width
• Comparative complexity of quantum and classical OBDDs for total and partial functions
• Two-way and one-way quantum and classical automata with advice for online minimization problems
• Classical and Quantum Computations with Restricted Memory

This page was built for publication: Reordering method and hierarchies for quantum and classical ordered binary decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399372)