Properties and Application of Nondeterministic Quantum Query Algorithms [article]

Alina Dubrovska Vasilieva
2006 arXiv   pre-print
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We
more » ... ine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we demonstrate a gap of n vs. 2 between classical deterministic and dual nondeterministic quantum query complexity for a specific Boolean function.
arXiv:quant-ph/0606248v1 fatcat:po3ytkopfffdbofg5wpi2tkqiq