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:2601.10662 · International Journal of Theoretical Physics

Geometric Aspects of Entanglement Generating Hamiltonian Evolutions

Carlo Cafaro, James Schneeloch

quant-phSubmitted Jan 15, 2026• Announced Jan 16, 2026• 0 citations• Revised Jun 6, 2026 (v2)
v1 · Jan 15, 2026v2 · Jun 6, 2026
arXivHTMLPDF

Abstract

We examine the pertinent geometric characteristics of entanglement that arise from stationary Hamiltonian evolutions transitioning from separable to maximally entangled two-qubit quantum states. From a geometric perspective, each evolution is characterized by means of geodesic efficiency, speed efficiency, and curvature coefficient. Conversely, from the standpoint of entanglement, these evolutions are quantified using various metrics, such as concurrence, entanglement power, and entangling capability. Overall, our findings indicate that time-optimal evolution trajectories are marked by high geodesic efficiency, with no energy resource wastage, no curvature (i.e., zero bending), and an average path entanglement that is less than that observed in time-suboptimal evolutions. Additionally, when analyzing separable-to-maximally entangled evolutions between nonorthogonal states, time-optimal evolutions demonstrate a greater short-time degree of nonlocality compared to time-suboptimal evolutions between the same initial and final states. Interestingly, the reverse is generally true for separable-to-maximally entangled evolutions involving orthogonal states. Our investigation suggests that this phenomenon arises because suboptimal trajectories between orthogonal states are characterized by longer path lengths with smaller curvature, which are traversed with a higher energy resource wastage compared to suboptimal trajectories between nonorthogonal states. Consequently, a higher initial degree of nonlocality in the unitary time propagators appears to be essential for achieving the maximally entangled state from a separable state. Furthermore, when assessing optimal and suboptimal evolutions...

Journal reference
Int. J. Theor. Phys. 65, 177 (2026)
Comments
27 pages, 2 figures, 3 tables

Related papers

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

Complexity of quantum-mechanical evolutions from probability amplitudes

Carlo Cafaro, Leonardo Rossetti, Paul M. Alsing

We study the complexity of both time-optimal and time sub-optimal quantum Hamiltonian evolutions connecting arbitrary source and a target states on the Bloch sphere equipped with the Fubini-Study metric. This investigation is performed in a number of steps. First, we describe each unitary Schrödinger quantum evolution by means of the path length, the geodesic efficiency, the speed efficiency, and the curvature coefficient of its corresponding dynamical trajectory linking the source state to the target state. Second, starting from a classical probabilistic setting where the so-called information geometric complexity can be employed to describe the complexity of entropic motion on curved statistical manifolds underlying the physics of systems when only partial knowledge about them is available, we transition into a deterministic quantum setting. In this context, after proposing a definition of the complexity of a quantum evolution, we present a notion of quantum complexity length scale. In particular, we discuss the physical significance of both quantities in terms of the accessed (i.e., partial) and accessible (i.e., total) parametric volumes of the regions on the Bloch sphere that specify the quantum mechanical evolution from the source to the target states. Third, after calculating the complexity measure and the complexity length scale for each one of the two quantum evolutions, we compare the behavior of our measures with that of the path length, the geodesic efficiency, the speed efficiency, and the curvature coefficient. We find that, in general, efficient quantum evolutions are less complex than inefficient evolutions. However, we also observe that complexity is more than length. Indeed, longer paths that are sufficiently bent can exhibit a behavior that is less complex than that of shorter paths with a smaller curvature coefficient.

arXiv:2408.14241•Nuclear Physics B•Nov 26, 2024•6 citations

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

Manifolds of Product States of Three Qubits

Fotios D. Oikonomou

Quantum entanglement has played a pivotal role in both theoretical investigations and practical applications within quantum information science. In this study, we explore the connection between entanglement and geometric structures, specifically manifolds and their associated geometric properties such as curvature. We focus on the manifolds formed by the product states of three qubits, examining the induced metric derived from the Euclidean metric, the Levi-Civita connection, and, where computationally tractable, the scalar curvature. Consequently, separable states can be characterized as convex combinations of points residing on these manifolds, whereas non-separable states exhibit entanglement.

•Jun 30, 2025•0 citations

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

Quantum Information and Computation•Nov 1, 2008•130 citations

Geometric Aspects of Entanglement

Lucio De Simone, Lorenzo Capra, Arthur Vesperini +3 more

Quantum entanglement is a fundamental resource in quantum information theory, yet its general characterization and quantification remain challenging, especially in multipartite systems. In this work we investigate entanglement from a geometric perspective, focusing on the Riemannian structure induced by the Fubini--Study metric on the projective Hilbert space of multi-qubit quantum states. By exploiting the local-unitary invariance of this metric, we derive the entanglement distance (ED), a geometric measure that quantifies entanglement as an obstruction to locally minimizing the sum of squared Fubini--Study distances generated by local operations. We analyze the properties of ED for pure multi-qubit states and discuss its behavior under local operations and classical communication. In particular, we show that ED reproduces established entanglement measures in well-defined and restricted settings. For pure states of two qubits, ED reduces to an exact monotone function of the concurrence and, independently, to an explicit monotone function of the entropy of entanglement. These results provide a clear geometric interpretation of standard bipartite entanglement measures within the present framework, while highlighting the limitations of such correspondences beyond the two-qubit case.

quant-pharXiv:2610.03446•Entropy•Oct 5, 2026•3 citations
We examine the pertinent geometric characteristics of entanglement that arise from stationary Hamiltonian evolutions transitioning from separable to maximally entangled two-qubit quantum states. From a geometric perspective, each evolution is characterized by means of geodesic efficiency, speed efficiency, and curvature coefficient. Conversely, from the standpoint of entanglement, these evolutions are quantified using various metrics, such as concurrence, entanglement power, and entangling capability. Overall, our findings indicate that time-optimal evolution trajectories are marked by high geodesic efficiency, with no energy resource wastage, no curvature (i.e., zero bending), and an average path entanglement that is less than that observed in time-suboptimal evolutions. Additionally, when analyzing separable-to-maximally entangled evolutions between nonorthogonal states, time-optimal evolutions demonstrate a greater short-time degree of nonlocality compared to time-suboptimal evolutions between the same initial and final states. Interestingly, the reverse is generally true for separable-to-maximally entangled evolutions involving orthogonal states. Our investigation suggests that this phenomenon arises because suboptimal trajectories between orthogonal states are characterized by longer path lengths with smaller curvature, which are traversed with a higher energy resource wastage compared to suboptimal trajectories between nonorthogonal states. Consequently, a higher initial degree of nonlocality in the unitary time propagators appears to be essential for achieving the maximally entangled state from a separable state. Furthermore, when assessing optimal and suboptimal evolutions...
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 study the complexity of both time-optimal and time sub-optimal quantum Hamiltonian evolutions connecting arbitrary source and a target states on the Bloch sphere equipped with the Fubini-Study metric. This investigation is performed in a number of steps. First, we describe each unitary Schrödinger quantum evolution by means of the path length, the geodesic efficiency, the speed efficiency, and the curvature coefficient of its corresponding dynamical trajectory linking the source state to the target state. Second, starting from a classical probabilistic setting where the so-called information geometric complexity can be employed to describe the complexity of entropic motion on curved statistical manifolds underlying the physics of systems when only partial knowledge about them is available, we transition into a deterministic quantum setting. In this context, after proposing a definition of the complexity of a quantum evolution, we present a notion of quantum complexity length scale. In particular, we discuss the physical significance of both quantities in terms of the accessed (i.e., partial) and accessible (i.e., total) parametric volumes of the regions on the Bloch sphere that specify the quantum mechanical evolution from the source to the target states. Third, after calculating the complexity measure and the complexity length scale for each one of the two quantum evolutions, we compare the behavior of our measures with that of the path length, the geodesic efficiency, the speed efficiency, and the curvature coefficient. We find that, in general, efficient quantum evolutions are less complex than inefficient evolutions. However, we also observe that complexity is more than length. Indeed, longer paths that are sufficiently bent can exhibit a behavior that is less complex than that of shorter paths with a smaller curvature coefficient.
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.
Quantum entanglement has played a pivotal role in both theoretical investigations and practical applications within quantum information science. In this study, we explore the connection between entanglement and geometric structures, specifically manifolds and their associated geometric properties such as curvature. We focus on the manifolds formed by the product states of three qubits, examining the induced metric derived from the Euclidean metric, the Levi-Civita connection, and, where computationally tractable, the scalar curvature. Consequently, separable states can be characterized as convex combinations of points residing on these manifolds, whereas non-separable states exhibit entanglement.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
Quantum entanglement is a fundamental resource in quantum information theory, yet its general characterization and quantification remain challenging, especially in multipartite systems. In this work we investigate entanglement from a geometric perspective, focusing on the Riemannian structure induced by the Fubini--Study metric on the projective Hilbert space of multi-qubit quantum states. By exploiting the local-unitary invariance of this metric, we derive the entanglement distance (ED), a geometric measure that quantifies entanglement as an obstruction to locally minimizing the sum of squared Fubini--Study distances generated by local operations. We analyze the properties of ED for pure multi-qubit states and discuss its behavior under local operations and classical communication. In particular, we show that ED reproduces established entanglement measures in well-defined and restricted settings. For pure states of two qubits, ED reduces to an exact monotone function of the concurrence and, independently, to an explicit monotone function of the entropy of entanglement. These results provide a clear geometric interpretation of standard bipartite entanglement measures within the present framework, while highlighting the limitations of such correspondences beyond the two-qubit case.