38 research outputs found
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
© 2016, Pleiades Publishing, Ltd.In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative complexity for several variants of OBDDmodels. • We present results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2k+1. • We consider quantum and classical nondeterminism. We show that quantum nondeterminismcan bemore efficient than classical nondeterminism. In particular, an explicit function is presented that is computed by a quantum nondeterministic OBDD of constant width but any classical nondeterministic OBDD for this function needs non-constant width. • We also present new hierarchies on widths of deterministic and nondeterministic OBDDs
Very narrow quantum OBDDs and width hierarchies for classical OBDDs
In the paper we investigate a model for computing of Boolean functions - Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. - We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k+1. - We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient than classical nondeterminism. In particular, an explicit function is presented which is computed by a quantum nondeterministic OBDD with constant width, but any classical nondeterministic OBDD for this function needs non-constant width. - We also present new hierarchies on widths of deterministic and nondeterministic OBDDs. We focus both on small and large widths. © 2014 Springer International Publishing
Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs
In this paper, we present a quantum algorithm for dynamic programming
approach for problems on directed acyclic graphs (DAGs). The running time of
the algorithm is , and the running time of the
best known deterministic algorithm is , where is the number of
vertices, is the number of vertices with at least one outgoing edge;
is the number of edges. We show that we can solve problems that use OR,
AND, NAND, MAX and MIN functions as the main transition steps. The approach is
useful for a couple of problems. One of them is computing a Boolean formula
that is represented by Zhegalkin polynomial, a Boolean circuit with shared
input and non-constant depth evaluating. Another two are the single source
longest paths search for weighted DAGs and the diameter search problem for
unweighted DAGs.Comment: UCNC2019 Conference pape
Error-free affine, unitary, and probabilistic OBDDS
© IFIP International Federation for Information Processing 2018. 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 for the automata versions of these models