Group Theoretical Formulation of a Quantum Partial Search Algorithm

From MaRDI portal



Abstract: Searching and sorting 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 partial search. An example is the following: 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 partial search considers the following problem: a database is separated into several blocks. We want to find a block with the target item, not the target item itself. In this paper we reformulate quantum partial search algorithm in terms of group theory.











This page was built for publication: Group Theoretical Formulation of a Quantum Partial Search Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5293386)