Group Theoretical Formulation of Quantum Partial Search Algorithm
<|reference_start|>Group Theoretical Formulation of Quantum Partial Search Algorithm: 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.<|reference_end|>
@article{korepin2006group,
    title={Group Theoretical Formulation of Quantum Partial Search Algorithm},
    author={Vladimir E. Korepin and Brenno C. Vallilo},
    journal={Prog. Theor. Phys. Vol. 116, No. 5 (2006), p. 783},
    year={2006},
    doi={10.1143/PTP.116.783},
    number={YIPT-SB-06-41},
    archivePrefix={arXiv},
    eprint={quant-ph/0609205},
    primaryClass={quant-ph cs.DS math.GR}
}