In JT gravity with an end-of-the-world brane, the renormalized interior length — read as subsystem complexity — grows linearly, peaks around the Page time, and then decays exponentially, with growing relative fluctuations afterward.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
Wigner negativity in Krylov space stays O(1) or grows as t^{1/2} (without Hilbert-space scaling) in 2d CFTs, one-cut matrix models, and double-scaled SYK, indicating emergent semiclassicality.
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Quotienting the Cayley graph of the Clifford group by a quantum state's stabilizer subgroup produces a graph of the state's Clifford orbit.
Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.
citing papers explorer
-
Evaporating Black Hole Interior and Complexity Evolution
In JT gravity with an end-of-the-world brane, the renormalized interior length — read as subsystem complexity — grows linearly, peaks around the Page time, and then decays exponentially, with growing relative fluctuations afterward.
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Wigner negativity in Krylov space and emergent semiclassicality
Wigner negativity in Krylov space stays O(1) or grows as t^{1/2} (without Hilbert-space scaling) in 2d CFTs, one-cut matrix models, and double-scaled SYK, indicating emergent semiclassicality.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Clifford Orbits from Cayley Graph Quotients
Quotienting the Cayley graph of the Clifford group by a quantum state's stabilizer subgroup produces a graph of the state's Clifford orbit.
-
Nielsen complexity with multiple cost factors
Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.