Searching in Grover's Algorithm

Abstract

Grover's algorithm is usually described in terms of the iteration of a compound operator of the form $Q=-H{I}_{0}H{I}_{x_0}$. Although it is quite straightforward to verify the algebra of the iteration, this gives little insight into why the algorithm works. What is the significance of the compound structure of $Q$? Why is there a minus sign? Later it was discovered that $H$ could be replaced by essentially any unitary $U$. What is the freedom involved here? We give a description of Grover's algorithm which provides some clarification of these questions.

8 pages, Latex

Cited by in corpus (15)

• Information and Computation: Classical and Quantum Aspects
• Quantum Searching via Entanglement and Partial Diffusion
• Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
• Applications of Multi-Valued Quantum Algorithms
• Generalized Quantum Search Hamiltonian
• Strength and Weakness in Grover's Quantum Search Algorithm
• Quantum Amplitude Amplification Operators
• Quantum Software Engineering Challenges from Developers' Perspective: Mapping Research Challenges to the Proposed Workflow Model
• Speed and entropy of an interacting continuous time quantum walk
• An intuitive Hamiltonian for quantum search
• A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches
• Speedup of iterated quantum search by parallel performance
• Constant-Time Quantum Algorithm For The Unstructured Search Problem
• An intrinsic limitation on the size of quantum database
• Ion Trap Proposal for Quantum Search