某些问题的量子查询算法及算法设计技巧的推广
Quantum Query Algorithms for Certain Problems and Generalization of Algorithm Designing Techniques
摘要：
量子算法可以在查询模型中进行分析，以计算布尔函数，其中输入在黑盒中给出，但目标是使用尽可能少的查询来计算任意输入的函数值。在本文中，我们专注于量子查询算法设计任务。研究的主要目的是寻找新的高效算法和开发通用的算法设计技术。我们提出了几个确切的量子查询算法，某些问题，比经典的同行。接下来，我们介绍算法转换方法，允许显着扩大集的精确可计算的功能。最后，我们提出了算法构造方法，适用于具有特定属性的算法，允许构造算法，更复杂的功能，保持可接受的错误概率和查询数量。
英文摘要：
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 algorithm constructing methods applicable for algorithms with specific properties that allow constructing algorithms for more complex functions preserving acceptable error probability and number of queries.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
