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

What are the prospects of using Grover's search in NISQ era?

Yulun Wang, Predrag Krstić

Published Jun 1, 2020• 0 citations
OpenAlex

Related papers

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

Impact of hardware connectivity on Grover’s algorithm in NISQ era

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Quantum Information Processing•Apr 19, 2025•4 citations

Current Status and Prospects of Quantum Search Algorithm: Grover’s Algorithm

Joonho Bae

New Physics Sae Mulli•Oct 31, 2024•0 citations

Impact of Noise and Hardware Connectivity on Grover’s Quantum Search Algorithm in NISQ Devices

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Lecture notes in computer science•Jan 1, 2025•3 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

Complementarity between success probability and coherence in Grover search algorithm

Minghua Pan, Haozhen Situ, Shenggen Zheng

Abstract Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence , where C is a coherence measurement. By virtue of the constraint of large N and Shannon's maximum entropy principle, a surprising complementary relationship between the coherence and the success probability of GSA is obtained. Namely, , where C is in terms of the relative entropy of coherence and l 1 norm of coherence, t is the number of the search iterations in GSA. Moreover, the equation holds no matter either in ideal or noisy environments. Considering the number of qubits is limited in the recent noisy intermediate-scale quantum (NISQ) era, some exact numerical calculation experiments are presented for different database sizes N with different types of noises. The results show that the complementarity between the success probability and the coherence almost always holds. This work provides a new perspective to improve the success probability by manipulating its complementary coherence, and vice versa. It has an excellent potential for helping quantum algorithms design in the NISQ era.

arXiv:2205.09268•Europhysics Letters (EPL)•May 1, 2022•12 citations
Abstract Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence , where C is a coherence measurement. By virtue of the constraint of large N and Shannon's maximum entropy principle, a surprising complementary relationship between the coherence and the success probability of GSA is obtained. Namely, , where C is in terms of the relative entropy of coherence and l 1 norm of coherence, t is the number of the search iterations in GSA. Moreover, the equation holds no matter either in ideal or noisy environments. Considering the number of qubits is limited in the recent noisy intermediate-scale quantum (NISQ) era, some exact numerical calculation experiments are presented for different database sizes N with different types of noises. The results show that the complementarity between the success probability and the coherence almost always holds. This work provides a new perspective to improve the success probability by manipulating its complementary coherence, and vice versa. It has an excellent potential for helping quantum algorithms design in the NISQ era.