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:2209.10661 · Physical review. D/Physical review. D.

Complexity of pure and mixed qubit geodesic paths on curved manifolds

Carlo Cafaro, Paul M. Alsing

Published Nov 8, 2022• 15 citations
arXivHTMLPDF

Abstract

It is known that mixed quantum states are highly entropic states of imperfect knowledge (i.e., incomplete information) about a quantum system, while pure quantum states are states of perfect knowledge (i.e., complete information) with vanishing von Neumann entropy. In this paper, we propose an information geometric theoretical construct to describe and, to a certain extent, understand the complex behavior of evolutions of quantum systems in pure and mixed states. The comparative analysis is probabilistic in nature, it uses a complexity measure that relies on a temporal averaging procedure along with a long-time limit, and is limited to analyzing expected geodesic evolutions on the underlying manifolds. More specifically, we study the complexity of geodesic paths on the manifolds of single-qubit pure and mixed quantum states equipped with the Fubini-Study metric and the Sj\"oqvist metric, respectively. We analytically show that the evolution of mixed quantum states in the Bloch ball is more complex than the evolution of pure states on the Bloch sphere. We also verify that the ranking based on our proposed measure of complexity, a quantity that represents the asymptotic temporal behavior of an averaged volume of the region explored on the manifold during the evolution of the systems, agrees with the geodesic length-based ranking. Finally, focusing on geodesic lengths and curvature properties in manifolds of mixed quantum states, we observed a softening of the complexity on the Bures manifold compared to the Sj\"oqvist manifold.

DOI
10.1103/physrevd.106.096004

Related papers

Geometric Aspects of Mixed Quantum States Inside the Bloch Sphere

Paul M. Alsing, Carlo Cafaro, Domenico Felice +1 more

When studying the geometry of quantum states, it is acknowledged that mixed states can be distinguished by infinitely many metrics. Unfortunately, this freedom causes metric-dependent interpretations of physically significant geometric quantities such as the complexity and volume of quantum states. In this paper, we present an insightful discussion on the differences between the Bures and the Sjöqvist metrics inside a Bloch sphere. First, we begin with a formal comparative analysis between the two metrics by critically discussing three alternative interpretations for each metric. Second, we explicitly illustrate the distinct behaviors of the geodesic paths on each one of the two metric manifolds. Third, we compare the finite distances between an initial state and the final mixed state when calculated with the two metrics. Interestingly, in analogy with what happens when studying the topological aspects of real Euclidean spaces equipped with distinct metric functions (for instance, the usual Euclidean metric and the taxicab metric), we observe that the relative ranking based on the concept of a finite distance between mixed quantum states is not preserved when comparing distances determined with the Bures and the Sjöqvist metrics. Finally, we conclude with a brief discussion on the consequences of this violation of a metric-based relative ranking on the concept of the complexity and volume of mixed quantum states.

arXiv:2312.02004•Quantum Reports•Feb 6, 2024•9 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

Krylov's State Complexity and Information Geometry in Qubit Dynamics

Carlo Cafaro, Emma Clements, Vishnu Vardhan Anuboyina

We compare Krylov's state complexity with an information-geometric (IG) measure of complexity for the quantum evolution of two-level systems. Focusing on qubit dynamics on the Bloch sphere, we analyze evolutions generated by stationary and nonstationary Hamiltonians, corresponding to geodesic and nongeodesic trajectories. We formulate Krylov complexity in geometric terms, both instantaneously and in a time-averaged sense, and contrast it with an IG complexity of quantum evolutions characterized in terms of efficiency and curvature. We show that the two measures reflect fundamentally different aspects of quantum dynamics: Krylov's state complexity quantifies the directional spread of the evolving state relative to the initial state, whereas the IG complexity captures the effective volume explored along the trajectory on the Bloch sphere. This geometric distinction explains their inequivalent behavior and highlights the complementary nature of state-based and information-geometric notions of complexity in quantum systems.

quant-pharXiv:2601.18941•The European Physical Journal Plus•Jan 28, 2026•2 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

Bures geodesics for non-faithful states and quantum speed limit

Sergio Carrasco, Dominique Spehner

The quantum speed limit establishes a bound on the minimal time required for a quantum system to evolve from a given initial state to a final state. When the mean energy variance is fixed this limitation is captured by the Mandelstam--Tamm bound. The fastest quantum evolution saturating this bound follows a geodesic arc connecting the two states. Such geodesics in the manifold of quantum states are explicitly known when the states are pure (Fubini-Study geodesics) and when they are mixed and given by faithful density matrices (Bures geodesics). In this article we obtain the explicit form of the Bures geodesic arcs joining two non-faithful density matrices, which may have different ranks. For pure states one recovers the Fubini-Study geodesics. A necessary and sufficient condition for the uniqueness of the shortest geodesic arc is given. When the condition is not fulfilled there are infinitely many such arcs, all having length equal to the arccos Bures distance between the two states, in analogy with the arcs of great circles connecting the two poles of a sphere. We discuss the implications of our results for the quantum speed limit.

quant-pharXiv:2606.06759•Jun 8, 2026•0 citations

Efficiency, Curvature, and Complexity of Quantum Evolutions for Qubits in Nonstationary Magnetic Fields

Carlo Cafaro, James Schneeloch

In optimal quantum-mechanical evolutions, motion can take place along paths of minimal length within an optimal time frame. Alternatively, optimal evolutions may occur along established paths without any waste of energy resources and achieving 100% speed efficiency. Unfortunately, realistic physical scenarios often lead to less-than-ideal evolutions that demonstrate suboptimal efficiency, nonzero curvature, and a high level of complexity. In this paper, we provide an exact analytical expression for the curvature of a quantum evolution pertaining to a two-level quantum system subjected to various time-dependent magnetic fields. Specifically, we examine the dynamics produced by a two-parameter nonstationary Hermitian Hamiltonian with unit speed efficiency. To enhance our understanding of the physical implications of the curvature coefficient, we analyze the curvature behavior in relation to geodesic efficiency, speed efficiency, and the complexity of the quantum evolution (as described by the ratio of the difference between accessible and accessed Bloch-sphere volumes for the evolution from initial to final state to the accessible volume for the given quantum evolution). Our findings indicate that, generally, efficient quantum evolutions exhibit lower complexity compared to inefficient ones. However, we also note that complexity transcends mere length. In fact, longer paths that are sufficiently curved can demonstrate a complexity that is less than that of shorter paths with a lower curvature coefficient.

quant-pharXiv:2601.10672•International Journal of Geometric Methods in Modern Physics•Jan 16, 2026•0 citations
It is known that mixed quantum states are highly entropic states of imperfect knowledge (i.e., incomplete information) about a quantum system, while pure quantum states are states of perfect knowledge (i.e., complete information) with vanishing von Neumann entropy. In this paper, we propose an information geometric theoretical construct to describe and, to a certain extent, understand the complex behavior of evolutions of quantum systems in pure and mixed states. The comparative analysis is probabilistic in nature, it uses a complexity measure that relies on a temporal averaging procedure along with a long-time limit, and is limited to analyzing expected geodesic evolutions on the underlying manifolds. More specifically, we study the complexity of geodesic paths on the manifolds of single-qubit pure and mixed quantum states equipped with the Fubini-Study metric and the Sj"oqvist metric, respectively. We analytically show that the evolution of mixed quantum states in the Bloch ball is more complex than the evolution of pure states on the Bloch sphere. We also verify that the ranking based on our proposed measure of complexity, a quantity that represents the asymptotic temporal behavior of an averaged volume of the region explored on the manifold during the evolution of the systems, agrees with the geodesic length-based ranking. Finally, focusing on geodesic lengths and curvature properties in manifolds of mixed quantum states, we observed a softening of the complexity on the Bures manifold compared to the Sj"oqvist manifold.
When studying the geometry of quantum states, it is acknowledged that mixed states can be distinguished by infinitely many metrics. Unfortunately, this freedom causes metric-dependent interpretations of physically significant geometric quantities such as the complexity and volume of quantum states. In this paper, we present an insightful discussion on the differences between the Bures and the Sjöqvist metrics inside a Bloch sphere. First, we begin with a formal comparative analysis between the two metrics by critically discussing three alternative interpretations for each metric. Second, we explicitly illustrate the distinct behaviors of the geodesic paths on each one of the two metric manifolds. Third, we compare the finite distances between an initial state and the final mixed state when calculated with the two metrics. Interestingly, in analogy with what happens when studying the topological aspects of real Euclidean spaces equipped with distinct metric functions (for instance, the usual Euclidean metric and the taxicab metric), we observe that the relative ranking based on the concept of a finite distance between mixed quantum states is not preserved when comparing distances determined with the Bures and the Sjöqvist metrics. Finally, we conclude with a brief discussion on the consequences of this violation of a metric-based relative ranking on the concept of the complexity and volume of 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 compare Krylov's state complexity with an information-geometric (IG) measure of complexity for the quantum evolution of two-level systems. Focusing on qubit dynamics on the Bloch sphere, we analyze evolutions generated by stationary and nonstationary Hamiltonians, corresponding to geodesic and nongeodesic trajectories. We formulate Krylov complexity in geometric terms, both instantaneously and in a time-averaged sense, and contrast it with an IG complexity of quantum evolutions characterized in terms of efficiency and curvature. We show that the two measures reflect fundamentally different aspects of quantum dynamics: Krylov's state complexity quantifies the directional spread of the evolving state relative to the initial state, whereas the IG complexity captures the effective volume explored along the trajectory on the Bloch sphere. This geometric distinction explains their inequivalent behavior and highlights the complementary nature of state-based and information-geometric notions of complexity in quantum systems.
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.
The quantum speed limit establishes a bound on the minimal time required for a quantum system to evolve from a given initial state to a final state. When the mean energy variance is fixed this limitation is captured by the Mandelstam--Tamm bound. The fastest quantum evolution saturating this bound follows a geodesic arc connecting the two states. Such geodesics in the manifold of quantum states are explicitly known when the states are pure (Fubini-Study geodesics) and when they are mixed and given by faithful density matrices (Bures geodesics). In this article we obtain the explicit form of the Bures geodesic arcs joining two non-faithful density matrices, which may have different ranks. For pure states one recovers the Fubini-Study geodesics. A necessary and sufficient condition for the uniqueness of the shortest geodesic arc is given. When the condition is not fulfilled there are infinitely many such arcs, all having length equal to the arccos Bures distance between the two states, in analogy with the arcs of great circles connecting the two poles of a sphere. We discuss the implications of our results for the quantum speed limit.
In optimal quantum-mechanical evolutions, motion can take place along paths of minimal length within an optimal time frame. Alternatively, optimal evolutions may occur along established paths without any waste of energy resources and achieving 100% speed efficiency. Unfortunately, realistic physical scenarios often lead to less-than-ideal evolutions that demonstrate suboptimal efficiency, nonzero curvature, and a high level of complexity. In this paper, we provide an exact analytical expression for the curvature of a quantum evolution pertaining to a two-level quantum system subjected to various time-dependent magnetic fields. Specifically, we examine the dynamics produced by a two-parameter nonstationary Hermitian Hamiltonian with unit speed efficiency. To enhance our understanding of the physical implications of the curvature coefficient, we analyze the curvature behavior in relation to geodesic efficiency, speed efficiency, and the complexity of the quantum evolution (as described by the ratio of the difference between accessible and accessed Bloch-sphere volumes for the evolution from initial to final state to the accessible volume for the given quantum evolution). Our findings indicate that, generally, efficient quantum evolutions exhibit lower complexity compared to inefficient ones. However, we also note that complexity transcends mere length. In fact, longer paths that are sufficiently curved can demonstrate a complexity that is less than that of shorter paths with a lower curvature coefficient.