Article thumbnail

Quantum branching programs and space-bounded nonuniform quantum complexity

By Martin Sauerhoff and Detlef Sieling

Abstract

AbstractIn this paper, the space complexity of non-uniform quantum algorithms is investigated using the model of quantum branching programs (QBPs). In order to clarify the relationship between QBPs and non-uniform quantum Turing machines, simulations between these two models are presented which allow to transfer upper and lower bound results. Exploiting additional insights about the connection between the running time and the precision of amplitudes, it is shown that non-uniform quantum Turing machines with algebraic amplitudes and QBPs with a suitable analogous set of amplitudes are equivalent in computational power if both models work with bounded or unbounded error. Furthermore, quantum ordered binary decision diagrams (QOBDDs) are considered, which are restricted QBPs that can be regarded as a non-uniform analog of one-way quantum finite automata. Upper and lower bounds are proved that allow a classification of the computational power of QOBDDs in comparison to usual deterministic and randomized variants of the model. Finally, an extension of QBPs is proposed where the performed unitary operation may depend on the result of a previous measurement. A simulation of randomized BPs by this generalized QBP model as well as exponential lower bounds for its ordered variant are presented

Publisher: Elsevier B.V.
Year: 2005
DOI identifier: 10.1016/j.tcs.2004.12.031
OAI identifier:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.