Towards complexity in de Sitter space from the double-scaled Sachdev-Ye-Kitaev model (2403.13186v3)
Abstract: How can we define complexity in dS space from microscopic principles? Based on recent developments pointing towards a correspondence between a pair of double-scaled Sachdev-Ye-Kitaev (DSSYK) models/ 2D Liouville-de Sitter (LdS$_2$) field theory/ 3D Schwarzschild de Sitter (SdS$_3$) space in arXiv:2310.16994, arXiv:2402.00635, arXiv:2402.02584, we study concrete complexity proposals in the microscopic models and their dual descriptions. First, we examine the spread complexity of the maximal entropy state of the doubled DSSYK model. We show that it counts the number of entangled chord states in its doubled Hilbert space. We interpret spread complexity in terms of a time difference between antipodal observers in SdS$_3$ space, and a boundary time difference of the dual LdS$_2$ CFTs. This provides a new connection between entanglement and geometry in dS space. Second, Krylov complexity, which describes operator growth, is computed for physical operators on all sides of the correspondence. Their late time evolution behaves as expected for chaotic systems. Later, we define the query complexity in the LdS$_2$ model as the number of steps in an algorithm computing n-point correlation functions of boundary operators of the corresponding antipodal points in SdS$_3$ space. We interpret query complexity as the number of matter operator chord insertions in a cylinder amplitude in the DSSYK, and the number of junctions of Wilson lines between antipodal static patch observers in SdS$_3$ space. Finally, we evaluate a specific proposal of Nielsen complexity for the DSSYK model and comment on its possible dual manifestations.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper 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.