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

Workshop on Computation: Theory and Practice (WCTP)

An Oracle Design for Grover’s Quantum Search Algorithm for Solving the Exact String Matching Problem

Jeffrey A. Aborot

Published Dec 1, 2018• 3 citations
Publisher

Abstract

Grover’s quantum search algorithm is a template for doing quantum search in unstructured search spaces. The details of the oracle in Grover’s algorithm is abstracted for the purpose of analyzing the bound on the number of queries the algorithm must make in order to find the target element of the search space. In order for Grover’s quantum search algorithm to be usable in a specific unstructured search problem, one must provide details on the inner workings of the oracle. Specifically, we present a high-level and basic design of the oracle using the quantum computing model specific to the exact string matching problem. We describe our design using the quantum circuit model of computing and show that the gate complexity of the circuit is linear with respect to the product of the length of the pattern and the size of the alphabet. We have suggested a quantum memory structure for storage and retrieval of the input text. The quantum circuit we presented requires scratch qubits linear to the product of the length of the pattern and the size of the alphabet to reduce the size of the scratch register without exponential increase in the count of elementary gates required for the computation.

DOI
10.1142/9789813279674_0003

Related papers

Novel Quantum Circuit Designs for the Oracle of Grover’s Algorithm to Solve the Vertex Cover Problem

Jehn‐Ruey Jiang, Wei-Han Yan

We propose new quantum circuit designs for the Grover oracle, i.e., the oracle of Grover’s algorithm, to solve the vertex cover problem (VCP) efficiently. Grover’s algorithm is an unstructured quantum search algorithm to search a target data item out of N data pieces by calling the oracle $\mathrm{O}(\sqrt{N})$ times. It represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires O(N) oracle calls. We are in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum circuits with three properties: (1) a reduced number of qubits, (2) shorter quantum depth, and (3) fewer gates. We created novel designs of a quantum counter and a quantum semaphore to be applied to the Grover oracle to have the three properties. Through the IBM Quantum Lab service, we executed Grover’s algorithm with the novel quantum circuit designs to solve the VCP to validate the design correctness.

IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE)•Oct 27, 2023•6 citations

Quantum Pattern Matching

Paulo Mateus, Yasser Omar

We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover's search algorithm as well as to other quantum pattern matching methods, which rely on building specific queries for particular patterns. Our method makes arbitrary searches on long static databases much more realistic and implementable. Our algorithm, inspired by Grover's, returns the position of the closest substring to a given pattern of size $M$ with non-negligible probability in $O(\sqrt{N})$ queries, where $N$ is the size of the string. Furthermore, we give the full recipe to implement our algorithm (together with its total circuit complexity), thus offering an oracle-based quantum algorithm ready to be implemented.

arXiv:quant-ph/0508237•Aug 31, 2005•17 citations

Accelerating Unstructured Text Search with Grover's Algorithm: A Performance Analysis on Simulated and Real-Time Quantum Computers

SaiPrasath B, SasiKumar R, A Dineshkumar

Target item searching in large-scale, unstructured text databases is a major computational task for traditional systems and usually requires algorithms whose time complexity is on the order of$O(N)$. Quantum computing presents a strong competitor by using Grover's algorithm, where theoretically the search complexity comes down to$O(\sqrt{N})$, making faster retrieval possible. This research considers the design and assessment of Grover's algorithm as it is used to find a target word in a paragraph. The process entails encoding a group of unique words into a quantum register and implementing a circuit that incorporates a bespoke oracle and a diffusion operator to amplify the probability amplitude of the target state. Performance was evaluated in two situations: an ideal noise-free simulation with Qiskit's AerSimulator and a real-world run on IBM's quantum hardware. Simulation results demonstrated always-high accuracy in identifying the target word. But tests on real quantum machines indicated that the reliability of the algorithm decreases with an increase in qubits. Though circuits of up to five qubits had tolerable accuracy, larger configurations were plagued by noise, gate errors, and decoherence effects. These results highlight both the potential of quantum search algorithms for text processing and the limitations of NISQ today.

International Conference on Applied Artificial Intelligence and Computing (ICAAIC)•Dec 17, 2025•0 citations

Quantum Search using Grover’s Algorithm: Principles, Performance, and Applications

Anggit Gusti Nugraheni, Heri Mahyuzar, Sri Hastuti

Quantum search is one of the most important algorithmic developments in quantum computing because it demonstrates how quantum principles can improve the efficiency of solving unstructured search problems. Grover’s algorithm provides a quadratic speed-up over classical linear search by reducing query complexity from O(N) to O(√N), where N represents the size of the search space. This review examines the principles, performance, and applications of Grover’s algorithm, with emphasis on its theoretical foundation and practical relevance. The discussion covers the roles of superposition, quantum interference, oracle operations, diffusion operators, and amplitude amplification in increasing the probability of measuring a desired solution. The manuscript also reviews the computational performance of quantum search in comparison with classical search methods and considers its relevance to database searching, combinatorial optimisation, cryptography, machine learning, bioinformatics, quantum chemistry, and materials science. The review highlights that Grover’s algorithm is not limited to database retrieval, as many computationally intensive problems can be reformulated as search or optimisation tasks. However, practical implementation remains constrained by current quantum hardware limitations, including decoherence, quantum noise, limited qubit availability, circuit depth, and the difficulty of designing efficient oracles. Despite these challenges, continuing progress in quantum hardware, error correction, cloud-based quantum platforms, and hybrid quantum-classical architectures suggests that quantum search will remain an important area of research. Overall, Grover’s algorithm represents a foundational quantum algorithm with significant theoretical value and potential long-term application in computational domains involving large and unstructured search spaces.

Asian journal of mathematics and computer research•Jun 23, 2026•0 citations

The deterministic pattern matching based on the parameterized quantum circuit

Lu Liu, Xing-Yu Wu, Chu-Yao Xu +2 more

Abstract Grover quantum algorithm is an unstructured search algorithm that can run on a quantum computer with the complexity of O $\sqrt{N}$ N , and is one of the typical algorithms of quantum computing. Recently, it has served as a routine for pattern-matching tasks. However, the original Grover search algorithm is probabilistic, which is not negligible for problems involving determinism. Besides that, efficient data loading is also a key challenge for the practical applications of the Grover algorithm. Here in this work, we propose a modified pattern-matching scheme with Long’s quantum search algorithm, in which the quantum circuit structure search algorithm requires fewer multi-qubit quantum gates, and can obtain the desired results deterministically. Then, the comparison of the performance of our scheme and the previous algorithms is presented through numerical simulations, indicating our algorithm is feasible with current quantum technologies which is friendly to noisy intermediate-scale quantum (NISQ) devices.

EPJ Quantum Technology•Jan 9, 2024•0 citations

Grover Algorithm: Enhancing the Search Mechanism

Jagriti Malhotra, Omkar Chavan, Pallavi Thakur

Grover’s algorithm is a quantum search algorithm that makes a huge difference in finding an element of interest from unsorted and unstructured data. In the case of a classical search algorithm, testing O(N) elements within a dataset of size N is a significant number. Grover’s algorithm reduces this number to $O(\sqrt N )$ so the gain is obvious. This paper covers applied aspects of Grover’s algorithm, namely quantum circuit layout, efficiency of gates, fidelity of qubits, and the optimization of resources for searching unstructured data. Focus has been placed on quantum error correction: namely, planar surface code; resource costs involved have been quantified. The paper discusses the implications of quantum computing on data retrieval and how algorithms in quantum computing are crucial for solving issues presented by a changing environment of computation.

OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON)•Apr 9, 2025•2 citations
Grover’s quantum search algorithm is a template for doing quantum search in unstructured search spaces. The details of the oracle in Grover’s algorithm is abstracted for the purpose of analyzing the bound on the number of queries the algorithm must make in order to find the target element of the search space. In order for Grover’s quantum search algorithm to be usable in a specific unstructured search problem, one must provide details on the inner workings of the oracle. Specifically, we present a high-level and basic design of the oracle using the quantum computing model specific to the exact string matching problem. We describe our design using the quantum circuit model of computing and show that the gate complexity of the circuit is linear with respect to the product of the length of the pattern and the size of the alphabet. We have suggested a quantum memory structure for storage and retrieval of the input text. The quantum circuit we presented requires scratch qubits linear to the product of the length of the pattern and the size of the alphabet to reduce the size of the scratch register without exponential increase in the count of elementary gates required for the computation.
We propose new quantum circuit designs for the Grover oracle, i.e., the oracle of Grover’s algorithm, to solve the vertex cover problem (VCP) efficiently. Grover’s algorithm is an unstructured quantum search algorithm to search a target data item out of N data pieces by calling the oracle O(N)\mathrm{O}(\sqrt{N})O(N​) times. It represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires O(N) oracle calls. We are in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum circuits with three properties: (1) a reduced number of qubits, (2) shorter quantum depth, and (3) fewer gates. We created novel designs of a quantum counter and a quantum semaphore to be applied to the Grover oracle to have the three properties. Through the IBM Quantum Lab service, we executed Grover’s algorithm with the novel quantum circuit designs to solve the VCP to validate the design correctness.
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover's search algorithm as well as to other quantum pattern matching methods, which rely on building specific queries for particular patterns. Our method makes arbitrary searches on long static databases much more realistic and implementable. Our algorithm, inspired by Grover's, returns the position of the closest substring to a given pattern of size MMM with non-negligible probability in O(N)O(\sqrt{N})O(N​) queries, where NNN is the size of the string. Furthermore, we give the full recipe to implement our algorithm (together with its total circuit complexity), thus offering an oracle-based quantum algorithm ready to be implemented.
Target item searching in large-scale, unstructured text databases is a major computational task for traditional systems and usually requires algorithms whose time complexity is on the order ofO(N)O(N)O(N). Quantum computing presents a strong competitor by using Grover's algorithm, where theoretically the search complexity comes down toO(N)O(\sqrt{N})O(N​), making faster retrieval possible. This research considers the design and assessment of Grover's algorithm as it is used to find a target word in a paragraph. The process entails encoding a group of unique words into a quantum register and implementing a circuit that incorporates a bespoke oracle and a diffusion operator to amplify the probability amplitude of the target state. Performance was evaluated in two situations: an ideal noise-free simulation with Qiskit's AerSimulator and a real-world run on IBM's quantum hardware. Simulation results demonstrated always-high accuracy in identifying the target word. But tests on real quantum machines indicated that the reliability of the algorithm decreases with an increase in qubits. Though circuits of up to five qubits had tolerable accuracy, larger configurations were plagued by noise, gate errors, and decoherence effects. These results highlight both the potential of quantum search algorithms for text processing and the limitations of NISQ today.
Quantum search is one of the most important algorithmic developments in quantum computing because it demonstrates how quantum principles can improve the efficiency of solving unstructured search problems. Grover’s algorithm provides a quadratic speed-up over classical linear search by reducing query complexity from O(N) to O(√N), where N represents the size of the search space. This review examines the principles, performance, and applications of Grover’s algorithm, with emphasis on its theoretical foundation and practical relevance. The discussion covers the roles of superposition, quantum interference, oracle operations, diffusion operators, and amplitude amplification in increasing the probability of measuring a desired solution. The manuscript also reviews the computational performance of quantum search in comparison with classical search methods and considers its relevance to database searching, combinatorial optimisation, cryptography, machine learning, bioinformatics, quantum chemistry, and materials science. The review highlights that Grover’s algorithm is not limited to database retrieval, as many computationally intensive problems can be reformulated as search or optimisation tasks. However, practical implementation remains constrained by current quantum hardware limitations, including decoherence, quantum noise, limited qubit availability, circuit depth, and the difficulty of designing efficient oracles. Despite these challenges, continuing progress in quantum hardware, error correction, cloud-based quantum platforms, and hybrid quantum-classical architectures suggests that quantum search will remain an important area of research. Overall, Grover’s algorithm represents a foundational quantum algorithm with significant theoretical value and potential long-term application in computational domains involving large and unstructured search spaces.
Abstract Grover quantum algorithm is an unstructured search algorithm that can run on a quantum computer with the complexity of O N\sqrt{N}N​ N , and is one of the typical algorithms of quantum computing. Recently, it has served as a routine for pattern-matching tasks. However, the original Grover search algorithm is probabilistic, which is not negligible for problems involving determinism. Besides that, efficient data loading is also a key challenge for the practical applications of the Grover algorithm. Here in this work, we propose a modified pattern-matching scheme with Long’s quantum search algorithm, in which the quantum circuit structure search algorithm requires fewer multi-qubit quantum gates, and can obtain the desired results deterministically. Then, the comparison of the performance of our scheme and the previous algorithms is presented through numerical simulations, indicating our algorithm is feasible with current quantum technologies which is friendly to noisy intermediate-scale quantum (NISQ) devices.
Grover’s algorithm is a quantum search algorithm that makes a huge difference in finding an element of interest from unsorted and unstructured data. In the case of a classical search algorithm, testing O(N) elements within a dataset of size N is a significant number. Grover’s algorithm reduces this number to O(N)O(\sqrt N )O(N​) so the gain is obvious. This paper covers applied aspects of Grover’s algorithm, namely quantum circuit layout, efficiency of gates, fidelity of qubits, and the optimization of resources for searching unstructured data. Focus has been placed on quantum error correction: namely, planar surface code; resource costs involved have been quantified. The paper discusses the implications of quantum computing on data retrieval and how algorithms in quantum computing are crucial for solving issues presented by a changing environment of computation.