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

Journal of Nanjing University of Posts and Telecommunications

An Efficient Framework to Utilize Grover Search

Shigeru Yamashita, Yamashita, Masaki Masaki, ○ Nakanishi

Published Jan 1, 2011• 0 citations
OpenAlex

Related papers

Grover Search and its Applications

Byung-Soo Choi

•Jun 1, 2011•0 citations

How to utilize a Grover search in general programming

Shigeru Yamashita

It is widely believed that quantum computers (if realized) will be more powerful than today’s computers from the viewpoint of computational complexity . However, it is not obvious how to utilize quantum computers in practical situations. For practical purposes, a Grover search may be one of the most promising quantum algorithms known so far. Thus, in this paper, we propose an efficient framework where we can use Grover search for general programming. Our framework has the following steps. (1) A programmer writes a program by using standard C++ programming language. (2) Some if expressions within for loops in the C++ source code are chosen as candidates to be performed as a Grover search on a quantum computer. (3) The framework automatically generates a corresponding quantum circuit for each Grover search chosen in (2). Unlike the existing quantum circuit design methods, we can treat large problems in our quantum circuit design. (4) By evaluating the number of primitive quantum gates in the quantum circuit generated in (3), the framework determines whether the processing time of the quantum circuit is faster than the processing time of the corresponding if expression on a classical computer. If the framework determines that the quantum circuit is faster, it generates some interface source codes for a classical computer. Thus, in our framework, a programmer can use a Grover search with almost no effort.

Laser Physics•Apr 1, 2006•1 citation

Quantum Multi-Attribute Search in Healthcare Databases A Hybrid Grover QML Framework for Patient Record Retrieval

R. Keerthana, A. Rajivkannan, K. R. Natarajan +3 more

This study proposed to improve the execution time and accuracy of patient record retrieval in healthcare databases by using a hybrid model that combines Grover's quantum search with Quantum Machine Learning (QML). Two methods were used in this study, where Group 1 refers to classical and standard Grover search methods, and Group 2 refers to the proposed hybrid Grover-QML framework on the same dataset of 1,000 patient records using three attributes: age, symptoms, and disease. The proposed hybrid Grover-QML framework improve an execution time of 0.48 s, an accuracy of 95.2%, and a search efficiency of 94.4%, which are better than the classical method and the standard Grover method, which recorded 0.73 s execution time, 92.3% accuracy, and 83.9% search efficiency. These results show that using Grover's quantum search together with Quantum Machine Learning makes the search faster and more reliable. The proposed method is suitable for efficient multi-attribute patient record retrieval in large healthcare databases.

IEEE Global Symposium on Emerging and Communication Technologies (GSEACT)•Jun 1, 2026•0 citations

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

•Mar 31, 2026•0 citations

Introduction to Grover Algorithm

茂 山下

•Jun 1, 2011•0 citations

Additive composition formulation of the iterative Grover algorithm

F. Masafumi Toyama, W. van Dijk

In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial uniform superposition database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational space, as a linear combination of k operators, each of which consists of a single Grover-search followed by an overall phase-rotation. The value of k and the rotation phase are the same as those determined in the framework of the search with certainty. We discuss how the additive form can be effectively utilized and we propose an alternative gate that realizes the same outcome as the iterative search.

arXiv:1706.01519•Canadian Journal of Physics•Nov 28, 2018•3 citations
It is widely believed that quantum computers (if realized) will be more powerful than today’s computers from the viewpoint of computational complexity . However, it is not obvious how to utilize quantum computers in practical situations. For practical purposes, a Grover search may be one of the most promising quantum algorithms known so far. Thus, in this paper, we propose an efficient framework where we can use Grover search for general programming. Our framework has the following steps. (1) A programmer writes a program by using standard C++ programming language. (2) Some if expressions within for loops in the C++ source code are chosen as candidates to be performed as a Grover search on a quantum computer. (3) The framework automatically generates a corresponding quantum circuit for each Grover search chosen in (2). Unlike the existing quantum circuit design methods, we can treat large problems in our quantum circuit design. (4) By evaluating the number of primitive quantum gates in the quantum circuit generated in (3), the framework determines whether the processing time of the quantum circuit is faster than the processing time of the corresponding if expression on a classical computer. If the framework determines that the quantum circuit is faster, it generates some interface source codes for a classical computer. Thus, in our framework, a programmer can use a Grover search with almost no effort.
This study proposed to improve the execution time and accuracy of patient record retrieval in healthcare databases by using a hybrid model that combines Grover's quantum search with Quantum Machine Learning (QML). Two methods were used in this study, where Group 1 refers to classical and standard Grover search methods, and Group 2 refers to the proposed hybrid Grover-QML framework on the same dataset of 1,000 patient records using three attributes: age, symptoms, and disease. The proposed hybrid Grover-QML framework improve an execution time of 0.48 s, an accuracy of 95.2%, and a search efficiency of 94.4%, which are better than the classical method and the standard Grover method, which recorded 0.73 s execution time, 92.3% accuracy, and 83.9% search efficiency. These results show that using Grover's quantum search together with Quantum Machine Learning makes the search faster and more reliable. The proposed method is suitable for efficient multi-attribute patient record retrieval in large healthcare databases.
In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial uniform superposition database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational space, as a linear combination of k operators, each of which consists of a single Grover-search followed by an overall phase-rotation. The value of k and the rotation phase are the same as those determined in the framework of the search with certainty. We discuss how the additive form can be effectively utilized and we propose an alternative gate that realizes the same outcome as the iterative search.