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

Bulletin of the American Physical Society

Implementation of Grover's search algorithm using entangled `clock state' qubits

Kathy-Anne Brickman, M. Acton, Louis Deslauriers, P. C. Haljan, Patricia J. Lee, Christopher R. Monroe

Published May 17, 2006• 0 citations
OpenAlex

Related papers

Implementation of the Grover search algorithm with Josephson charge qubits

Zheng Xiao-Hu, Ping Dong, Zheng‐Yuan Xue +1 more

arXiv:cond-mat/0609699•Physica C Superconductivity•Jan 8, 2007•6 citations

Experimental implementation of Grover's search algorithm with neutral atom qubits

Yuan Sun, Martin Lichtman, K.R. Baker +1 more

Bulletin of the American Physical Society•May 25, 2016•0 citations

Success rate and entanglement measure in Grover's search algorithm for certain kinds of four qubit states

Arti Chamoli, Chandra Mohan Bhandari

Physics Letters A•Aug 16, 2005•5 citations

Implementation of Grover’s Search Algorithm in the QED Circuit for Two Superconducting Qubits

Hamid Sakhouf, Mohammed Daoud A, R. Ahl Laamara

International Journal of Theoretical Physics•Oct 3, 2020•6 citations

Coherence and Entanglement Monogamy in the Discrete Analogue of Analog Grover Search

Namit Anand, Arun Kumar Pati

Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the $\textit{analog analogue of Grover search algorithm}$. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a $n$-party monogamy inequality for arbitrary times, hence bounding the amount of $n$-qubit entanglement during the quantum search.

arXiv:1611.04542•Nov 14, 2016•53 citations

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
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the analog analogue of Grover search algorithm\textit{analog analogue of Grover search algorithm}analog analogue of Grover search algorithm. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a nnn-party monogamy inequality for arbitrary times, hence bounding the amount of nnn-qubit entanglement during the quantum search.
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 ).