Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test
Computational Complexity
2017-03-24 v1 Quantum Physics
Abstract
We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read--times Branching Programs or Ordered Binary Decision Diagrams with repeated test (-QOBDD, -NOBDD and -POBDD). We show width hierarchy for complexity classes of Boolean function computed by these models and discuss relation between different variants of -OBDD.
Cite
@article{arxiv.1703.07891,
title = {Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test},
author = {Kamil Khadiev and Rishat Ibrahimov},
journal= {arXiv preprint arXiv:1703.07891},
year = {2017}
}
Comments
Submitted to RuFiDim 2017. arXiv admin note: substantial text overlap with arXiv:1703.00242, arXiv:1703.05015