Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Patramanis, Probing the entanglement of operator growth, PTEP2022, 063A01 (2022), arXiv:2111.03424 [hep-th]
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Krylov complexity equals Fubini-Study volume for closed and open two-mode squeezed states, providing analytic support for the generalized CV conjecture via information geometry.
citing papers explorer
-
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.
-
Generalized CV Conjecture and Krylov Complexity in Two-Mode Hermitian Systems via Information Geometry
Krylov complexity equals Fubini-Study volume for closed and open two-mode squeezed states, providing analytic support for the generalized CV conjecture via information geometry.