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:quant-ph/0011118 · Dr. Dobb's Journal archive

Searching with Quantum Computers

Lov K. Grover

Published Nov 30, 2000• 12 citations
arXivHTMLPDF

Abstract

This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
DOI
10.48550/arxiv.quant-ph/0011118

Related papers

A PHYSICS-FREE INTRODUCTION TO THE QUANTUM COMPUTATION MODEL

Stephen Fenner

This article defines and proves basic properties of the standard quantum circuit model of computation. The model is developed abstractly in close analogy with (classical) deterministic and probabilistic circuits, without recourse to any physical concepts or principles. It is intended as a primer for theoretical computer scientists who do not know--and perhaps do not care to know--any physics.

arXiv:cs/0304008•WORLD SCIENTIFIC eBooks•Apr 1, 2004•3 citations

Reasoning about Grover's quantum search algorithm using probabilistic wp

Michael J. Butler, Pieter Hartel

Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this article, the probabilistic wp -calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a rigorous programming notation for modeling this and other quantum algorithms and that it also provides a systematic framework of analyzing such algorithms.

arXiv:quant-ph/9810066•ACM Transactions on Programming Languages and Systems•May 1, 1999•17 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

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•0 citations

Quantum search algorithm

Lukáš Mejdrech

In this work we study Grover's algorithm for quantum computers. This algorithm promises to search in an unstructured database in time comparable with a square root of the number of objects. A description of basic quantum computer principles is followed by the original Grover's formulation and a proof of the algorithm, as well as a later geometrical description of the algorithm. We also mention their suitability for educational purposes. We also include a description of the Grover's algorithm in a programming language, which makes it possible to simulate a quantum computing on classical computers.

•Jan 1, 2007•0 citations

Implementation of a quantum search algorithm on a quantum computer

Jonathan A. Jones, Michele Mosca, Rasmus H. Hansen

arXiv:quant-ph/9805069•Nature•May 1, 1998•556 citations
In this work we study Grover's algorithm for quantum computers. This algorithm promises to search in an unstructured database in time comparable with a square root of the number of objects. A description of basic quantum computer principles is followed by the original Grover's formulation and a proof of the algorithm, as well as a later geometrical description of the algorithm. We also mention their suitability for educational purposes. We also include a description of the Grover's algorithm in a programming language, which makes it possible to simulate a quantum computing on classical computers.