Path integral optimization as circuit complexity
Hugo A. Camargo, Michal P. Heller, Ro Jefferson, Johannes Knaute
TL;DR
This work bridges path-integral optimization and circuit complexity in two-dimensional CFTs by showing that Weyl deformations of the Euclidean path integral can be realized within the standard gate-counting framework. The Liouville action $S_L$ emerges as the $ abla$-dependent cost for the Weyl factor $\omega$, obtained from a controlled expansion of a suitably chosen cost functional, thereby linking path-integral optimization to circuit complexity in a concrete way. It provides a precise mapping from curved-background path integrals to circuits generated by the energy-momentum components $h$ and $p$ and discusses the interpretation of a DBI-like action in a special foliation. The results clarify the role of covariance and UV regularization, and point toward future directions for fully covariant cost measures, higher-order corrections, and extensions to holography and mixed states.
Abstract
Early efforts to understand complexity in field theory have primarily employed a geometric approach based on the concept of circuit complexity in quantum information theory. In a parallel vein, it has been proposed that certain deformations of the Euclidean path integral that prepares a given operator or state may provide an alternative definition, whose connection to the standard notion of complexity is less apparent. In this letter, we bridge the gap between these two proposals in two-dimensional conformal field theories, by explicitly showing how the latter approach from path integral optimization may be given a concrete realization within the standard gate counting framework. In particular, we show that when the background geometry is deformed by a Weyl rescaling, a judicious gate counting allows one to recover the Liouville action as a particular choice within a more general class of cost functions.
