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

arXiv:1709.01236

Early days following Grover's quantum search algorithm

Fang Song

Published Sep 5, 2017• 5 citations
arXivHTMLPDF

Abstract

This is a note accompanying "CS 410/510: INTRO TO QUANTUM COMPUTING" I taught at Portland State University in Spring 2017. It is a review and summary of some early results related to Grover's quantum search algorithm in a consistent way. I had to go back and forth among several books, notes and original papers to sort out various details when preparing the lectures, which was a pain. This is the motivation behind this note. I would like to thank Peter Høyer for valuable feedback on this note.

DOI
10.48550/arxiv.1709.01236

Related papers

Grover's quantum search algorithm

Samuel J. Lomonaco

This paper is a written version of a one hour lecture given on Lov Grover's database search algorithm. Table Of Contents 1 ... Problem Definition 2 ... The quantum mechanical perspective 3 ... Properties of the inversion I_|psi> 4 ... The method in Lov's "madness" 5 ... Summary of Grover's algorithm 6 ... An example of Grover's algorithm References

arXiv:quant-ph/0010040•Oct 10, 2000•5 citations

Lecture Notes on Quantum Algorithms

Kamil Ravilevich Khadiev

The lecture notes contain three parts. The first part is Grover's Search Algorithm with modifications, generalizations, and applications. The second part is a discussion on the quantum fingerprinting technique. The third part is Quantum Walks (discrete time) algorithm with applications.

arXiv:2212.14205•Dec 29, 2022•26 citations

Another classical analog of Grover's quantum search

Shayak Bhattacharjee

In this work I describe a classical analog of Grover's quantum searching algorithm, explaining why a quantum algorithm should be able to perform search in O(sqrtN) steps and also acting as a useful pedagogic demonstration.

arXiv:1411.6551•Nov 21, 2014•1 citation

ON THE DESIGN OF EFFICIENT QUANTUM ALGORITHMS

Tetsuro Nishino

In this paper, we consider how to design efficient quantum algorithms by using the quantum database search algorithm designed by L. Grover, and show the following results: (1) we show how to apply an efficient quantum algorithm for finding the minimum designed by Dürr and Høyer to the shortest vector in lattice problem. The algorithm by Dürr and Høyer is designed based on Grover's algorithm, and (2) we estimate the time complexity of quantum algorithm for the collision problem, which are designed by using Grover's algorithm and various sorting algorithms.

•May 1, 2001•0 citations

Current Status and Prospects of Quantum Search Algorithm: Grover’s Algorithm

Joonho Bae

New Physics Sae Mulli•Oct 31, 2024•0 citations

A “path integral” approach to quantum mechanics

Salvatore Esposito

From January to March 1938 – as we have seen in Chapter 1 – Majorana delivered his only lectures on quantum mechanics at the University of Naples, where he obtained a position as a full professor of theoretical physics. He prepared a set of lecture notes [26] for his students (see Section 13.5), and, among the original manuscripts of these lectures, we find some additional spare papers that cannot be considered as notes for academic lectures, even for an advanced course such as that taught by Majorana. Instead, as suggested in Refs. [328, 329], they probably refer to a seminar or conference held at the University of Naples, whose main topic was likely the theoretical interpretation of the molecular bonding in the framework of quantum mechanics; the notes were prepared by Majorana for his own personal use.

Cambridge University Press eBooks•Dec 11, 2014•0 citations
This is a note accompanying "CS 410/510: INTRO TO QUANTUM COMPUTING" I taught at Portland State University in Spring 2017. It is a review and summary of some early results related to Grover's quantum search algorithm in a consistent way. I had to go back and forth among several books, notes and original papers to sort out various details when preparing the lectures, which was a pain. This is the motivation behind this note. I would like to thank Peter Høyer for valuable feedback on this note.
In this paper, we consider how to design efficient quantum algorithms by using the quantum database search algorithm designed by L. Grover, and show the following results: (1) we show how to apply an efficient quantum algorithm for finding the minimum designed by Dürr and Høyer to the shortest vector in lattice problem. The algorithm by Dürr and Høyer is designed based on Grover's algorithm, and (2) we estimate the time complexity of quantum algorithm for the collision problem, which are designed by using Grover's algorithm and various sorting algorithms.
From January to March 1938 – as we have seen in Chapter 1 – Majorana delivered his only lectures on quantum mechanics at the University of Naples, where he obtained a position as a full professor of theoretical physics. He prepared a set of lecture notes [26] for his students (see Section 13.5), and, among the original manuscripts of these lectures, we find some additional spare papers that cannot be considered as notes for academic lectures, even for an advanced course such as that taught by Majorana. Instead, as suggested in Refs. [328, 329], they probably refer to a seminar or conference held at the University of Naples, whose main topic was likely the theoretical interpretation of the molecular bonding in the framework of quantum mechanics; the notes were prepared by Majorana for his own personal use.