Pith. sign in

CFT Complexity and Penalty Factors

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

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.

fields

quant-ph 2

years

2026 2

representative citing papers

The Geometry of Quantum Complexity in Open Systems

quant-ph · 2026-07-09 · conditional · novelty 6.0

Open-system quantum complexity is governed by a sub-Finslerian geometry whose curvature depends on the cost penalties for unitary and dissipative controls.

Nielsen complexity with multiple cost factors

quant-ph · 2026-06-01 · unverdicted · novelty 4.0

Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.

citing papers explorer

Showing 2 of 2 citing papers.

  • The Geometry of Quantum Complexity in Open Systems quant-ph · 2026-07-09 · conditional · none · ref 56 · internal anchor

    Open-system quantum complexity is governed by a sub-Finslerian geometry whose curvature depends on the cost penalties for unitary and dissipative controls.

  • Nielsen complexity with multiple cost factors quant-ph · 2026-06-01 · unverdicted · none · ref 27

    Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.