Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

K-complexity and the Jordan-Wigner transformation

Zayd Pandit

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

Krylov complexity is a measure of operator growth that demonstrates universal properties and bounds a large class of complexities. One such measure from this bounded class is operator size. The relationship between operator size and operator growth has been conjectured to be non-trivial due to the existence of duality transformations such as the Jordan-Wigner (JW) transformation which map small operators to large, non-local operators. We investigate this claim directly in the case of the JW transformation which maps the XY Heisenberg chain to the Kitaev chain. We numerically calculate the complexity of dual operators, and analyse the early and late time behaviour and symmetries. We find that for Open Boundary Conditions (OBC) the early time behaviour of the K-Complexity correlates with operator size, but that large operators can have very low K-Complexity if dual to a small operator. We find that for Periodic Boundary Conditions (PBC) larger operators produce larger early time growth, but do not correlate to larger late-time complexity regardless of the size of the dual operator. The difference between the OBC and PBC results arise from an often overlooked break in translational symmetry across the PBC Jordan-Wigner transformation. We also find that state complexity is not sensitive to the break in translational symmetry.

Related papers

On complexity and duality

Jeff Murugan, Zayd Pandit, Hendrik J. R. Van Zyl

A bstract We explore the relationship between complexity and duality in quantum systems, focusing on how local and non-local operators evolve under time evolution. We find that non-local operators, which are dual to local operators under specific mappings, exhibit behaviour that mimics the growth of their local counterparts, particularly when considering state complexity. For the open transverse Ising model this leads to a neat organisation of the operator dynamics on either side of the duality, both consistent with growth expected in a quadratic fermion model like the Kitaev chain. When examining periodic chains, however, the mapping of boundary terms provides access to multiple branches of highly complex operators. These give rise to much larger saturation values of complexity for parity-mixing operators and are in contrast to what one would expect for a quadratic Hamiltonian. Our results shed light on the intricate relationship between non-locality, complexity growth, and duality in quantum systems.

arXiv:2411.02546•Journal of High Energy Physics•Mar 11, 2025•0 citations

Operator Krylov complexity in random matrix theory

Tang Haifeng

Krylov complexity, as a novel measure of operator complexity under Heisenberg evolution, exhibits many interesting universal behaviors and also bounds many other complexity measures. In this work, we study Krylov complexity $\mathcal{K}(t)$ in Random Matrix Theory (RMT). In large $N$ limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient $\{b_n\}$ saturate to constant plateau $\lim\limits_{n\rightarrow\infty}b_n=b$, rendering a linear growing complexity $\mathcal{K}(t)\sim t$, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value $b$ to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the $\{b_n\}$ in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that $b_n$ will first exhibit linear growth with $n$, whose slope saturates the famous chaos bound. After hitting the same plateau $b$, $b_n$ will then remain constant. This indicates $\mathcal{K}(t)\sim e^{2πt/β}$ before scrambling time $t_*\sim O(β\logβ)$, and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite $N$ corrections.

arXiv:2312.17416•Dec 29, 2023•1 citation

Complexity growth of operators in the SYK model and in JT gravity

Shao-Kai Jian, Brian G. Swingle, Zhuo-Yu Xian

Abstract The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving Heisenberg operators. It is particularly important to understand how these microscopically defined measures of complexity are related to notions of complexity defined in terms of a dual holographic geometry, such as complexity-volume (CV) duality. Here we study partially entangled thermal states in the Sachdev-Ye-Kitaev (SYK) model and their dual description in terms of operators inserted in the interior of a black hole in Jackiw-Teitelboim (JT) gravity. We compare a microscopic definition of complexity in the SYK model known as K-complexity to calculations using CV duality in JT gravity and find that both quantities show an exponential-to-linear growth behavior. We also calculate the growth of operator size under time evolution and find connections between size and complexity. While the notion of operator size saturates at the scrambling time, our study suggests that complexity, which is well defined in both quantum systems and gravity theories, can serve as a useful measure of operator evolution at both early and late times.

arXiv:2008.12274•Journal of High Energy Physics•Mar 1, 2021•116 citations

Krylov complexity in open quantum systems

Chang Liu, Tang Haifeng, Hui Zhai

Krylov complexity is a measure of operator complexity that exhibits universal behavior and bounds a large class of other measures. In this paper, we generalize Krylov complexity from a closed system to an open system coupled to a Markovian bath, where Lindbladian evolution replaces Hamiltonian evolution. We show that Krylov complexity in open systems can be mapped to a non-Hermitian tight-binding model in a half-infinite chain. We discuss the properties of the non-Hermitian terms and show that the strengths of the non-Hermitian terms increase linearly with the increase of the Krylov basis index $n$. Such a non-Hermitian tight-binding model can exhibit localized edge modes that determine the long-time behavior of Krylov complexity. Hence, the growth of Krylov complexity is suppressed by dissipation, and at long times, Krylov complexity saturates at a finite value much smaller than that of a closed system with the same Hamiltonian. Our conclusions are supported by numerical results on several models, such as the Sachdev-Ye-Kitaev model and the interacting fermion model. Our work provides insights for discussing complexity, chaos, and holography for open quantum systems.

arXiv:2207.13603•Physical Review Research•Aug 7, 2023•84 citations

Operator growth in open quantum systems: lessons from the dissipative SYK

Budhaditya Bhattacharjee, Xiangyu Cao, Pratik Nandy +1 more

A bstract We study the operator growth in open quantum systems with dephasing dissipation terms, extending the Krylov complexity formalism of [1]. Our results are based on the study of the dissipative q -body Sachdev-Ye-Kitaev (SYK q ) model, governed by the Markovian dynamics. We introduce a notion of “operator size concentration” which allows a diagrammatic and combinatorial proof of the asymptotic linear behavior of the two sets of Lanczos coefficients ( a n and b n ) in the large q limit. Our results corroborate with the semi-analytics in finite q in the large N limit, and the numerical Arnoldi iteration in finite q and finite N limit. As a result, Krylov complexity exhibits exponential growth following a saturation at a time that grows logarithmically with the inverse dissipation strength. The growth of complexity is suppressed compared to the closed system results, yet it upper bounds the growth of the normalized out-of-time-ordered correlator (OTOC). We provide a plausible explanation of the results from the dual gravitational side.

arXiv:2212.06180•Journal of High Energy Physics•Mar 8, 2023•107 citations

Quantum chaos and late-time equipartition of symmetry-resolved Krylov complexity

Jayashish Das, Suman Das, Juan F. Pedraza +1 more

We study symmetry-resolved Krylov complexity in finite-dimensional chaotic quantum many-body systems. When both the Hamiltonian and the initial operator commute with a conserved charge, the operator dynamics decomposes into independent symmetry sectors, each with its own Krylov chain. We show that, after saturation, the unresolved Krylov complexity is additive over symmetry sectors. In the absence of additional Liouvillian degeneracies, the late-time contribution of a sector with Hilbert-space dimension $d_q$ is controlled by $d_q(d_q-1)$, leading to a dimension-weighted equipartition that approaches the simple large-sector scaling $d_q^2/\sum_{q'}d_{q'}^2$. This late-time rule differs from the early-time weighted-average discussed in the literature and is governed instead by the dimensions of the accessible operator spaces. We support the analytic prediction with numerical studies of the real and complex SYK models, a chaotic bosonic spin model, and the mixed-field Ising chain. Our results show that resolving exact symmetries is essential for interpreting the saturation value of Krylov complexity as a diagnostic of chaotic operator growth.

hep-thCross-listedarXiv:2608.19346•Aug 21, 2026•0 citations
Krylov complexity is a measure of operator growth that demonstrates universal properties and bounds a large class of complexities. One such measure from this bounded class is operator size. The relationship between operator size and operator growth has been conjectured to be non-trivial due to the existence of duality transformations such as the Jordan-Wigner (JW) transformation which map small operators to large, non-local operators. We investigate this claim directly in the case of the JW transformation which maps the XY Heisenberg chain to the Kitaev chain. We numerically calculate the complexity of dual operators, and analyse the early and late time behaviour and symmetries. We find that for Open Boundary Conditions (OBC) the early time behaviour of the K-Complexity correlates with operator size, but that large operators can have very low K-Complexity if dual to a small operator. We find that for Periodic Boundary Conditions (PBC) larger operators produce larger early time growth, but do not correlate to larger late-time complexity regardless of the size of the dual operator. The difference between the OBC and PBC results arise from an often overlooked break in translational symmetry across the PBC Jordan-Wigner transformation. We also find that state complexity is not sensitive to the break in translational symmetry.
A bstract We explore the relationship between complexity and duality in quantum systems, focusing on how local and non-local operators evolve under time evolution. We find that non-local operators, which are dual to local operators under specific mappings, exhibit behaviour that mimics the growth of their local counterparts, particularly when considering state complexity. For the open transverse Ising model this leads to a neat organisation of the operator dynamics on either side of the duality, both consistent with growth expected in a quadratic fermion model like the Kitaev chain. When examining periodic chains, however, the mapping of boundary terms provides access to multiple branches of highly complex operators. These give rise to much larger saturation values of complexity for parity-mixing operators and are in contrast to what one would expect for a quadratic Hamiltonian. Our results shed light on the intricate relationship between non-locality, complexity growth, and duality in quantum systems.
Krylov complexity, as a novel measure of operator complexity under Heisenberg evolution, exhibits many interesting universal behaviors and also bounds many other complexity measures. In this work, we study Krylov complexity K(t)\mathcal{K}(t)K(t) in Random Matrix Theory (RMT). In large NNN limit: (1) For infinite temperature, we analytically show that the Lanczos coefficient {bn}\{b_n\}{bn​} saturate to constant plateau lim⁡n→∞bn=b\lim\limits_{n\rightarrow\infty}b_n=bn→∞lim​bn​=b, rendering a linear growing complexity K(t)∼t\mathcal{K}(t)\sim tK(t)∼t, in contrast to the exponential-in-time growth in chaotic local systems in thermodynamic limit. After numerically comparing this plateau value bbb to a large class of chaotic local quantum systems, we find that up to small fluctuations, it actually bounds the {bn}\{b_n\}{bn​} in chaotic local quantum systems. Therefore we conjecture that in chaotic local quantum systems after scrambling time, the speed of linear growth of Krylov complexity cannot be larger than that in RMT. (2) For low temperature, we analytically show that bnb_nbn​ will first exhibit linear growth with nnn, whose slope saturates the famous chaos bound. After hitting the same plateau bbb, bnb_nbn​ will then remain constant. This indicates K(t)∼e2πt/β\mathcal{K}(t)\sim e^{2πt/β}K(t)∼e2πt/β before scrambling time t∗∼O(βlog⁡β)t_*\sim O(β\logβ)t∗​∼O(βlogβ), and after that it will grow linearly in time, with the same speed as in infinite temperature. We finally remark on the effect of finite NNN corrections.
Abstract The concepts of operator size and computational complexity play important roles in the study of quantum chaos and holographic duality because they help characterize the structure of time-evolving Heisenberg operators. It is particularly important to understand how these microscopically defined measures of complexity are related to notions of complexity defined in terms of a dual holographic geometry, such as complexity-volume (CV) duality. Here we study partially entangled thermal states in the Sachdev-Ye-Kitaev (SYK) model and their dual description in terms of operators inserted in the interior of a black hole in Jackiw-Teitelboim (JT) gravity. We compare a microscopic definition of complexity in the SYK model known as K-complexity to calculations using CV duality in JT gravity and find that both quantities show an exponential-to-linear growth behavior. We also calculate the growth of operator size under time evolution and find connections between size and complexity. While the notion of operator size saturates at the scrambling time, our study suggests that complexity, which is well defined in both quantum systems and gravity theories, can serve as a useful measure of operator evolution at both early and late times.
Krylov complexity is a measure of operator complexity that exhibits universal behavior and bounds a large class of other measures. In this paper, we generalize Krylov complexity from a closed system to an open system coupled to a Markovian bath, where Lindbladian evolution replaces Hamiltonian evolution. We show that Krylov complexity in open systems can be mapped to a non-Hermitian tight-binding model in a half-infinite chain. We discuss the properties of the non-Hermitian terms and show that the strengths of the non-Hermitian terms increase linearly with the increase of the Krylov basis index nnn. Such a non-Hermitian tight-binding model can exhibit localized edge modes that determine the long-time behavior of Krylov complexity. Hence, the growth of Krylov complexity is suppressed by dissipation, and at long times, Krylov complexity saturates at a finite value much smaller than that of a closed system with the same Hamiltonian. Our conclusions are supported by numerical results on several models, such as the Sachdev-Ye-Kitaev model and the interacting fermion model. Our work provides insights for discussing complexity, chaos, and holography for open quantum systems.
A bstract We study the operator growth in open quantum systems with dephasing dissipation terms, extending the Krylov complexity formalism of [1]. Our results are based on the study of the dissipative q -body Sachdev-Ye-Kitaev (SYK q ) model, governed by the Markovian dynamics. We introduce a notion of “operator size concentration” which allows a diagrammatic and combinatorial proof of the asymptotic linear behavior of the two sets of Lanczos coefficients ( a n and b n ) in the large q limit. Our results corroborate with the semi-analytics in finite q in the large N limit, and the numerical Arnoldi iteration in finite q and finite N limit. As a result, Krylov complexity exhibits exponential growth following a saturation at a time that grows logarithmically with the inverse dissipation strength. The growth of complexity is suppressed compared to the closed system results, yet it upper bounds the growth of the normalized out-of-time-ordered correlator (OTOC). We provide a plausible explanation of the results from the dual gravitational side.
We study symmetry-resolved Krylov complexity in finite-dimensional chaotic quantum many-body systems. When both the Hamiltonian and the initial operator commute with a conserved charge, the operator dynamics decomposes into independent symmetry sectors, each with its own Krylov chain. We show that, after saturation, the unresolved Krylov complexity is additive over symmetry sectors. In the absence of additional Liouvillian degeneracies, the late-time contribution of a sector with Hilbert-space dimension dqd_qdq​ is controlled by dq(dq−1)d_q(d_q-1)dq​(dq​−1), leading to a dimension-weighted equipartition that approaches the simple large-sector scaling dq2/∑q′dq′2d_q^2/\sum_{q'}d_{q'}^2dq2​/∑q′​dq′2​. This late-time rule differs from the early-time weighted-average discussed in the literature and is governed instead by the dimensions of the accessible operator spaces. We support the analytic prediction with numerical studies of the real and complex SYK models, a chaotic bosonic spin model, and the mixed-field Ising chain. Our results show that resolving exact symmetries is essential for interpreting the saturation value of Krylov complexity as a diagnostic of chaotic operator growth.