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

arXiv:2109.05301 · Physical Review A

Operator delocalization in quantum networks

Joonho Kim, Jeff Murugan, Jan Ollé, Dario Rosa

Published Jan 11, 2022• 78 citations
arXivHTMLPDF

Abstract

We investigate the delocalization of operators in nonchaotic quantum systems whose interactions are encoded in an underlying graph or network. In particular, we study how fast operators of different sizes delocalize as the network connectivity is varied. We argue that these delocalization properties are well captured by Krylov complexity and show, numerically, that efficient delocalization of large operators can only happen within sufficiently connected network topologies. Finally, we demonstrate how this can be used to furnish a deeper understanding of the quantum charging advantage of a class of Sachdev-Ye-Kitaev (SYK)-like quantum batteries.

DOI
10.1103/physreva.105.l010201

Related papers

The SYK charging advantage as a random walk on graphs

Francisco Divi, Jeff Murugan, Dario Rosa

We investigate the charging dynamics of Sachdev-Ye-Kitaev (SYK) models as quantum batteries, highlighting their capacity to achieve quantum charging advantages. By analytically deriving the scaling of the charging power in SYK batteries, we identify the two key mechanisms underlying this advantage: the use of operators scaling extensively with system size $N$ and the facilitation of operator delocalization by specific graph structures. A novel graph-theoretic framework is introduced in which the charging process is recast as a random walk on a graph, enabling a quantitative analysis of operator spreading. Our results establish rigorous conditions for the quantum advantage in SYK batteries and extend these insights to graph-based SYK models, revealing broader implications for energy storage and quantum dynamics. This work opens avenues for leveraging quantum chaos and complex network structures in optimizing energy transfer processes.

arXiv:2412.04560•Dec 5, 2024•0 citations

Sachdev-Ye-Kitaev charging advantage as a random walk on graphs

Francisco Divi, Jeff Murugan, Dario Rosa

We investigate the charging dynamics of Sachdev-Ye-Kitaev (SYK) models as quantum batteries, highlighting their capacity to achieve quantum charging advantages. By analytically deriving the scaling of the charging power in SYK batteries, we identify the two key mechanisms underlying this advantage: the use of operators scaling extensively with system size $N$ and the facilitation of operator delocalization by specific graph structures. A graph-theoretic framework is introduced in which the charging process is recast as a random walk on a graph, enabling a quantitative analysis of operator spreading. Our results establish rigorous conditions for the quantum advantage in SYK batteries and extend these insights to graph-based SYK models, revealing broader implications for energy storage and quantum dynamics. This work opens avenues for leveraging quantum chaos and complex network structures in optimizing energy transfer processes.

Physical review. B./Physical review. B•Feb 18, 2025•7 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 Advantage in the Charging Process of Sachdev-Ye-Kitaev Batteries

Davide Rossini, Gian Marcello Andolina, Dario Rosa +2 more

The exactly solvable Sachdev-Ye-Kitaev (SYK) model has recently received considerable attention in both condensed matter and high energy physics because it describes quantum matter without quasiparticles, while being at the same time the holographic dual of a quantum black hole. In this Letter, we examine SYK-based charging protocols of quantum batteries with N quantum cells. Extensive numerical calculations based on exact diagonalization for N up to 16 strongly suggest that the optimal charging power of our SYK quantum batteries displays a superextensive scaling with N that stems from genuine quantum mechanical effects. While the complexity of the nonequilibrium SYK problem involved in the charging dynamics prevents us from an analytical proof, we believe that this Letter offers the first (to the best of our knowledge) strong numerical evidence of a quantum advantage occurring due to the maximally entangling underlying quantum dynamics.

arXiv:1912.07234•Physical Review Letters•Dec 2, 2020•292 citations

Operator growth and spread complexity in open quantum systems

Eoin Carolan, Anthony Kiely, Steve Campbell +1 more

Commonly, the notion of "quantum chaos'' refers to the fast scrambling of information throughout complex quantum systems undergoing unitary evolution. Motivated by the Krylov complexity and the operator growth hypothesis, we demonstrate that the entropy of the population distribution for an operator in time is a useful way to capture the complexity of the internal information dynamics of a system when subject to an environment and is, in principle, agnostic to the specific choice of operator basis. We demonstrate its effectiveness for the Sachdev-Ye-Kitaev (SYK) model, examining the dynamics of the system in both its Krylov basis and the basis of operator strings. We prove that the former basis minimises spread complexity while the latter is an eigenbasis for high dissipation. In both cases, we probe the long-time dynamics of the model and the phenomenological effects of decoherence on the complexity of the dynamics.

arXiv:2404.03529•Apr 4, 2024•0 citations

Operator growth and spread complexity in open quantum systems

Eoin Carolan, Anthony Kiely, Steve Campbell +1 more

Abstract Commonly, the notion of “quantum chaos” refers to the fast scrambling of information throughout complex quantum systems undergoing unitary evolution. Motivated by the Krylov complexity and the operator growth hypothesis, we demonstrate that the entropy of the population distribution for an operator in time is a useful way to capture the complexity of the internal information dynamics of a system when subject to an environment and is, in principle, agnostic to the specific choice of operator basis. We demonstrate its effectiveness for the Sachdev-Ye-Kitaev (SYK) model, examining the dynamics of the system in both its Krylov basis and the basis of operator strings. We prove that the former basis minimises spread complexity while the latter is an eigenbasis for high dissipation. In both cases, we probe the long-time dynamics of the model and the phenomenological effects of decoherence on the complexity of the dynamics.

Europhysics Letters (EPL)•Jun 24, 2024•20 citations
We investigate the delocalization of operators in nonchaotic quantum systems whose interactions are encoded in an underlying graph or network. In particular, we study how fast operators of different sizes delocalize as the network connectivity is varied. We argue that these delocalization properties are well captured by Krylov complexity and show, numerically, that efficient delocalization of large operators can only happen within sufficiently connected network topologies. Finally, we demonstrate how this can be used to furnish a deeper understanding of the quantum charging advantage of a class of Sachdev-Ye-Kitaev (SYK)-like quantum batteries.
We investigate the charging dynamics of Sachdev-Ye-Kitaev (SYK) models as quantum batteries, highlighting their capacity to achieve quantum charging advantages. By analytically deriving the scaling of the charging power in SYK batteries, we identify the two key mechanisms underlying this advantage: the use of operators scaling extensively with system size NNN and the facilitation of operator delocalization by specific graph structures. A novel graph-theoretic framework is introduced in which the charging process is recast as a random walk on a graph, enabling a quantitative analysis of operator spreading. Our results establish rigorous conditions for the quantum advantage in SYK batteries and extend these insights to graph-based SYK models, revealing broader implications for energy storage and quantum dynamics. This work opens avenues for leveraging quantum chaos and complex network structures in optimizing energy transfer processes.
We investigate the charging dynamics of Sachdev-Ye-Kitaev (SYK) models as quantum batteries, highlighting their capacity to achieve quantum charging advantages. By analytically deriving the scaling of the charging power in SYK batteries, we identify the two key mechanisms underlying this advantage: the use of operators scaling extensively with system size NNN and the facilitation of operator delocalization by specific graph structures. A graph-theoretic framework is introduced in which the charging process is recast as a random walk on a graph, enabling a quantitative analysis of operator spreading. Our results establish rigorous conditions for the quantum advantage in SYK batteries and extend these insights to graph-based SYK models, revealing broader implications for energy storage and quantum dynamics. This work opens avenues for leveraging quantum chaos and complex network structures in optimizing energy transfer processes.
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.
The exactly solvable Sachdev-Ye-Kitaev (SYK) model has recently received considerable attention in both condensed matter and high energy physics because it describes quantum matter without quasiparticles, while being at the same time the holographic dual of a quantum black hole. In this Letter, we examine SYK-based charging protocols of quantum batteries with N quantum cells. Extensive numerical calculations based on exact diagonalization for N up to 16 strongly suggest that the optimal charging power of our SYK quantum batteries displays a superextensive scaling with N that stems from genuine quantum mechanical effects. While the complexity of the nonequilibrium SYK problem involved in the charging dynamics prevents us from an analytical proof, we believe that this Letter offers the first (to the best of our knowledge) strong numerical evidence of a quantum advantage occurring due to the maximally entangling underlying quantum dynamics.
Commonly, the notion of "quantum chaos'' refers to the fast scrambling of information throughout complex quantum systems undergoing unitary evolution. Motivated by the Krylov complexity and the operator growth hypothesis, we demonstrate that the entropy of the population distribution for an operator in time is a useful way to capture the complexity of the internal information dynamics of a system when subject to an environment and is, in principle, agnostic to the specific choice of operator basis. We demonstrate its effectiveness for the Sachdev-Ye-Kitaev (SYK) model, examining the dynamics of the system in both its Krylov basis and the basis of operator strings. We prove that the former basis minimises spread complexity while the latter is an eigenbasis for high dissipation. In both cases, we probe the long-time dynamics of the model and the phenomenological effects of decoherence on the complexity of the dynamics.
Abstract Commonly, the notion of “quantum chaos” refers to the fast scrambling of information throughout complex quantum systems undergoing unitary evolution. Motivated by the Krylov complexity and the operator growth hypothesis, we demonstrate that the entropy of the population distribution for an operator in time is a useful way to capture the complexity of the internal information dynamics of a system when subject to an environment and is, in principle, agnostic to the specific choice of operator basis. We demonstrate its effectiveness for the Sachdev-Ye-Kitaev (SYK) model, examining the dynamics of the system in both its Krylov basis and the basis of operator strings. We prove that the former basis minimises spread complexity while the latter is an eigenbasis for high dissipation. In both cases, we probe the long-time dynamics of the model and the phenomenological effects of decoherence on the complexity of the dynamics.