A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.
Spacetime as a quantum circuit
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map between boundary states at different times and Wilsonian cutoffs, and that the complexity of those quantum circuits is given by the gravitational action. The optimal circuit minimizes the gravitational action. This is a generalization of both the "complexity equals volume" conjecture to unoptimized circuits, and path integral optimization to finite cutoffs. Using tools from holographic $T\bar T$, we find that surfaces of constant scalar curvature play a special role in optimizing quantum circuits. We also find an interesting connection of our proposal to kinematic space, and discuss possible circuit representations and gate counting interpretations of the gravitational action.
citation-role summary
citation-polarity summary
fields
hep-th 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
CFT Complexity and Penalty Factors
A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.