Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0504157 · Quantum Information Processing

Simple Algorithm for Partial Quantum Search

V. E. Korepin, Lov K. Grover

Published Feb 1, 2006• 54 citations
arXivHTMLPDF
DOI
10.1007/s11128-005-0004-z

Related papers

Quantum Algorithm for Partial Search

V. E. Korepin

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Partial adiabatic quantum search algorithm and its extensions

Jie Sun, Songfeng Lu, Fang Liu

Quantum Information Processing•Mar 8, 2013•11 citations

Shor's algorithm without partial fractions

Nolan R. Wallach

The purpose of this note was to give a proof that Shor's algorithm for period search is polynomial using only the standard $2^{n}$ quantum Fourier thansform and some simple trigonometry. There is an error that was pointed out to the author by Pavel Wocjan.

arXiv:1208.1987•Aug 9, 2012•0 citations

A Modified Quantum Search Algorithm

Hossein Mehri‐Dehnavi, Hasan Dashtianeh, Hossein Yahyavi Kuchaksaraei +3 more

International Journal of Theoretical Physics•Sep 7, 2018•6 citations

Multi-pattern Partial Quantum Search Algorithm

Ri‐Gui Zhou

A multi-pattern partial quantum search algorithm was proposed to increase database searching speed.The algorithm groups the items of a database into equal blocks,neglects some unimportant information,and uses the multi-pattern quantum search algorithm to increase searching speed and concurrently search multi-patterns in the database.An example indicates that the proposed partial algorithm saves 1.325×106 iterations against the global search algorithm in a database with 7.206×1016 items.

Journal of Southwest Jiaotong University•Jan 1, 2008•1 citation

Group Theoretical Formulation of a Quantum Partial Search Algorithm

V. E. Korepin, Brenno Carlini Vallilo

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.

arXiv:quant-ph/0609205•Progress of Theoretical Physics•Nov 1, 2006•17 citations
The purpose of this note was to give a proof that Shor's algorithm for period search is polynomial using only the standard 2n2^{n}2n quantum Fourier thansform and some simple trigonometry. There is an error that was pointed out to the author by Pavel Wocjan.
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.