Zero-Error Affine, Unitary, and Probabilistic OBDDs
Computational Complexity
2017-05-10 v2 Formal Languages and Automata Theory
Quantum Physics
Abstract
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results by considering the automata versions of these models.
Cite
@article{arxiv.1703.07184,
title = {Zero-Error Affine, Unitary, and Probabilistic OBDDs},
author = {Rishat Ibrahimov and Kamil Khadiev and Krisjanis Prusis and Jevgenijs Vihrovs and Abuzer Yakaryilmaz},
journal= {arXiv preprint arXiv:1703.07184},
year = {2017}
}
Comments
subitted to FCT 2017