REVIEW 7 cited by
Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem - that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole interiors keep growing for a very long time. In this pedagogical review, we present the geometric approach to complexity advocated by Nielsen and show how it can be used to define complexity for generic quantum systems; in particular, we focus on Gaussian states in QFT, both pure and mixed, and on certain classes of CFT states. We then present the conjectured relation to gravitational quantities within the holographic correspondence and discuss several examples in which different versions of the conjectures have been tested. We highlight the relation between complexity, chaos and scrambling in chaotic systems. We conclude with a discussion of open problems and future directions. This article was written for the special issue of EPJ-C Frontiers in Holographic Duality.
Forward citations
Cited by 7 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Open-system quantum complexity is governed by a sub-Finslerian geometry whose curvature depends on the cost penalties for unitary and dissipative controls.
-
Holographic Timelike Entanglement and Subregion Complexity in Localized AdS3*S3*T4 Black Holes
Timelike entanglement and subregion complexity detect the cap–horizon transition of localized AdS3×S3×T4 black poles via fixed-boundary-interval Lorentzian branch selection, effects absent in BTZ and large-r limits.
-
CFT Complexity and Penalty Factors
A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.
-
Quasinormal Modes and the Switchback Effect in Schwarzschild-de Sitter
The paper derives eikonal quasinormal mode frequencies and shock-wave switchback delays in Schwarzschild-de Sitter for arbitrary mass, using static-sphere observers and reflecting boundary conditions.
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
-
Probing the self-coherence of primordial quantum fluctuations with complexity
Complexity of formation, unlike complexity of purification, shows distinct and timescale-matching signatures of both decoherence and recoherence in a Gaussian two-field de Sitter model.
-
Dynamics of monitored SSH Model in Krylov Space: From Complexity to Quantum Fisher Information
Time-averaged quantum Fisher information in Krylov space changes slope at the PT transition (gamma=1) and saturates near the entanglement transition (gamma=2) in the monitored SSH model, suggesting it as a probe of both.
Discussion (0). Continue with ORCID to comment.