Analysis of Grover's quantum search algorithm as a dynamical system

Ofer Biham, Daniel Shapira, Yishai Shimoni

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

The dynamical behavior and the success probability of Grover's quantum search algorithm for arbitrary pure quantum states were studied. The probability of success of the algorithm, Ps, was expressed in terms of the amplitudes of a given initial state. It was found that the success probability did not depend on the number of marked states used in the algorithm.

Original languageEnglish
Article number022326
Pages (from-to)223261-223268
Number of pages8
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume68
Issue number2
StatePublished - 1 Jan 2003
Externally publishedYes

Fingerprint

Dive into the research topics of 'Analysis of Grover's quantum search algorithm as a dynamical system'. Together they form a unique fingerprint.

Cite this