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• 50 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

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

A Modified Quantum Search Algorithm

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

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

A review on quantum search algorithms

Pulak Ranjan Giri, V. E. Korepin

arXiv:1602.02730•Quantum Information Processing•Nov 13, 2017•82 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.