Searching with Quantum Computers
Lov K. Grover (Bell Labs, Murray Hill, NJ)
TL;DR
This paper introduces quantum computation concepts by comparing them to probabilistic computation and presents a basic description of the quantum search algorithm using a novel C program representation.
Contribution
It provides an accessible analogy for quantum computation and a new way to represent the quantum search algorithm in C code.
Findings
Quantum search algorithm explained through probabilistic analogy
Novel C program representation of the quantum search algorithm
Enhanced understanding of quantum computation principles
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture