Group Theoretical Formulation of a Quantum Partial Search Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
Searching and sorting are used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is a partial search. For example, an exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally, a partial search considers the problem in which a database is separated into several blocks and we want to find a block with the target item, not the target item itself. In this paper, we reformulate a quantum partial search algorithm in terms of group theory.
- 理論物理学刊行会の論文
- 2006-11-25
著者
-
Korepin Vladimir
C.n. Yang Institute For Theoretical Physics
-
VALLILO Brenno
Instituto de Fisica, Universidade de Sao Paulo
-
Vallilo Brenno
Instituto De Fisica Universidade De Sao Paulo