Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for complexity inequalities.
Patramanis, Probing the entanglement of operator growth, PTEP 2022, 063A01 (2022) , arXiv:2111.03424 [hep-th]
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
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
-
Complexity Inequalities for Quantum Subsystems
Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for complexity inequalities.
-
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.