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

Springer eBooks

An Information-Theoretic Analysis of Grover’s Algorithm

Erdal Arıkan

Published Jan 1, 2003• 9 citations
Publisher
DOI
10.1007/978-94-010-0171-7_15

Related papers

A Comparative Analysis of Grover's Algorithm with Classical Algorithms

Issac Diana Jeba Jingle, Sharlene Anna Pereira

Lecture notes in networks and systems•Jan 1, 2026•0 citations

An information-theoretic analysis of Grover's algorithm

Erdal Arıkan

This paper presents an information-theoretic analysis of Grover's algorithm and give a tight lower bound on the complexity of search algorithms using Grover's oracle. This paper also proposes the square-root speed-up performance gain of a quantum search algorithm and the significance of tight bounds based on Grover's oracle algorithm to identify target element.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•4 citations

Grover’s Algorithm and Its Generalization

Renato Portugal

Quantum science and technology•Jan 1, 2018•1 citation

An information-theoretic analysis of Grover's algorithm

Erdal Arıkan

Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical algorithms. We present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up is the best attainable result using Grover's oracle.

arXiv:quant-ph/0210068•Oct 10, 2002•5 citations

Grover’s Algorithm and Its Generalization

Renato Portugal

Springer eBooks•Jan 1, 2013•0 citations

Quantum dialogue protocol based on Grover’s search algorithms

Aihan Yin, Kemeng He, Ping Fan

Among many classic heuristic search algorithms, the Grover quantum search algorithm (QSA) can play a role of secondary acceleration. Based on the properties of the two-qubit Grover QSA, a quantum dialogue (QD) protocol is proposed. In addition, our protocol also utilizes the unitary operations and single-particle measurements. The transmitted quantum state (except for the decoy state used for detection) can transmit two-bits of security information simultaneously. Theoretical analysis shows that the proposed protocol has high security.

Modern Physics Letters A•May 27, 2019•7 citations
Among many classic heuristic search algorithms, the Grover quantum search algorithm (QSA) can play a role of secondary acceleration. Based on the properties of the two-qubit Grover QSA, a quantum dialogue (QD) protocol is proposed. In addition, our protocol also utilizes the unitary operations and single-particle measurements. The transmitted quantum state (except for the decoy state used for detection) can transmit two-bits of security information simultaneously. Theoretical analysis shows that the proposed protocol has high security.