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

A SURVEY OF GROVER'S ALGORITHM AND ITS MODIFICATIONS FOR EFFICIENT UNSTRUCTURED SEARCH

Iram Fatima,Syed Khaldoon Khurshid,Fareed Ud Din Mehmood Jafri,Sanam Shoukat,Haroon Bashir

Published Mar 31, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.20656042

Related papers

Grover’s Algorithm for Unstructured Search

Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor

SpringerBriefs in computer science•Jan 1, 2019•2 citations

QUANTUM SEARCH IN THE NISQ ERA: A COMPREHENSIVE SURVEY OF GROVER'S ALGORITHM, NOISE RESILIENCE, AND APPLICATIONS IN INFORMATION RETRIEVAL

Sanam Shoukat,Prof Dr. Khaldoon Khurshid,Fareed Ud Din Mehmood Jafri,Iram Fatima,Laiba Munir

•Mar 31, 2026•0 citations

ON THE DESIGN OF EFFICIENT QUANTUM ALGORITHMS

Tetsuro Nishino

In this paper, we consider how to design efficient quantum algorithms by using the quantum database search algorithm designed by L. Grover, and show the following results: (1) we show how to apply an efficient quantum algorithm for finding the minimum designed by Dürr and Høyer to the shortest vector in lattice problem. The algorithm by Dürr and Høyer is designed based on Grover's algorithm, and (2) we estimate the time complexity of quantum algorithm for the collision problem, which are designed by using Grover's algorithm and various sorting algorithms.

•May 1, 2001•0 citations

ADAPTIVE GROVER ITERATION STRATEGY FOR EFFICIENT QUANTUM SEARCH OPTIMIZATION

Saria Irshad,Prof. Dr. Khaldoon Khurshid,Hafiza Zarmeen Khan,Iram Yaqoob,Laiba Munir

•Mar 31, 2026•0 citations

An Efficient Framework to Utilize Grover Search

Shigeru Yamashita, Yamashita, Masaki Masaki +1 more

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2011•0 citations

Grover Search and its Applications

Byung-Soo Choi

•Jun 1, 2011•0 citations
In this paper, we consider how to design efficient quantum algorithms by using the quantum database search algorithm designed by L. Grover, and show the following results: (1) we show how to apply an efficient quantum algorithm for finding the minimum designed by Dürr and Høyer to the shortest vector in lattice problem. The algorithm by Dürr and Høyer is designed based on Grover's algorithm, and (2) we estimate the time complexity of quantum algorithm for the collision problem, which are designed by using Grover's algorithm and various sorting algorithms.