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

International Conference on Electrical, Communication, and Computer Engineering (ICECCE)

Study of quantum algorithms and their implementations

Giancarlo P. Gamberi, Calebe P. Bianchini

Published Dec 30, 2023• 0 citations
Publisher

Abstract

In this work, we studied some quantum algorithms, and selected Grover search problem, it will then receive an in-depth analysis of how the problem works and how it can be adapted to its process in a quantum computer, and a quantum solution using python qiskit library will be elaborated.
DOI
10.1109/icecce61019.2023.10442031

Related papers

Quantum Algorithms in Quantum Computers

Fernández Sánchez, Xabier

[EN] An introduction to quantum computing and the quantum circuit model is given. Three quantum algorithms (Grover's Algorithm, Counting Algorithm and Shor's Algorithm) are discussed and simulated using Python coding and Qiskit libraries. Simulation results are discussed and compared with theoretical expectations.

•Jul 19, 2024•0 citations

The Research of Grover’s Quantum Search Algorithm with Use of Quantum Circuits QX2 and QX4

Arkadiusz Liber, Laurentiu Nita

Advances in intelligent systems and computing•Aug 29, 2018•1 citation

A Bi-directional multi-solution scalable Grover search Algorithm

Debanjan Konar, Zain Hafeez, Vaneet Aggarwal

Abstract Grover’s search algorithms, including various partial Grover searches (PGS), experience scaling problems when multiple solutions are sought, as the number of iterations increases with the number of solutions or marked states, making implementation more computationally expensive. Inspired by recent PGS algorithms for multi-solution searchers, this article proposes a scalable Grover quantum search algorithm, referred to as Bi-directional Multi-solution scalable Grover Search (BMGS), to efficiently search for an arbitrary number of solutions from an unstructured database. We introduced a novel multi-segment bidirectional search tactic with PGS across multiple equal segments of each state, starting from an initial state and multiple marked states in parallel, obviating the need for merge operations. We have shown in this work that for each solution our novel approach requires at most $$\sqrt{\mathcal {N}}\left( 1- \sqrt{\frac{1}{b^{\lfloor \frac{r}{dk}\rfloor }}}\right) $$ N 1 - 1 b ⌊ r dk ⌋ iterations (here, $$\mathcal {N}=2^r$$ N = 2 r elements, $$k=\log _2 b$$ k = log 2 b , d is the number of equal segments on r qubits, and b is the branching factor). Our proposed BMGS algorithm is benchmarked against state-of-the-art Depth-First Grover Search (DFGS) and PGS implementations for an arbitrary number of solutions, ranging from 2 to 20 qubits, as a proof of concept. We also show that our BMGS requires fewer iterations for shallow quantum circuits and achieves an optimal $$\mathcal {O}$$ O ( $$\sqrt{s\mathcal {N}}$$ s N ) average complexity for s solutions, when $$dk < r$$ d k < r . The Qiskit Python implementation of the proposed BMGS algorithm is available on GitHub ( https://github.com/hafeezzwiz21/Multi-Solution-DFGS-BMGS ).

arXiv:2404.15616•Quantum Information Processing•Sep 3, 2026•0 citations

Quantum search algorithms

Andris Ambainis

We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on quantum walks.

arXiv:quant-ph/0504012•ACM SIGACT News•Jun 1, 2004•193 citations

Optimization of a Quantum Subset Sum Oracle

Benoit, Angelo, Schwartz, Sam, Ron K. Cytron

We investigate the implementation of an oracle for the Subset Sum problem for quantum search using Grover's algorithm. Our work concerns reducing the number of qubits, gates, and multi-controlled gates required by the oracle. We describe the compilation of a Subset Sum instance into a quantum oracle, using a Python library we developed for Qiskit and have published in GitHub. We then present techniques to conserve qubits and gates along with experiments showing their effectiveness on random instances of Subset Sum. These techniques include moving from fixed to varying-width arithmetic, using partial sums of a set's integers to determine specific integer widths, and sorting the set to obtain provably the most efficient partial sums. We present a new method for computing bit-string comparisons that avoids arbitrarily large multiple-control gates, and we introduce a simple modification to the oracle that allows for approximate solutions to the Subset Sum problem via Grover search.

arXiv:2410.01775•Oct 2, 2024•0 citations

A panoply of quantum algorithms

FurrowBartholomew

This paper's aim is to explore improvements to, and applications of, a fundamental quantum algorithm invented by Grover[1]. Grover's algorithm is a basic tool that can be applied to a large number ...

Quantum Information and Computation•Sep 1, 2008•0 citations
Abstract Grover’s search algorithms, including various partial Grover searches (PGS), experience scaling problems when multiple solutions are sought, as the number of iterations increases with the number of solutions or marked states, making implementation more computationally expensive. Inspired by recent PGS algorithms for multi-solution searchers, this article proposes a scalable Grover quantum search algorithm, referred to as Bi-directional Multi-solution scalable Grover Search (BMGS), to efficiently search for an arbitrary number of solutions from an unstructured database. We introduced a novel multi-segment bidirectional search tactic with PGS across multiple equal segments of each state, starting from an initial state and multiple marked states in parallel, obviating the need for merge operations. We have shown in this work that for each solution our novel approach requires at most N(1−1b⌊rdk⌋)\sqrt{\mathcal {N}}\left( 1- \sqrt{\frac{1}{b^{\lfloor \frac{r}{dk}\rfloor }}}\right) N​(1−b⌊dkr​⌋1​​) N 1 - 1 b ⌊ r dk ⌋ iterations (here, N=2r\mathcal {N}=2^rN=2r N = 2 r elements, k=log⁡2bk=\log _2 bk=log2​b k = log 2 b , d is the number of equal segments on r qubits, and b is the branching factor). Our proposed BMGS algorithm is benchmarked against state-of-the-art Depth-First Grover Search (DFGS) and PGS implementations for an arbitrary number of solutions, ranging from 2 to 20 qubits, as a proof of concept. We also show that our BMGS requires fewer iterations for shallow quantum circuits and achieves an optimal O\mathcal {O}O O ( sN\sqrt{s\mathcal {N}}sN​ s N ) average complexity for s solutions, when dk<rdk < rdk<r d k < r . The Qiskit Python implementation of the proposed BMGS algorithm is available on GitHub ( https://github.com/hafeezzwiz21/Multi-Solution-DFGS-BMGS ).
We investigate the implementation of an oracle for the Subset Sum problem for quantum search using Grover's algorithm. Our work concerns reducing the number of qubits, gates, and multi-controlled gates required by the oracle. We describe the compilation of a Subset Sum instance into a quantum oracle, using a Python library we developed for Qiskit and have published in GitHub. We then present techniques to conserve qubits and gates along with experiments showing their effectiveness on random instances of Subset Sum. These techniques include moving from fixed to varying-width arithmetic, using partial sums of a set's integers to determine specific integer widths, and sorting the set to obtain provably the most efficient partial sums. We present a new method for computing bit-string comparisons that avoids arbitrarily large multiple-control gates, and we introduce a simple modification to the oracle that allows for approximate solutions to the Subset Sum problem via Grover search.