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

Toward a physically motivated notion of Gaussian complexity geometry

Bruno de S. L. Torres, Eduardo Martín-Martínez

Published Jul 9, 2024• 2 citations
arXivHTMLPDF

Abstract

We present a general construction of a geometric notion of circuit complexity for Gaussian states (both bosonic and fermionic) in terms of Riemannian geometry. We lay out general conditions that a Riemannian metric function on the space of Gaussian states should satisfy in order for it to yield a physically reasonable measure of complexity. This general formalism can naturally accommodate modifications to complexity geometries that arise from cost functions that depend nontrivially on the instantaneous state and on the direction on circuit space at each point. We explore these modifications and, as a particular case, we show how to account for time-reversal symmetry breaking in measures of complexity, which is often natural from an experimental (and thermodynamical) perspective, but is absent in commonly studied complexity measures. This establishes a first step towards building a quantitative, geometric notion of complexity that faithfully mimics what is experienced as ``easy'' or ``hard'' to implement in a lab from a physically motivated point of view.

DOI
10.1103/physrevd.110.025006

Related papers

The Geometry of Quantum Complexity in Open Systems

Ezra Acalapati, Kausik Ghosh, Giuseppe Policastro

We extend Nielsen's geometric approach for quantum complexity from closed to open quantum systems, whose dynamics is governed by Lindbladian evolution. In this framework, complexity is defined through an optimal-control problem on the space of mixed states, with a cost assigned to both unitary and non-unitary generators. We show that the resulting geometric structure differs fundamentally from the Riemannian geometry that emerges in the case of unitary evolution. In the open-system setting, the natural geometry is typically sub-Finslerian. Dissipation makes the geodesics non-reversible, while the admissible tangent directions are restricted by the physically allowed controls. We analyze several physically motivated examples, including a single qubit subject to depolarizing and amplitude-damping channels, as well as the damped harmonic oscillator. We show that, similarly to the unitary case, varying the penalty factors in the cost functional modifies the geometric properties through changes in the flag curvature, the Finslerian analog of sectional curvature. Our results provide a geometric framework for quantifying the abstract notion of complexity in dissipative quantum systems, with potential connections to experimentally realizable setups.

quant-pharXiv:2607.08411•Jul 10, 2026•0 citations

How smooth is quantum complexity?

Vir B. Bulchandani, S. L. Sondhi

Abstract The “quantum complexity” of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical computational complexity, it has since been argued to hold a fundamental significance in its own right, as a physical quantity analogous to the thermodynamic entropy. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators. One striking feature of these functions is that they can exhibit non-smooth and even fractal behaviour. We use ideas from Diophantine approximation theory and sub-Riemannian geometry to rigorously quantify this lack of smoothness. Implications for the physical meaning of quantum complexity are discussed.

arXiv:2106.08324•Journal of High Energy Physics•Oct 1, 2021•19 citations

CFT complexity and penalty factors

Stefano Baiguera, Nicolas Chagnet, Shira Chapman +1 more

A bstract Quantum complexity of conformal field theory (CFT) states has recently gained significant attention, both as a diagnostic tool in condensed matter systems and in connection with holographic observables probing black hole interiors. Previous studies have primarily focused on cases where all generators of the conformal group contribute equally to the cost of building a circuit. In this work, we present a general framework for studying the complexity of circuits in generic Lie groups, where penalty factors assign relative weights to different generators. Our approach constructs a metric on the coset space of quantum states, induced from a (pseudo-)Riemannian norm on the space of unitary circuits. The geodesics of this metric are interpreted as optimal circuits. The method builds on the formalism of (pseudo-)Riemannian submersions and connects naturally to other prescriptions in the literature, including cost function minimization along stabilizer directions and constructions based on coadjoint orbits. As a concrete application, we compute state complexity for states in one- and two-dimensional CFTs. For specific choices of penalty factors, our prescription yields a positive-definite metric with a viable interpretation as complexity; in other cases, the resulting metric is indefinite. In the viable regime, we derive analytic results when a specific penalty factor is turned off, develop perturbative expansions for small values of the penalty factors, and provide numerical results in the general case. We comment on the relation of our measure of complexity to holography.

arXiv:2507.22118•Journal of High Energy Physics•Feb 25, 2026•3 citations

Geometric Complexity of Quantum Channels via Unitary Dilations

Alberto Acevedo, Antonio Falcó

Nielsen's geometric approach to quantum circuit complexity provides a Riemannian framework for quantifying the cost of implementing unitary closed-system dynamics. For open evolutions, the reduced dynamics is described by time-dependent families of quantum channels $\{Λ_t\}_{t\ge 0}$ admitting many inequivalent Stinespring realizations, so any meaningful complexity notion must specify which microscopic resources are counted and which transformations are treated as gauge. We develop a dilation-based geometric complexity framework that distinguishes implementation-dependent complexity, attached to a specific realization, from intrinsic channel complexity obtained by minimizing over a physically admissible class of dilations. The proposed functional is subtractive: it removes purely environmental contributions from the geometric cost of the joint unitary realization. The subtraction is derived from concise structural postulates --- closed-system consistency, environment-only neutrality, and invariance under dilation gauge transformations --- and admits a natural variational and geometric interpretation. We also define noise complexity as a companion quantity measuring the geometric deviation of a noisy implementation from a prescribed ideal closed-system evolution. In the Hilbert-Schmidt setting, we establish coherence-based lower bounds for unitary and noise complexity, prove linear time scaling under time-homogeneous dilation models, and obtain dissipator-controlled bounds in the Markovian GKSL regime. We illustrate the framework on canonical single-qubit benchmark channels: dephasing, amplitude damping, and Pauli/depolarizing noise.

quant-pharXiv:2601.00735•Journal of Physics A Mathematical and Theoretical•Jan 5, 2026•0 citations

Complexity measures in QFT and constrained geometric actions

Pablo Bueno, Javier M. Magán, C. S. Shahbazi

Abstract We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions — many examples of which have been recently proposed in the literature — are ruled out by our analysis. Such measures are shown to be unrelated to circuit complexity in general and to produce severe violations of Lloyd’s bound in simple situations. Among the metrics which do provide lower bounds, the idea is to select those which produce the tightest possible ones. This establishes a hierarchy of cost functions and considerably reduces the list of candidate complexity measures. In particular, the criterion suggests a canonical way of dealing with penalties, consisting in assigning infinite costs to directions not belonging to the gate set. We discuss how this can be implemented through the use of Lagrange multipliers. We argue that one of the surviving cost functions defines a particularly canonical notion in the sense that: i) it straightforwardly follows from the standard Hermitian metric in Hilbert space; ii) its associated complexity functional is closely related to Kirillov’s coadjoint orbit action, providing an explicit realization of the “complexity equals action” idea; iii) it arises from a Hamilton-Jacobi analysis of the “quantum action” describing quantum dynamics in the phase space canonically associated to every Hilbert space. Finally, we explain how these structures provide a natural framework for characterizing chaos in classical and quantum systems on an equal footing, find the minimal geodesic connecting two nearby trajectories, and describe how complexity measures are sensitive to Lyapunov exponents.

arXiv:1908.03577•Journal of High Energy Physics•Sep 29, 2021•48 citations

Geometric Measures of Complexity for Open and Closed Quantum Systems

Alberto Acevedo, Antonio Falcó

The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion originally developed by Michael Nielsen (Circa, 2007). However, for nonunitary dynamics, it is unclear how one can recover a completely geometric characterization of Nielsen-like geometric complexity. The main obstacle to overcome is that nonunitary dynamics cannot be characterized by Lie groups (which are Riemannian manifolds), as is the case for unitary dynamics. Building on Nielsen's work, we present a definition of geometric complexity for a fairly generic family of quantum channels. These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.

arXiv:2507.18440•Jul 24, 2025•3 citations
We present a general construction of a geometric notion of circuit complexity for Gaussian states (both bosonic and fermionic) in terms of Riemannian geometry. We lay out general conditions that a Riemannian metric function on the space of Gaussian states should satisfy in order for it to yield a physically reasonable measure of complexity. This general formalism can naturally accommodate modifications to complexity geometries that arise from cost functions that depend nontrivially on the instantaneous state and on the direction on circuit space at each point. We explore these modifications and, as a particular case, we show how to account for time-reversal symmetry breaking in measures of complexity, which is often natural from an experimental (and thermodynamical) perspective, but is absent in commonly studied complexity measures. This establishes a first step towards building a quantitative, geometric notion of complexity that faithfully mimics what is experienced as easy'' or hard'' to implement in a lab from a physically motivated point of view.
We extend Nielsen's geometric approach for quantum complexity from closed to open quantum systems, whose dynamics is governed by Lindbladian evolution. In this framework, complexity is defined through an optimal-control problem on the space of mixed states, with a cost assigned to both unitary and non-unitary generators. We show that the resulting geometric structure differs fundamentally from the Riemannian geometry that emerges in the case of unitary evolution. In the open-system setting, the natural geometry is typically sub-Finslerian. Dissipation makes the geodesics non-reversible, while the admissible tangent directions are restricted by the physically allowed controls. We analyze several physically motivated examples, including a single qubit subject to depolarizing and amplitude-damping channels, as well as the damped harmonic oscillator. We show that, similarly to the unitary case, varying the penalty factors in the cost functional modifies the geometric properties through changes in the flag curvature, the Finslerian analog of sectional curvature. Our results provide a geometric framework for quantifying the abstract notion of complexity in dissipative quantum systems, with potential connections to experimentally realizable setups.
Abstract The “quantum complexity” of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical computational complexity, it has since been argued to hold a fundamental significance in its own right, as a physical quantity analogous to the thermodynamic entropy. In this paper, we present a unified perspective on various notions of quantum complexity, viewed as functions on the space of unitary operators. One striking feature of these functions is that they can exhibit non-smooth and even fractal behaviour. We use ideas from Diophantine approximation theory and sub-Riemannian geometry to rigorously quantify this lack of smoothness. Implications for the physical meaning of quantum complexity are discussed.
A bstract Quantum complexity of conformal field theory (CFT) states has recently gained significant attention, both as a diagnostic tool in condensed matter systems and in connection with holographic observables probing black hole interiors. Previous studies have primarily focused on cases where all generators of the conformal group contribute equally to the cost of building a circuit. In this work, we present a general framework for studying the complexity of circuits in generic Lie groups, where penalty factors assign relative weights to different generators. Our approach constructs a metric on the coset space of quantum states, induced from a (pseudo-)Riemannian norm on the space of unitary circuits. The geodesics of this metric are interpreted as optimal circuits. The method builds on the formalism of (pseudo-)Riemannian submersions and connects naturally to other prescriptions in the literature, including cost function minimization along stabilizer directions and constructions based on coadjoint orbits. As a concrete application, we compute state complexity for states in one- and two-dimensional CFTs. For specific choices of penalty factors, our prescription yields a positive-definite metric with a viable interpretation as complexity; in other cases, the resulting metric is indefinite. In the viable regime, we derive analytic results when a specific penalty factor is turned off, develop perturbative expansions for small values of the penalty factors, and provide numerical results in the general case. We comment on the relation of our measure of complexity to holography.
Nielsen's geometric approach to quantum circuit complexity provides a Riemannian framework for quantifying the cost of implementing unitary closed-system dynamics. For open evolutions, the reduced dynamics is described by time-dependent families of quantum channels {Λt}t≥0\{Λ_t\}_{t\ge 0}{Λt​}t≥0​ admitting many inequivalent Stinespring realizations, so any meaningful complexity notion must specify which microscopic resources are counted and which transformations are treated as gauge. We develop a dilation-based geometric complexity framework that distinguishes implementation-dependent complexity, attached to a specific realization, from intrinsic channel complexity obtained by minimizing over a physically admissible class of dilations. The proposed functional is subtractive: it removes purely environmental contributions from the geometric cost of the joint unitary realization. The subtraction is derived from concise structural postulates --- closed-system consistency, environment-only neutrality, and invariance under dilation gauge transformations --- and admits a natural variational and geometric interpretation. We also define noise complexity as a companion quantity measuring the geometric deviation of a noisy implementation from a prescribed ideal closed-system evolution. In the Hilbert-Schmidt setting, we establish coherence-based lower bounds for unitary and noise complexity, prove linear time scaling under time-homogeneous dilation models, and obtain dissipator-controlled bounds in the Markovian GKSL regime. We illustrate the framework on canonical single-qubit benchmark channels: dephasing, amplitude damping, and Pauli/depolarizing noise.
Abstract We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions — many examples of which have been recently proposed in the literature — are ruled out by our analysis. Such measures are shown to be unrelated to circuit complexity in general and to produce severe violations of Lloyd’s bound in simple situations. Among the metrics which do provide lower bounds, the idea is to select those which produce the tightest possible ones. This establishes a hierarchy of cost functions and considerably reduces the list of candidate complexity measures. In particular, the criterion suggests a canonical way of dealing with penalties, consisting in assigning infinite costs to directions not belonging to the gate set. We discuss how this can be implemented through the use of Lagrange multipliers. We argue that one of the surviving cost functions defines a particularly canonical notion in the sense that: i) it straightforwardly follows from the standard Hermitian metric in Hilbert space; ii) its associated complexity functional is closely related to Kirillov’s coadjoint orbit action, providing an explicit realization of the “complexity equals action” idea; iii) it arises from a Hamilton-Jacobi analysis of the “quantum action” describing quantum dynamics in the phase space canonically associated to every Hilbert space. Finally, we explain how these structures provide a natural framework for characterizing chaos in classical and quantum systems on an equal footing, find the minimal geodesic connecting two nearby trajectories, and describe how complexity measures are sensitive to Lyapunov exponents.
The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion originally developed by Michael Nielsen (Circa, 2007). However, for nonunitary dynamics, it is unclear how one can recover a completely geometric characterization of Nielsen-like geometric complexity. The main obstacle to overcome is that nonunitary dynamics cannot be characterized by Lie groups (which are Riemannian manifolds), as is the case for unitary dynamics. Building on Nielsen's work, we present a definition of geometric complexity for a fairly generic family of quantum channels. These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.