REVIEW 2 cited by
CFT Complexity and Penalty Factors
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
CFT Complexity and Penalty Factors
read the original 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.
Forward citations
Cited by 2 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Nielsen complexity for Lindbladian open systems induces a sub-Finslerian geometry on mixed states whose flag curvature depends on control penalty factors.
-
Nielsen complexity with multiple cost factors
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.