Non-analyticity in Holographic Complexity near Critical points
Uday Sood, Martin Kruczenski

TL;DR
This paper demonstrates that holographic complexity exhibits a universal non-analytic behavior near critical points, supporting the idea that holographic complexity calculations are reliable and broadly applicable.
Contribution
It extends previous results by showing the same non-analytic behavior of complexity near critical points in holographic models, indicating universality and validating holographic complexity computations.
Findings
Holographic complexity has a non-analytic dependence near critical points.
The non-analytic behavior matches that observed in other models like Bose-Hubbard.
Results support the universality of complexity behavior in critical phenomena.
Abstract
The region near a critical point is studied using holographic models of second-order phase transitions. In a previous paper, we argued that the quantum circuit complexity of the vacuum () is the largest at the critical point. When deforming away from the critical point by a term the complexity has a piece non-analytic in , namely . Here, as usual, and is the correlation length and there are possible logarithmic corrections to this expression. That was derived using numerical results for the Bose-Hubbard model and general scaling considerations. In this paper, we show that the same is valid in the case of holographic complexity providing evidence that the results are universal, and at the same time providing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Graph theory and applications
