Krylov complexity is not a measure of distance between states or operators

2023/11/07 by Aguilar-Gutierrez, Sergio E., Rolph, Andrew · 4 citations
#FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2311.04093

Abstract

We ask whether Krylov complexity is mutually compatible with the circuit and Nielsen definitions of complexity. We show that the Krylov complexities between three states fail to satisfy the triangle inequality and so cannot be a measure of distance: there is no possible metric for which Krylov complexity is the length of the shortest path to the target state or operator. We show this explicitly in the simplest example, a single qubit, and in general.

Cited by

• The Exact Uncertainty Relation and Geometric Speed Limits in Krylov Space
• Krylov complexity in ergodically constrained nonintegrable transverse-field Ising model
• Explicit Connections Between Krylov and Nielsen Complexity
• (A)Symmetric Complexity and the Quantum Mpemba Effect

Related

• Building Krylov complexity from circuit complexity
• Explicit Connections Between Krylov and Nielsen Complexity
• Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State
• Krylov complexity has it all
• On Krylov Complexity as a Probe of the Quantum Mpemba Effect