Geometric Strategy for the Optimal Quantum Search

Abstract

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.

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

References in corpus (5)

• Time Optimal Control in Spin Systems
• The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
• Sophisticated quantum search without entanglement
• Geometry of entangled states
• Quantum Holonomies for Quantum Computing

Cited by in corpus (30)

• Quantum Brachistochrone
• Classification of multipartite entangled states by multidimensional determinants
• Quantum games: a review of the history, current state, and interpretation
• Elementary Derivation for Passage Times
• An entanglement monotone derived from Grover's algorithm
• Entanglement and local information access for graph states
• Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
• Relative entropy of entanglement for certain multipartite mixed states
• On Grover's Search Algorithm from a Quantum Information Geometry Viewpoint
• Entangled Quantum States Generated by Shor's Factoring Algorithm
• The Groverian Measure of Entanglement for Mixed States
• Elementary proof of the bound on the speed of quantum evolution
• Geometric Algebra and Information Geometry for Quantum Computational Software
• The quantum brachistochrone problem for non-Hermitian Hamiltonians
• Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions
• Geometry and symmetry of quantum and classical-quantum variational principles
• Exchange symmetry and global entanglement and full separability
• Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes
• Formation of Multipartite Entanglement Using Random Quantum Gates
• Geometric aspects of analog quantum search evolutions
• Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm
• Algebraic analysis of quantum search with pure and mixed states
• Necessity of Superposition of Macroscopically Distinct States for Quantum Computational Speedup
• Measure of the density of quantum states in information geometry and its application in the quantum multi-parameter estimation
• On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution
• Quantum geometry in many-body systems with precursors of criticality
• Fidelity-based supervised and unsupervised learning for binary classification of quantum states
• Voronoi Diagrams for Quantum States and Its Application to a Numerical Estimation of a Quantum Channel Capacity
• All the trajectories of an extended averaged Hebbian learning equation on the quantum state space are the e-geodesics