REVIEW 2 cited by
Probing the entanglement of operator growth
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
Signed reviews
read the original abstract
In this work we probe the operator growth for systems with Lie symmetry using tools from quantum information. Namely, we investigate the Krylov complexity, entanglement negativity, von Neumann entropy and capacity of entanglement for systems with SU(1,1) and SU(2) symmetry. Our main tools are two-mode coherent states, whose properties allow us to study the operator growth and its entanglement structure for any system in a discrete series representation of the groups under consideration. Our results verify that the quantities of interest exhibit certain universal features in agreement with the universal operator growth hypothesis. Moreover, we illustrate the utility of this approach relying on symmetry as it significantly facilitates the calculation of quantities probing operator growth. In particular, we argue that the use of the Lanczos algorithm, which has been the most important tool in the study of operator growth so far, can be circumvented and all the essential information can be extracted directly from symmetry arguments.
Forward citations
Cited by 2 Pith papers
-
Brickwall One-Loop Determinant: Spectral Statistics & Krylov Complexity
In the brickwall model of a BTZ black hole, hand-tuned Gaussian randomness at a stretched horizon reproduces random-matrix-theory spectral statistics and Krylov complexity peaks for scalar and fermionic probes.
-
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.
Discussion (0). Continue with ORCID to comment.