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:2605.20350

Resource generation and dynamical complexities in open random quantum circuits

Paranjoy Chaki, Arkaprava Sil, Priya Ghosh, Ujjwal Sen, Sudipto Singha Roy

quant-phSubmitted May 19, 2026• Announced May 21, 2026• 0 citations
arXivHTMLPDF

Abstract

Realistic quantum devices are inherently open and often involve environments with memory. Here, we investigate quantum resource generation in two classes of random circuits, namely, memoryless open and memoryful open random circuits, and compare their behavior with the well-explored random unitary circuit model. We show that environmental memory qualitatively alters the dynamics: while unitary and memoryful circuits exhibit sustained growth and saturation of entanglement and non-stabilizerness (magic); memoryless dynamics leads to a distinct behavior where entanglement decays to zero after transient growth, even though non-stabilizerness remains non-zero, indicating the persistence of nonclassical features beyond entanglement. Consistently, Krylov complexity reveals suppressed spreading of quantum states in memoryless circuits, in contrast to strong growth in unitary and memoryful dynamics, which saturates at the maximum value. Finally, we show that memoryful circuits more effectively approach low-order quantum-state k-designs than the other two circuits. Closed dynamics are therefore usually the most resource-generating, but are ideal; realistic dynamics are open and seem to generate less, but if they possess memory, they can sometimes even outdo closed dynamics.

Comments
12 pages, 9 figures

Related papers

Growth and spreading of quantum resources under random circuit dynamics

Sreemayee Aditya, Xhek Turkeshi, Piotr Sierant

Quantum many-body dynamics generate nonclassical correlations naturally described by quantum resource theories. Quantum magic resources (or nonstabilizerness) capture deviation from classically simulable stabilizer states, while coherence and fermionic non-Gaussianity measure departure from the computational basis and from fermionic Gaussian states, respectively. We track these resources in a subsystem of a one-dimensional qubit chain evolved by random brickwall circuits. For resource-generating gates, evolution from low-resource states exhibits a universal rise-peak-fall behavior, with the peak time scaling logarithmically with subsystem size and the resource eventually decaying as the subsystem approaches a maximally mixed state. Circuits whose gates do not create the resource but entangle neighboring qubits, give rise to a ballistic spreading of quantum resource initially confined to a region of the initial state. Our results give a unified picture of spatiotemporal resource dynamics in local circuits and a baseline for more structured quantum many-body systems.

quant-pharXiv:2512.14827•Physical Review Research•Dec 18, 2025•1 citation

Magic spreading in random quantum circuits

Xhek Turkeshi, Emanuele Tirrito, Piotr Sierant

Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. In this paper, we investigate how fast generic many-body dynamics generate magic resources under the constraints of locality and unitarity, focusing on magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to N = 1024 qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.

arXiv:2407.03929•Nature Communications•Mar 15, 2025•66 citations

Quantum complexity and localization in random and time-periodic unitary circuits

Himanshu Sahu, Aranya Bhattacharya, Pingal Pratyush Nath

We study the growth and saturation of complexity in Krylov basis in random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, this notion of complexity grows linearly before saturating at a late-time value of $d/2$, where $d$ is the Hilbert space dimension, at timescales $\sim d$. Our numerical analysis encompasses two classes of random circuits: brick-wall random unitary circuits and Floquet random circuits. In brick-wall case, complexity in Krylov basis exhibits dynamics consistent with Haar-random unitary evolution, while the inclusion of measurements significantly slows its growth down. For Floquet random circuits, we show that localized phases lead to reduced late-time saturation values of the complexity enabling us to probe the transition between thermal and many-body localized phases.

arXiv:2409.03656•Physical review. B./Physical review. B•May 19, 2026•0 citations

Growth of genuine multipartite entanglement in random unitary circuits

Anindita Bera, Sudipto Singha Roy

We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite entanglement remains slower in comparison to the random unitary case. However, the final saturation value of multipartite entanglement is almost the same in both cases. The behavior is then compared to the genuine multipartite entanglement obtained in random matrix product states with a moderately high bond dimension. We then relate the behavior of multipartite entanglement to other global properties of the system, viz., the delocalization of the many-body wave functions in Hilbert space. Along with this, we analyze the robustness of such highly entangled quantum states obtained through random unitary dynamics under weak measurements.

arXiv:2003.12546•Physical Review A•Dec 30, 2020•19 citations

How rare are Markovian quantum dynamics?

Charlotte Bäcker, Nick Maryshchak, Walter T. Strunz

A profound understanding of decoherence and dissipation in quantum dynamics is crucial for the realistic modeling of the evolution of quantum systems. In open quantum dynamics one distinguishes between a memoryless, so-called Markovian evolution and dynamics incorporating memory effects, termed non-Markovian. In this work we study how prevalent memory effects are in the set of all such dynamics. We thus investigate how often a Markovian description is applicable. This question is approached by investigating randomly generated two-step qubit dynamics with respect to different concepts and witnesses of non-Markovianity. We observe that almost all dynamics are non-Markovian, and only a small (yet finite) fraction is Markovian. Furthermore, we study how this proportion changes when considering certain subclasses such as lower rank or mixed-unitary dynamics. Importantly, our results shed light on the relative ratios of -- and interrelations between -- the sets of dynamics that are non-Markovian with respect to different criteria. Finally, we investigate the fraction of dynamics in which the memory effects are necessarily of quantum nature and establish a connection between two recently developed concepts that characterize the quantumness of memory in non-Markovian dynamics.

quant-pharXiv:2606.24511•Jun 24, 2026•0 citations

Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity

Dimitrios Patramanis, Watse Sybesma

In this work we study the relationship between quantum random walks on graphs and Krylov/spread complexity. We show that the latter's definition naturally emerges through a canonical method of reducing a graph to a chain, on which we can identify the usual Krylov structure. We use this identification to construct families of graphs corresponding to special classes of systems with known complexity features and conversely, to compute Krylov complexity for graphs of physical interest. The two main outcomes are the analytic computation of the Lanczos coefficients for the SYK model for an arbitrary number $q$ of interacting fermions and the complete characterization of Krylov complexity for the hypercube graph in any number of dimensions. The latter serves as the starting point for an in-depth comparison between Krylov and circuit complexities as they purportedly arise in the context of black holes. We find that while under certain conditions Krylov complexity follows the growth and saturation pattern ascribed to such systems, the timescale at which saturation happens can generally be shorter than what is predicted by random unitary circuits, due to the effects of quantum speed-ups commonly occurring when comparing quantum and classical random walks.

hep-thCross-listedarXiv:2602.04949•Journal of High Energy Physics•Feb 6, 2026•0 citations
Realistic quantum devices are inherently open and often involve environments with memory. Here, we investigate quantum resource generation in two classes of random circuits, namely, memoryless open and memoryful open random circuits, and compare their behavior with the well-explored random unitary circuit model. We show that environmental memory qualitatively alters the dynamics: while unitary and memoryful circuits exhibit sustained growth and saturation of entanglement and non-stabilizerness (magic); memoryless dynamics leads to a distinct behavior where entanglement decays to zero after transient growth, even though non-stabilizerness remains non-zero, indicating the persistence of nonclassical features beyond entanglement. Consistently, Krylov complexity reveals suppressed spreading of quantum states in memoryless circuits, in contrast to strong growth in unitary and memoryful dynamics, which saturates at the maximum value. Finally, we show that memoryful circuits more effectively approach low-order quantum-state k-designs than the other two circuits. Closed dynamics are therefore usually the most resource-generating, but are ideal; realistic dynamics are open and seem to generate less, but if they possess memory, they can sometimes even outdo closed dynamics.
Quantum many-body dynamics generate nonclassical correlations naturally described by quantum resource theories. Quantum magic resources (or nonstabilizerness) capture deviation from classically simulable stabilizer states, while coherence and fermionic non-Gaussianity measure departure from the computational basis and from fermionic Gaussian states, respectively. We track these resources in a subsystem of a one-dimensional qubit chain evolved by random brickwall circuits. For resource-generating gates, evolution from low-resource states exhibits a universal rise-peak-fall behavior, with the peak time scaling logarithmically with subsystem size and the resource eventually decaying as the subsystem approaches a maximally mixed state. Circuits whose gates do not create the resource but entangle neighboring qubits, give rise to a ballistic spreading of quantum resource initially confined to a region of the initial state. Our results give a unified picture of spatiotemporal resource dynamics in local circuits and a baseline for more structured quantum many-body systems.
Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. In this paper, we investigate how fast generic many-body dynamics generate magic resources under the constraints of locality and unitarity, focusing on magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to N = 1024 qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.
We study the growth and saturation of complexity in Krylov basis in random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, this notion of complexity grows linearly before saturating at a late-time value of d/2d/2d/2, where ddd is the Hilbert space dimension, at timescales ∼d\sim d∼d. Our numerical analysis encompasses two classes of random circuits: brick-wall random unitary circuits and Floquet random circuits. In brick-wall case, complexity in Krylov basis exhibits dynamics consistent with Haar-random unitary evolution, while the inclusion of measurements significantly slows its growth down. For Floquet random circuits, we show that localized phases lead to reduced late-time saturation values of the complexity enabling us to probe the transition between thermal and many-body localized phases.
We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite entanglement remains slower in comparison to the random unitary case. However, the final saturation value of multipartite entanglement is almost the same in both cases. The behavior is then compared to the genuine multipartite entanglement obtained in random matrix product states with a moderately high bond dimension. We then relate the behavior of multipartite entanglement to other global properties of the system, viz., the delocalization of the many-body wave functions in Hilbert space. Along with this, we analyze the robustness of such highly entangled quantum states obtained through random unitary dynamics under weak measurements.
A profound understanding of decoherence and dissipation in quantum dynamics is crucial for the realistic modeling of the evolution of quantum systems. In open quantum dynamics one distinguishes between a memoryless, so-called Markovian evolution and dynamics incorporating memory effects, termed non-Markovian. In this work we study how prevalent memory effects are in the set of all such dynamics. We thus investigate how often a Markovian description is applicable. This question is approached by investigating randomly generated two-step qubit dynamics with respect to different concepts and witnesses of non-Markovianity. We observe that almost all dynamics are non-Markovian, and only a small (yet finite) fraction is Markovian. Furthermore, we study how this proportion changes when considering certain subclasses such as lower rank or mixed-unitary dynamics. Importantly, our results shed light on the relative ratios of -- and interrelations between -- the sets of dynamics that are non-Markovian with respect to different criteria. Finally, we investigate the fraction of dynamics in which the memory effects are necessarily of quantum nature and establish a connection between two recently developed concepts that characterize the quantumness of memory in non-Markovian dynamics.
In this work we study the relationship between quantum random walks on graphs and Krylov/spread complexity. We show that the latter's definition naturally emerges through a canonical method of reducing a graph to a chain, on which we can identify the usual Krylov structure. We use this identification to construct families of graphs corresponding to special classes of systems with known complexity features and conversely, to compute Krylov complexity for graphs of physical interest. The two main outcomes are the analytic computation of the Lanczos coefficients for the SYK model for an arbitrary number qqq of interacting fermions and the complete characterization of Krylov complexity for the hypercube graph in any number of dimensions. The latter serves as the starting point for an in-depth comparison between Krylov and circuit complexities as they purportedly arise in the context of black holes. We find that while under certain conditions Krylov complexity follows the growth and saturation pattern ascribed to such systems, the timescale at which saturation happens can generally be shorter than what is predicted by random unitary circuits, due to the effects of quantum speed-ups commonly occurring when comparing quantum and classical random walks.