Algebraic analysis of quantum search with pure and mixed states
arXiv:quant-ph/0504149 · doi:10.1103/PhysRevA.71.042320
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. This work unifies and generalizes earlier results on the time evolution of the amplitudes during the quantum 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.
13 pages
References in corpus (18)
- Quantum Mechanics helps in searching for a needle in a haystack
- Strengths and Weaknesses of Quantum Computing
- Tight bounds on quantum searching
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- Quantum computers can search arbitrarily large databases by a single query
- Phase matching in quantum searching
- Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
- Nested quantum search and NP-complete problems
- Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
- An entanglement monotone derived from Grover's algorithm
- Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm
- Single quantum querying of a database
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
- Geometric Strategy for the Optimal Quantum Search
- Generalized Quantum Search with Parallelism
- Analysis of Grover's quantum search algorithm as a dynamical system