REVIEW 5 cited by
Spread complexity for the planar limit of holography
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
abstract
Complexity is a fundamental characteristic of states within a quantum system. Its use is however mostly limited to bosonic systems, inhibiting its present applicability to supersymmetric theories. This is also relevant to its application to the AdS/CFT correspondence. To address this limitation, we extend the framework of spread complexity beyond bosonic systems to include fermionic and supercoherent states. This offers a gateway to compute spread complexity analytically for any semiclassical system governed by a Hamiltonian associated with a Lie (super)algebra. This requires extending the Krylov chain to a Krylov path in a higher-dimensional lattice. A detailed analysis of supercoherent states within the super Heisenberg-Weyl and OSp$(2|1)$ algebras elucidates distinct contributions from bosonic and fermionic degrees of freedom to the complexity. This generalisation allows us to access the semiclassical regime of the planar limit of the holographic correspondence. We then compute the spread complexity of large charge superstring states on the gravity side, which are equivalent to the dual gauge states. The resulting complexity leads to Krylov paths capturing the geometry in which the string propagates.
Forward citations
Cited by 5 Pith papers
-
Comments on holographic spread complexity
The momentum–spread-complexity relation requires generalized coherent states adapted to the spacetime symmetry algebra; semiclassical spreading alone cannot produce a momentum–complexity correspondence.
-
Black Hole States in Quantum Spin Chains
An equal-weight superposition of all non-crossing singlet pairings in a Heisenberg chain shows logarithmic entanglement growth (c≈5.2) and near-infinite-temperature thermalization.
-
Krylov Complexity of Supersymmetric SYK Models
In finite-size N=2 SYK, breaking supersymmetry with an irrelevant deformation pushes late-time Krylov complexity to roughly half the maximal Krylov-space bound, while a mass deformation leaves saturation complexity a ...
-
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.
-
Quasinormal modes and complexity in saddle-dominated SU(N) spin systems
A family of SU(2) and SU(3) Lipkin-Meshkov-Glick-type Hamiltonians reproduces de Sitter quasinormal-mode densities of states, and late-time probes reveal integrability beneath saddle-dominated scrambling.
Discussion (0). Sign in to comment.