Algebraic analysis of quantum search with pure and mixed states

Daniel Shapira, Yishai Shimoni, and Ofer Biham
Phys. Rev. A 71, 042320 – Published 12 April 2005

Abstract

An algebraic analysis of Grover’s quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state ψ of n qubits. This approach reveals the geometrical structure of the quantum search process, which turns out to be confined to a four-dimensional subspace of the Hilbert space. It unifies and generalizes earlier results on the time evolution of the amplitudes during the search, the optimal number of iterations, and the success probability. Furthermore, it enables a direct generalization to the case in which the initial state is a mixed state, providing an exact formula for the success probability.

  • Received 10 January 2005

DOI:https://doi.org/10.1103/PhysRevA.71.042320

©2005 American Physical Society

Authors & Affiliations

Daniel Shapira, Yishai Shimoni, and Ofer Biham

  • Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 4 — April 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×