Recognition: unknown
Complexity Equals Action
read the original abstract
We conjecture that the quantum complexity of a holographic state is dual to the action of a certain spacetime region that we call a Wheeler-DeWitt patch. We illustrate and test the conjecture in the context of neutral, charged, and rotating black holes in AdS, as well as black holes perturbed with static shells and with shock waves. This conjecture evolved from a previous conjecture that complexity is dual to spatial volume, but appears to be a major improvement over the original. In light of our results, we discuss the hypothesis that black holes are the fastest computers in nature.
This paper has not been read by Pith yet.
Forward citations
Cited by 9 Pith papers
-
Quantum speed limit for measurement probabilities
The evolution speed of quantum measurement probabilities is bounded by their inherent quantum fluctuations, providing a correlation witness and a bound on transformation times to non-equilibrium states.
-
Holography and Optimal Transport: Emergent Wasserstein Spacetime in Harmonic Oscillator, SYK and Krylov Complexity
Holographic spacetime emerges as the 1-Wasserstein space of quantum state distributions under optimal transport, matching AdS2 black hole geometry in the SYK model and identified with generalized Krylov complexity.
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Holographic Krylov Complexity for Charged, Composite and Extended Probes
Holographic Krylov complexity for charged composite and extended probes retains universal leading large-time growth but acquires structure-dependent subleading corrections.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Computational Cosmic Censorship
Naked singularities produce divergent holographic complexity via the singularity boundary term when the near-origin metric scales as r^{-p} with p > D-3, implying an operational computational form of cosmic censorship.
-
A Timelike Quantum Focusing Conjecture
A timelike quantum focusing conjecture implies a complexity-based quantum strong energy condition and a complexity bound analogous to the covariant entropy bound for suitable codimension-0 field theory complexity measures.
-
Holographic complexity of conformal fields in global de Sitter spacetime
Holographic complexity of CFTs in global dS_d is computed via volume and action prescriptions in AdS foliation and brane setups, then compared to results from static and Poincare patches.
-
Stringy Effects on Holographic Complexity: The Complete Volume in Dynamical Spacetimes
Gauss-Bonnet corrections to the complete volume introduce a competition effect in static cases and prolong the critical time in two-sided shocks while the complexity growth rate stays governed by conserved momentum.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.