Papers
Topics
Authors
Recent
Search
2000 character limit reached

Timelike Holographic Complexity

Published 29 Oct 2025 in hep-th | (2510.25700v1)

Abstract: Motivated by the pseudo-entropy program, we investigate timelike subregion complexity within the holographic ``Complexity=Volume'' framework, extending the usual spatial constructions to Lorentzian boundary intervals. For hyperbolic timelike regions in AdS geometries, we compute the corresponding bulk volumes and demonstrate that, despite the Lorentzian embedding, the resulting subregion complexity remains purely real. We further generalize our analysis to AdS black brane geometries, where the extremal surfaces can either be constant-time hypersurfaces or penetrate the horizon. In all cases, the computed complexity exhibits the same universal UV divergences as in the spacelike case but shows no imaginary contribution, underscoring its causal and geometric origin. This stands in sharp contrast with the complex-valued pseudo-entropy and suggests that holographic complexity preserves a genuinely geometric and real character even under Lorentzian continuation.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.