10 May 2007 Quantum query algorithms for certain functions and general algorithm construction techniques
Author Affiliations +
Abstract
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we concentrate on quantum query algorithm designing tasks. The main aim of research was to find new efficient algorithms and develop general algorithm designing techniques. We present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next we introduce algorithm transformation methods that allow significant enlarging of sets of exactly computable functions. Finally, we propose quantum algorithm designing methods. Given algorithms for the set of sub-functions, our methods use them to design more complex one, based on algorithms described before. Methods are applicable for input algorithms with specific properties and preserve acceptable error probability and number of queries.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alina Dubrovska, "Quantum query algorithms for certain functions and general algorithm construction techniques", Proc. SPIE 6573, Quantum Information and Computation V, 65730F (10 May 2007); doi: 10.1117/12.720653; https://doi.org/10.1117/12.720653
PROCEEDINGS
12 PAGES


SHARE
Back to Top