On the class of diffusion operators for fast quantum search

Abstract

Grover's quantum search algorithm evolves a quantum system from a known source state |s to an unknown target state |t using the selective phase inversions, Is and It, of these two states. In one of the generalizations of Grover's algorithm, Is is replaced by a general diffusion operator Ds having |s as an eigenstate and It is replaced by a general selective phase rotation Itφ. A fast quantum search is possible as long as the operator Ds and the angle φ satisfies certain conditions. These conditions are very restrictive in nature. Specifically, suppose | denote the eigenstates of Ds corresponding to the eigenphases θ. Then the sum of the terms | |t|2(θ/2) over all ≠ s has to be almost equal to (φ/2) for a fast quantum search. In this paper, we show that this condition can be significantly relaxed by introducing appropriate modifications of the algorithm. This allows access to a more general class of diffusion operators for fast quantum search.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…