Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0109109 · Physical Review A

Geometric strategy for the optimal quantum search

Akimasa Miyake, Miki Wadati

Published Sep 18, 2001• 48 citations
arXivHTMLPDF

Abstract

We explore quantum search from the geometric viewpoint of a complex projective space $C\mathcal{P},$ 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.

DOI
10.1103/physreva.64.042317

Related papers

Geometry and Dynamics of a Quantum Search Algorithm for an Ordered Tuple of Multi-Qubits

Yoshio Uwano

geodesic in (2 n+1 -1)-dimensional sphere.Further, the reduced search sequence is given rise to the complex projective space CP 2 n -1 through a geometric reduction, which is also shown to be on a geodesic in CP 2 n -1 .Roughly speaking, the reduction in [15] is made through the phase-factor elimination from quantum states, so that CP 2 n -1 is thought of as the space of rays.Note that the geodesics above are associated with the standard metric on (2 n+1 -1)-dimensional sphere and with the Fubini-Study metric on CP 2 n -1 , respectively.The Fubini-Study metric on CP 2 n -1 is utilized also in [15] to measure the minimum distance from each state involved in the search sequence to the submanifold consisting of non-entangled states, which characterizes the entanglement of the states along the search.As expected benefits of geometric and dynamical views on quantum algorithmic studies like [15], the following would be worth listed;1 By revealing underlying geometry of quantum algorithms (not necessarily universal), numbers of results in geometry are expected to be applied to make advances in quantum computation and information.2 On looked upon the iterations made in algorithms as (discrete) time-evolutions of states, numbers of results in dynamical systems are expected to be applied to make advances in quantum computation and information.3 In view of a close connection between geometry and dynamical systems, geometric and dynamical-systems studies on quantum algorithms may provide interesting examples of dynamical systems.It would be worth noting here that there exists another approach to quantum searches using adiabatic evolution [16][17][18].That approach, however, is outside the scope of this chapter since the search dealt with in this chapter is organized on the so-called amplitude magnification technique [8] which differs from the adiabatic evolution.

InTech eBooks•Feb 13, 2013•1 citation

Geometric Optimization of Quantum Control with Minimum Cost

Chengming Tan, Yuhao Cai, Zhang, Jinyi +3 more

We investigate the optimization of quantum control from a differential geometric perspective. In our approach, optimal control minimizes the cost associated with evolving a quantum state, with the cost quantified by the length of the trajectory on a relevant Riemannian manifold. We demonstrate the optimization protocol in systems with SU(2) and SU(1,1) dynamical symmetries, which encompass a broad range of physical systems. In these systems, the time evolution can be represented by trajectories on a three-dimensional manifold. Given the initial and final states, the minimum-cost quantum control corresponds to a geodesic on the manifold. When the trajectory between the initial and final states is specified, the minimum-cost control corresponds to a geodesic within a submanifold embedded in the three-dimensional space. This framework provides a geometric method for optimizing shortcuts to adiabatic driving.

arXiv:2409.14540•Sep 22, 2024•1 citation

Geometric aspects of analog quantum search evolutions

Carlo Cafaro, Shannon M. Ray, Paul M. Alsing

We use geometric concepts originally proposed by Anandan and Aharonov [Phys. Rev. Lett. 65, 1697 (1990)] to show that the Farhi-Gutmann time-optimal analog quantum search evolution between two orthogonal quantum states is characterized by unit efficiency dynamical trajectories traced on a projective Hilbert space. In particular, we prove that these optimal dynamical trajectories are the shortest geodesic paths joining the initial and the final states of the quantum evolution. In addition, we verify they describe minimum uncertainty evolutions specified by an uncertainty inequality that is tighter than the ordinary time-energy uncertainty relation. We also study the effects of deviations from the time-optimality condition from our proposed Riemannian geometric perspective. Furthermore, after pointing out some physically intuitive aspects offered by our geometric approach to quantum searching, we mention some practically relevant physical insights that could emerge from the application of our geometric analysis to more realistic time-dependent quantum search evolutions. Finally, we briefly discuss possible extensions of our paper to the geometric analysis of the efficiency of thermal trajectories of relevance in quantum computing tasks.

arXiv:2008.07675•Physical Review A•Nov 9, 2020•17 citations

The geometry of entanglement and Grover's algorithm

Toshihiro Iwai, Naoki Hayashi, Kimitake Mizobe

A measure of entanglement with respect to a bipartite partition of n -qubit has been defined and studied from the viewpoint of Riemannian geometry (Iwai 2007 J. Phys. A: Math. Theor. 40 12161 ). This paper has two aims. One is to study further the geometry of entanglement, and the other is to investigate Grover's search algorithms, both the original and the fixed-point ones, in reference with entanglement. As the distance between the maximally entangled states and the separable states is known already in the previous paper, this paper determines the set of maximally entangled states nearest to a typical separable state which is used as an initial state in Grover's search algorithms, and to find geodesic segments which realize the above-mentioned distance. As for Grover's algorithms, it is already known that while the initial and the target states are separable, the algorithms generate sequences of entangled states. This fact is confirmed also in the entanglement measure proposed in the previous paper, and then a split Grover algorithm is proposed which generates sequences of separable states only with respect to the bipartite partition.

Journal of Physics A Mathematical and Theoretical•Feb 26, 2008•5 citations

Qubit geodesics on the Bloch sphere from optimal-speed Hamiltonian evolutions

Carlo Cafaro, Paul M. Alsing

Abstract In the geometry of quantum evolutions, a geodesic path is viewed as a path of minimal statistical length connecting two pure quantum states along which the maximal number of statistically distinguishable states is minimum. In this paper, we present an explicit geodesic analysis of the dynamical trajectories that emerge from the quantum evolution of a single-qubit quantum state. The evolution is governed by an Hermitian Hamiltonian operator that achieves the fastest possible unitary evolution between given initial and final pure states. Furthermore, in addition to viewing geodesics in ray space as paths of minimal length, we also verify the geodesicity of paths in terms of unit geometric efficiency and vanishing geometric phase. Finally, based on our analysis, we briefly address the main hurdles in moving to the geometry of quantum evolutions for open quantum systems in mixed quantum states.

arXiv:2210.09142•Classical and Quantum Gravity•Apr 28, 2023•20 citations

Geometric Quantum Computing

van den Berg, FGA

We propose a fundamentally new paradigm for quantum computation based on the intrinsic geometry of quantum state space. Rather than specifying computation as a sequence of discrete gates applied over external time, Geometric Quantum Computing (GQC) defines computation as geodesic evolution through Hilbert space, where the computational 'time' emerges from the Fubini-Study metric itself. This framework inverts the standard relationship between quantum dynamics and time: instead of viewing decoherence as degradation of quantum information over time, we recognize that decoherence is time—the environment's information processing. We derive the theoretical foundations of GQC, demonstrate that it naturally circumvents barren plateaus by operating directly in state space rather than parameter space, and propose experimental protocols for implementation. The framework suggests that optimal quantum computation is achieved not by fighting decoherence but by engineering the effective geometry of state space to make desired computations correspond to natural geodesic flow.

•Dec 9, 2025•0 citations
We explore quantum search from the geometric viewpoint of a complex projective space CP,C\mathcal{P},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.
geodesic in (2 n+1 -1)-dimensional sphere.Further, the reduced search sequence is given rise to the complex projective space CP 2 n -1 through a geometric reduction, which is also shown to be on a geodesic in CP 2 n -1 .Roughly speaking, the reduction in [15] is made through the phase-factor elimination from quantum states, so that CP 2 n -1 is thought of as the space of rays.Note that the geodesics above are associated with the standard metric on (2 n+1 -1)-dimensional sphere and with the Fubini-Study metric on CP 2 n -1 , respectively.The Fubini-Study metric on CP 2 n -1 is utilized also in [15] to measure the minimum distance from each state involved in the search sequence to the submanifold consisting of non-entangled states, which characterizes the entanglement of the states along the search.As expected benefits of geometric and dynamical views on quantum algorithmic studies like [15], the following would be worth listed;1 By revealing underlying geometry of quantum algorithms (not necessarily universal), numbers of results in geometry are expected to be applied to make advances in quantum computation and information.2 On looked upon the iterations made in algorithms as (discrete) time-evolutions of states, numbers of results in dynamical systems are expected to be applied to make advances in quantum computation and information.3 In view of a close connection between geometry and dynamical systems, geometric and dynamical-systems studies on quantum algorithms may provide interesting examples of dynamical systems.It would be worth noting here that there exists another approach to quantum searches using adiabatic evolution [16][17][18].That approach, however, is outside the scope of this chapter since the search dealt with in this chapter is organized on the so-called amplitude magnification technique [8] which differs from the adiabatic evolution.
We investigate the optimization of quantum control from a differential geometric perspective. In our approach, optimal control minimizes the cost associated with evolving a quantum state, with the cost quantified by the length of the trajectory on a relevant Riemannian manifold. We demonstrate the optimization protocol in systems with SU(2) and SU(1,1) dynamical symmetries, which encompass a broad range of physical systems. In these systems, the time evolution can be represented by trajectories on a three-dimensional manifold. Given the initial and final states, the minimum-cost quantum control corresponds to a geodesic on the manifold. When the trajectory between the initial and final states is specified, the minimum-cost control corresponds to a geodesic within a submanifold embedded in the three-dimensional space. This framework provides a geometric method for optimizing shortcuts to adiabatic driving.
We use geometric concepts originally proposed by Anandan and Aharonov [Phys. Rev. Lett. 65, 1697 (1990)] to show that the Farhi-Gutmann time-optimal analog quantum search evolution between two orthogonal quantum states is characterized by unit efficiency dynamical trajectories traced on a projective Hilbert space. In particular, we prove that these optimal dynamical trajectories are the shortest geodesic paths joining the initial and the final states of the quantum evolution. In addition, we verify they describe minimum uncertainty evolutions specified by an uncertainty inequality that is tighter than the ordinary time-energy uncertainty relation. We also study the effects of deviations from the time-optimality condition from our proposed Riemannian geometric perspective. Furthermore, after pointing out some physically intuitive aspects offered by our geometric approach to quantum searching, we mention some practically relevant physical insights that could emerge from the application of our geometric analysis to more realistic time-dependent quantum search evolutions. Finally, we briefly discuss possible extensions of our paper to the geometric analysis of the efficiency of thermal trajectories of relevance in quantum computing tasks.
A measure of entanglement with respect to a bipartite partition of n -qubit has been defined and studied from the viewpoint of Riemannian geometry (Iwai 2007 J. Phys. A: Math. Theor. 40 12161 ). This paper has two aims. One is to study further the geometry of entanglement, and the other is to investigate Grover's search algorithms, both the original and the fixed-point ones, in reference with entanglement. As the distance between the maximally entangled states and the separable states is known already in the previous paper, this paper determines the set of maximally entangled states nearest to a typical separable state which is used as an initial state in Grover's search algorithms, and to find geodesic segments which realize the above-mentioned distance. As for Grover's algorithms, it is already known that while the initial and the target states are separable, the algorithms generate sequences of entangled states. This fact is confirmed also in the entanglement measure proposed in the previous paper, and then a split Grover algorithm is proposed which generates sequences of separable states only with respect to the bipartite partition.
Abstract In the geometry of quantum evolutions, a geodesic path is viewed as a path of minimal statistical length connecting two pure quantum states along which the maximal number of statistically distinguishable states is minimum. In this paper, we present an explicit geodesic analysis of the dynamical trajectories that emerge from the quantum evolution of a single-qubit quantum state. The evolution is governed by an Hermitian Hamiltonian operator that achieves the fastest possible unitary evolution between given initial and final pure states. Furthermore, in addition to viewing geodesics in ray space as paths of minimal length, we also verify the geodesicity of paths in terms of unit geometric efficiency and vanishing geometric phase. Finally, based on our analysis, we briefly address the main hurdles in moving to the geometry of quantum evolutions for open quantum systems in mixed quantum states.
We propose a fundamentally new paradigm for quantum computation based on the intrinsic geometry of quantum state space. Rather than specifying computation as a sequence of discrete gates applied over external time, Geometric Quantum Computing (GQC) defines computation as geodesic evolution through Hilbert space, where the computational 'time' emerges from the Fubini-Study metric itself. This framework inverts the standard relationship between quantum dynamics and time: instead of viewing decoherence as degradation of quantum information over time, we recognize that decoherence is time—the environment's information processing. We derive the theoretical foundations of GQC, demonstrate that it naturally circumvents barren plateaus by operating directly in state space rather than parameter space, and propose experimental protocols for implementation. The framework suggests that optimal quantum computation is achieved not by fighting decoherence but by engineering the effective geometry of state space to make desired computations correspond to natural geodesic flow.