Group Theoretical Formulation of a Quantum Partial Search Algorithm | Zendy

V. E. Korepin | Zendy; B. C. Vallilo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Group Theoretical Formulation of a Quantum Partial Search Algorithm

Author(s) -

V. E. Korepin,

B. C. Vallilo

Publication year - 2006

Publication title -

progress of theoretical physics

Language(s) - English

Resource type - Journals

eISSN - 1347-4081

pISSN - 0033-068X

DOI - 10.1143/ptp.116.783

Subject(s) - subroutine , algorithm , sorting , block (permutation group theory) , quantum algorithm , search algorithm , sequence (biology) , group (periodic table) , computer science , quantum , theoretical computer science , physics , mathematics , combinatorics , quantum mechanics , biology , genetics , operating system

Searching and sorting used as a subroutine in many important algorithms.Quantum algorithm can find a target item in a database faster than anyclassical algorithm. One can trade accuracy for speed and find a part of thedatabase (a block) containing the target item even faster, this is partialsearch. An example is the following: exact address of the target item is givenby a sequence of many bits, but we need to know only some of them. Moregenerally partial search considers the following problem: a database isseparated 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 searchalgorithm in terms of group theory.Comment: 12 page

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research