2000 character limit reached
Holographic Complexity in dS$_{d+1}$
Published 22 Feb 2022 in hep-th and gr-qc | (2202.10684v1)
Abstract: We study the CV, CA, and CV2.0 approaches to holographic complexity in $(d+1)$-dimensional de Sitter spacetime. We find that holographic complexity and corresponding growth rate presents universal behaviour for all three approaches. In particular, the holographic complexity exhibits `hyperfast' growth [arXiv:2109.14104] and appears to diverge with a universal power law at a (finite) critical time. We introduce a cutoff surface to regulate this divergence, and the subsequent growth of the holographic complexity is linear in time.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.