Emergent Mind
Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test
(1703.07891)
Published Mar 23, 2017
in
cs.CC
and
quant-ph
Abstract
We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show width hierarchy for complexity classes of Boolean function computed by these models and discuss relation between different variants of $k$-OBDD.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.