Geometric Strategy for the Optimal Quantum Search

Details Geometric Strategy for the Optimal Quantum Search Geometric Strategy for the Optimal Quantum Search

2001-09-21

arxiv.org/abs/quant-ph/0109109v1

Phys. Rev. A 64, 042317 (2001)

Physics

Quantum Physics

revtex, 10 pages, 7 eps figures, uses psfrag package

Scientific paper

10.1103/PhysRevA.64.042317

We explore quantum search from the geometric viewpoint of a complex projective space $CP$, a space of rays. First, we show that the optimal quantum search can be geometrically identified with the shortest path along the geodesic joining a target state, an element of the computational basis, and such an initial state as overlaps equally, up to phases, with all the elements of the computational basis. Second, we calculate the entanglement through the algorithm for any number of qubits $n$ as the minimum Fubini-Study distance to the submanifold formed by separable states in Segre embedding, and find that entanglement is used almost maximally for large $n$. The computational time seems to be optimized by the dynamics as the geodesic, running across entangled states away from the submanifold of separable states, rather than the amount of entanglement itself.

Affiliated with

Also associated with

No associations

Rating

Geometric Strategy for the Optimal Quantum Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geometric Strategy for the Optimal Quantum Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Strategy for the Optimal Quantum Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658136