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.
Quantum Complexity of Time Evolution with Chaotic Hamiltonians
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 2polarities
background 2representative citing papers
In a JT gravity model with an EoW brane, black hole interior complexity grows linearly until the Page time then decays exponentially, with fluctuations growing large afterward and signaling loss of self-averaging.
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.
citing papers explorer
-
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.
-
Evaporating Black Hole Interior and Complexity Evolution
In a JT gravity model with an EoW brane, black hole interior complexity grows linearly until the Page time then decays exponentially, with fluctuations growing large afterward and signaling loss of self-averaging.
-
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.