[Paper Review] Searching with Quantum Computers

Lou K. Grover|ArXiv.org|Nov 30, 2000

Quantum Computing Algorithms and Architecture3 citations

TL;DR

This paper introduces quantum search using Grover's algorithm, demonstrating a quadratic speedup over classical search by leveraging quantum superposition and amplitude amplification. It shows that a quantum computer can search an unsorted database of N items in O(√N) queries, contrasting sharply with the O(N) complexity of classical methods.

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.

Motivation & Objective

• To demonstrate the potential of quantum computers by introducing the quantum search algorithm as a paradigmatic example.
• To explain how quantum mechanics enables exponential speedups in specific computational tasks.
• To motivate the development of quantum hardware by showing that quantum algorithms can solve real problems more efficiently than classical ones.
• To clarify the conceptual shift from classical bits to qubits and the role of superposition and interference in quantum computation.

Proposed method

• Uses the quantum search algorithm to search an unsorted database of N items by initializing a uniform superposition over all possible states.
• Applies a series of Grover iterations that amplify the amplitude of the marked state through interference, using a diffusion operator to invert amplitudes about the average.
• Employs the principle of quantum parallelism, where a single query evaluates the function on all inputs simultaneously due to superposition.
• Utilizes the linearity of quantum evolution and unitary transformations to manipulate amplitude vectors, ensuring probability conservation.
• Demonstrates amplitude manipulation through path summation in a 4-state system, showing interference effects that lead to constructive and destructive interference.
• Applies reversible quantum gates (e.g., controlled-NOT, Toffoli) to preserve unitarity and allow coherent evolution of the quantum state.

Experimental results

Research questions

• RQ1 Can quantum computers achieve a significant speedup over classical computers for unstructured search problems?
• RQ2 How does quantum superposition and interference enable faster search compared to classical exhaustive search?
• RQ3 What are the fundamental principles—such as amplitude amplification and unitary evolution—that underlie the quantum search algorithm?
• RQ4 What are the physical and engineering challenges in realizing a scalable quantum computer capable of running such algorithms?
• RQ5 How do quantum systems maintain coherence and avoid decoherence during computation?

Key findings

• The quantum search algorithm achieves a quadratic speedup, requiring only O(√N) queries to find a marked item in an unsorted database of size N, compared to O(N) for classical algorithms.
• The algorithm leverages quantum superposition to evaluate all inputs simultaneously and uses amplitude amplification to increase the probability of measuring the correct solution.
• After three iterations in a 4-item database, the amplitude of the correct state reaches -1.0, indicating a 100% probability of measuring the marked item.
• The process relies on unitary transformations and reversible gates to preserve quantum coherence and ensure probability conservation.
• Quantum interference—constructive and destructive—plays a central role in amplifying the amplitude of the desired state while suppressing others.
• Current experimental implementations using NMR have demonstrated the algorithm on small-scale systems with up to 7 qubits, though scalability remains a challenge.