Bridging Classical and Quantum Information Scrambling with the Operator Entanglement Spectrum

Summarize this article with:
AbstractUniversal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite generating no entanglement in the computational basis, these circuits nevertheless capture many features expected from fully quantum evolutions. In this work, we demonstrate that the differences between automaton dynamics and fully quantum dynamics are revealed by the operator entanglement spectrum, much like the entanglement spectrum of a quantum state distinguishes between the dynamics of states under Clifford and Haar random circuits. While the operator entanglement spectrum under random unitary dynamics is governed by the eigenvalue statistics of random Gaussian matrices, we show evidence that under random automaton dynamics it is described by the statistics of Bernoulli random matrices, whose entries are random variables taking values $0$ or $1$. We study the crossover between automaton and generic unitary operator dynamics as the automaton circuit is doped with gates that introduce superpositions, namely Hadamard or $R_x = e^{-i\frac{\pi}{4}X}$ gates. We find that a constant number of superposition-generating gates is sufficient to drive the operator dynamics to the random-circuit universality class, similar to earlier results on Clifford circuits doped with $T$ gates. This establishes the operator entanglement spectrum as a useful tool for probing the chaoticity and universality class of quantum dynamics.Popular summaryIdentifying universal features of chaotic quantum evolution has been an active pursuit of physics in the last decade, with applications ranging from quantum cryptography to the quantum dynamics of black holes. In the quest to model these dynamics, automaton circuits—classical reversible binary gates viewed as unitary quantum operators—have been introduced in recent years as a computationally tractable model sharing many of the features of random unitary circuits. Despite their similarity, it has remained unclear what features distinguish these two classes of quantum dynamics. We identify a universal feature of chaotic quantum evolution, the operator entanglement spectrum (OES), and show that it establishes a definitive difference between generic unitary and reversible classical dynamics. Furthermore, automaton circuits represent universal classical logic and form a complete quantum gate set when a superposition-generating "Hadamard" gate is added. We find that a finite number of Hadamard gates drives the OES from the automaton circuit class exponentially close to the random unitary class, creating a bridge between classical and quantum information chaos. Since the OES quantifies delocalization in operator space, our characterization of the OES in automaton circuits may have applications to classifying the hardness of classical and quantum cryptographic protocols.► BibTeX data@article{McDonough2026bridgingclassical, doi = {10.22331/q-2026-03-05-2012}, url = {https://doi.org/10.22331/q-2026-03-05-2012}, title = {Bridging {C}lassical and {Q}uantum {I}nformation {S}crambling with the {O}perator {E}ntanglement {S}pectrum}, author = {McDonough, Ben T. and Chamon, Claudio and Wilson, Justin H. and Iadecola, Thomas}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2012}, month = mar, year = {2026} }► References [1] Xiao Mi, Pedram Roushan, Chris Quintana, Salvatore Mandra, Jeffrey Marshall, Charles Neill, Frank Arute, Kunal Arya, Juan Atalaya, Ryan Babbush, et al. ``Information scrambling in quantum circuits''. Science 374, 1479–1483 (2021). https://doi.org/10.1126/science.abg5029 [2] Matthew PA Fisher, Vedika Khemani, Adam Nahum, and Sagar Vijay. ``Random quantum circuits''. Annual Review of Condensed Matter Physics 14, 335–379 (2023). https://doi.org/10.1146/annurev-conmatphys-031720-030658 [3] Jordan Cotler, Nicholas Hunter-Jones, Junyu Liu, and Beni Yoshida. ``Chaos, complexity, and random matrices''. Journal of High Energy Physics 2017, 1–60 (2017). https://doi.org/10.1007/JHEP11(2017)048 [4] Scott D. Geraedts, Rahul Nandkishore, and Nicolas Regnault. ``Many-body localization and thermalization: Insights from the entanglement spectrum''. Phys. Rev. B 93, 174202 (2016). https://doi.org/10.1103/PhysRevB.93.174202 [5] Zhi-Cheng Yang, Alioscia Hamma, Salvatore M. Giampaolo, Eduardo R. Mucciolo, and Claudio Chamon. ``Entanglement complexity in quantum many-body dynamics, thermalization, and localization''. Phys. Rev. B 96, 020408 (2017). https://doi.org/10.1103/PhysRevB.96.020408 [6] Claudio Chamon, Alioscia Hamma, and Eduardo R. Mucciolo. ``Emergent irreversibility and entanglement spectrum statistics''. Phys. Rev. Lett. 112, 240501 (2014). https://doi.org/10.1103/PhysRevLett.112.240501 [7] Po-Yao Chang, Xiao Chen, Sarang Gopalakrishnan, and J. H. Pixley. ``Evolution of entanglement spectra under generic quantum dynamics''. Phys. Rev. Lett. 123, 190602 (2019). https://doi.org/10.1103/PhysRevLett.123.190602 [8] Daniel Shaffer, Claudio Chamon, Alioscia Hamma, and Eduardo R Mucciolo. ``Irreversibility and entanglement spectrum statistics in quantum circuits''. Journal of Statistical Mechanics: Theory and Experiment 2014, P12007 (2014). https://doi.org/10.1088/1742-5468/2014/12/P12007 [9] T. Rakovszky, S. Gopalakrishnan, S. A. Parameswaran, and F. Pollmann. ``Signatures of information scrambling in the dynamics of the entanglement spectrum''. Phys. Rev. B 100, 125115 (2019). https://doi.org/10.1103/PhysRevB.100.125115 [10] Xiao Chen and Andreas W. W. Ludwig. ``Universal spectral correlations in the chaotic wave function and the development of quantum chaos''. Phys. Rev. B 98, 064309 (2018). https://doi.org/10.1103/PhysRevB.98.064309 [11] S D Geraedts, N Regnault, and R M Nandkishore. ``Characterizing the many-body localization transition using the entanglement spectrum''. New Journal of Physics 19, 113021 (2017). https://doi.org/10.1088/1367-2630/aa93a5 [12] Shiyu Zhou, Zhicheng Yang, Alioscia Hamma, and Claudio Chamon. ``Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics''. SciPost Physics 9, 087 (2020). https://doi.org/10.21468/SciPostPhys.9.6.087 [13] Adam Nahum, Sagar Vijay, and Jeongwan Haah. ``Operator spreading in random unitary circuits''. Phys. Rev. X 8, 021014 (2018). https://doi.org/10.1103/PhysRevX.8.021014 [14] Pavan Hosur, Xiao-Liang Qi, Daniel A Roberts, and Beni Yoshida. ``Chaos in quantum channels''. Journal of High Energy Physics 2016, 1–49 (2016). https://doi.org/10.1007/JHEP02(2016)004 [15] Adam Nahum, Jonathan Ruhman, Sagar Vijay, and Jeongwan Haah. ``Quantum entanglement growth under random unitary dynamics''. Phys. Rev. X 7, 031016 (2017). https://doi.org/10.1103/PhysRevX.7.031016 [16] Xiaoguang Wang and Paolo Zanardi. ``Quantum entanglement of unitary operators on bipartite systems''. Phys. Rev. A 66, 044303 (2002). https://doi.org/10.1103/PhysRevA.66.044303 [17] Paolo Zanardi. ``Entanglement of quantum evolutions''. Phys. Rev. A 63, 040304 (2001). https://doi.org/10.1103/PhysRevA.63.040304 [18] Shenglong Xu and Brian Swingle. ``Accessing scrambling using matrix product operators''. Nat. Phys. 16, 199–204 (2019). https://doi.org/10.1038/s41567-019-0712-4 [19] Georgios Styliaris, Namit Anand, and Paolo Zanardi. ``Information scrambling over bipartitions: Equilibration, entropy production, and typicality''. Phys. Rev. Lett. 126, 030601 (2021). https://doi.org/10.1103/PhysRevLett.126.030601 [20] Shenglong Xu and Brian Swingle. ``Scrambling dynamics and out-of-time-ordered correlators in quantum many-body systems''. PRX Quantum 5, 010201 (2024). https://doi.org/10.1103/PRXQuantum.5.010201 [21] Iztok Pižorn and Tomaž Prosen. ``Operator space entanglement entropy in $xy$ spin chains''. Phys. Rev. B 79, 184416 (2009). https://doi.org/10.1103/PhysRevB.79.184416 [22] Tomaž Prosen. ``Chaos and complexity of quantum motion''. Journal of Physics A: Mathematical and Theoretical 40, 7881–7918 (2007). https://doi.org/10.1088/1751-8113/40/28/s02 [23] Tomaž Prosen and Iztok Pižorn. ``Operator space entanglement entropy in a transverse Ising chain''. Phys. Rev. A 76, 032316 (2007). https://doi.org/10.1103/PhysRevA.76.032316 [24] Neil Dowling, Pavel Kos, and Kavan Modi. ``Scrambling is necessary but not sufficient for chaos''. Phys. Rev. Lett. 131, 180403 (2023). https://doi.org/10.1103/PhysRevLett.131.180403 [25] Don N. Page. ``Average entropy of a subsystem''. Phys. Rev. Lett. 71, 1291–1294 (1993). https://doi.org/10.1103/PhysRevLett.71.1291 [26] Jorge Sánchez-Ruiz. ``Simple proof of Page's conjecture on the average entropy of a subsystem''. Phys. Rev. E 52, 5653–5655 (1995). https://doi.org/10.1103/PhysRevE.52.5653 [27] Jason Iaconis. ``Quantum state complexity in computationally tractable quantum circuits''. PRX Quantum 2, 010329 (2021). https://doi.org/10.1103/PRXQuantum.2.010329 [28] Andrea Pizzi and Norman Y. Yao. ``Bipartite mutual information in classical many-body dynamics''. Phys. Rev. B 110, L020301 (2024). https://doi.org/10.1103/PhysRevB.110.L020301 [29] Jason Iaconis, Sagar Vijay, and Rahul Nandkishore. ``Anomalous subdiffusion from subsystem symmetries''. Physical Review B 100, 214301 (2019). https://doi.org/10.1103/PhysRevB.100.214301 [30] Claudio Chamon, Eduardo R Mucciolo, and Andrei E Ruckenstein. ``Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers''. Annals of Physics 446, 169086 (2022). https://doi.org/10.1016/j.aop.2022.169086 [31] Bruno Bertini, Katja Klobas, Pavel Kos, and Daniel Malz. ``Quantum and classical dynamics with random permutation circuits''. Physical Review X 15, 011015 (2025). https://doi.org/10.1103/PhysRevX.15.011015 [32] Andrea Pizzi, Daniel Malz, Andreas Nunnenkamp, and Johannes Knolle. ``Bridging the gap between classical and quantum many-body information dynamics''. Phys. Rev. B 106, 214303 (2022). https://doi.org/10.1103/PhysRevB.106.214303 [33] J. Haferkamp, F. Montealegre-Mora, M. Heinrich, J. Eisert, D. Gross, and I. Roth. ``Efficient unitary designs with a system-size independent number of non-Clifford gates''. Communications in Mathematical Physics 397, 995–1041 (2022). https://doi.org/10.1007/s00220-022-04507-6 [34] Xiao Chen and Tianci Zhou. ``Operator scrambling and quantum chaos'' (2018). arXiv:1804.08655. arXiv:1804.08655 [35] Eugene P. Wigner. ``On the statistical distribution of the widths and spacings of nuclear resonance levels''. Mathematical Proceedings of the Cambridge Philosophical Society 47, 790–798 (1951). https://doi.org/10.1017/S0305004100027237 [36] Dorit Aharonov. ``A simple proof that Toffoli and Hadamard are quantum universal'' (2003). arXiv:quant-ph/0301040. arXiv:quant-ph/0301040 [37] Yasar Y Atas, Eugene Bogomolny, Olivier Giraud, and Guillame Roux. ``Distribution of the ratio of consecutive level spacings in random matrix ensembles''. Physical review letters 110, 084101 (2013). https://doi.org/10.1103/PhysRevLett.110.084101 [38] Vladimir Alexandrovich Marčenko and Leonid Andreevich Pastur. ``Distribution of eigenvalues for some sets of random matrices''. Matematicheskii Sbornik 114, 507–536 (1967). https://doi.org/10.1070/SM1967v001n04ABEH001994 [39] Benoît Collins and Ion Nechita. ``Random matrix techniques in quantum information theory''. Journal of Mathematical Physics 57, 015215 (2015). https://doi.org/10.1063/1.4936880 [40] Celine Nadal, Satya N. Majumdar, and Massimo Vergassola. ``Statistical distribution of quantum entanglement for a random bipartite state''. Journal of Statistical Physics 142, 403–438 (2011). https://doi.org/10.1007/s10955-010-0108-4 [41] Dan Voiculescu. ``Limit laws for random matrices and free products''. Inventiones mathematicae 104, 201–220 (1991). https://doi.org/10.1007/BF01245072 [42] Adina Roxana Feier. ``Methods of proof in random matrix theory''. Volume 9. Harvard University. (2012). url: https://www.math.harvard.edu/media/feier.pdf. https://www.math.harvard.edu/media/feier.pdf [43] Dénes Petz and Júlia Réffy. ``On asymptotics of large Haar distributed unitary matrices''.
Periodica Mathematica Hungarica 49, 103–117 (2004). https://doi.org/10.1023/B:MAHU.0000040542.56072.ab [44] Karol Zyczkowski and Hans-Jürgen Sommers. ``Truncations of random unitary matrices''. Journal of Physics A: Mathematical and General 33, 2045–2057 (2000). https://doi.org/10.1088/0305-4470/33/10/307 [45] Jean Ginibre. ``Statistical ensembles of complex, quaternion, and real matrices''. Journal of Mathematical Physics 6, 440–449 (1965). https://doi.org/10.1063/1.1704292 [46] Alice Guionnet. ``Bernoulli random matrices'' (2021). arXiv:2112.05506. arXiv:2112.05506 [47] A. Khorunzhy and V. Vengerovsky. ``On asymptotic solvability of random graph's Laplacians'' (2000). arXiv:math-ph/0009028. arXiv:math-ph/0009028 [48] Noga Alon and Joel H Spencer. ``The probabilistic method''. John Wiley & Sons. (2015). https://doi.org/10.1002/0471722154 [49] Don Coppersmith and Edna Grossman. ``Generators for certain alternating groups with applications to cryptography''. SIAM Journal on Applied Mathematics 29, 624–627 (1975). https://doi.org/10.1137/0129051 [50] Neil Dowling, Kavan Modi, and Gregory A. L. White. ``Bridging entanglement and magic resources within operator space''.
Physical Review Letters 135 (2025). https://doi.org/10.1103/c7k1-xcwy [51] Calvin Bakker and Wout Merbis. ``Operator entanglement growth quantifies complexity of cellular automata''.
In International Conference on Computational Science. Pages 33–47. Springer (2024). https://doi.org/10.1007/978-3-031-63749-0_3 [52] Tony Metger, Alexander Poremba, Makrand Sinha, and Henry Yuen. ``Simple constructions of linear-depth t-designs and pseudorandom unitaries'' (2024). arXiv:2404.12647. arXiv:2404.12647 [53] Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G.S.L. Brandão, and Patrick Hayden. ``Efficient unitary designs from random sums and permutations''. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). Page 476–484. IEEE (2024). https://doi.org/10.1109/focs61266.2024.00037 [54] Benjamin McDonough. ``benmcdonough20/AutomataOperatorEntanglement''. https://doi.org/10.5281/zenodo.15615989 (2025). https://doi.org/10.5281/zenodo.15615989 [55] P. Erdös and A. Rényi. ``On the evolution of random graphs''. Pages 38–82.
Princeton University Press. Princeton (2006). [56] Charles Bordenave, Marc Lelarge, and Justin Salez. ``The rank of diluted random graphs''. The Annals of Probability 39 (2011). https://doi.org/10.1214/10-aop567 [57] Charles Bordenave, Arnab Sen, and Bálint Virág. ``Mean quantum percolation''. Journal of the European Mathematical Society 19, 3679–3707 (2017). https://doi.org/10.4171/jems/750 [58] Justin Salez. ``Every totally real algebraic integer is a tree eigenvalue''. Journal of Combinatorial Theory, Series B 111, 249–256 (2015). https://doi.org/10.1016/j.jctb.2014.09.001 [59] Eva-Maria Hainzl and Élie de Panafieu. ``Tree Walks and the Spectrum of Random Graphs''. In Cécile Mailler and Sebastian Wild, editors, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Volume 302 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). https://doi.org/10.4230/LIPIcs.AofA.2024.11 [60] Benoit Collins, Sho Matsumoto, and Jonathan Novak. ``The Weingarten calculus''. Notices of the American Mathematical Society 69, 1 (2022). https://doi.org/10.1090/noti2474Cited byCould not fetch Crossref cited-by data during last attempt 2026-03-05 10:43:37: Could not fetch cited-by data for 10.22331/q-2026-03-05-2012 from Crossref. This is normal if the DOI was registered recently. Could not fetch ADS cited-by data during last attempt 2026-03-05 10:43:38: No response from ADS or unable to decode the received json data when getting the list of citing works.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions. AbstractUniversal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite generating no entanglement in the computational basis, these circuits nevertheless capture many features expected from fully quantum evolutions. In this work, we demonstrate that the differences between automaton dynamics and fully quantum dynamics are revealed by the operator entanglement spectrum, much like the entanglement spectrum of a quantum state distinguishes between the dynamics of states under Clifford and Haar random circuits. While the operator entanglement spectrum under random unitary dynamics is governed by the eigenvalue statistics of random Gaussian matrices, we show evidence that under random automaton dynamics it is described by the statistics of Bernoulli random matrices, whose entries are random variables taking values $0$ or $1$. We study the crossover between automaton and generic unitary operator dynamics as the automaton circuit is doped with gates that introduce superpositions, namely Hadamard or $R_x = e^{-i\frac{\pi}{4}X}$ gates. We find that a constant number of superposition-generating gates is sufficient to drive the operator dynamics to the random-circuit universality class, similar to earlier results on Clifford circuits doped with $T$ gates. This establishes the operator entanglement spectrum as a useful tool for probing the chaoticity and universality class of quantum dynamics.Popular summaryIdentifying universal features of chaotic quantum evolution has been an active pursuit of physics in the last decade, with applications ranging from quantum cryptography to the quantum dynamics of black holes. In the quest to model these dynamics, automaton circuits—classical reversible binary gates viewed as unitary quantum operators—have been introduced in recent years as a computationally tractable model sharing many of the features of random unitary circuits. Despite their similarity, it has remained unclear what features distinguish these two classes of quantum dynamics. We identify a universal feature of chaotic quantum evolution, the operator entanglement spectrum (OES), and show that it establishes a definitive difference between generic unitary and reversible classical dynamics. Furthermore, automaton circuits represent universal classical logic and form a complete quantum gate set when a superposition-generating "Hadamard" gate is added. We find that a finite number of Hadamard gates drives the OES from the automaton circuit class exponentially close to the random unitary class, creating a bridge between classical and quantum information chaos. Since the OES quantifies delocalization in operator space, our characterization of the OES in automaton circuits may have applications to classifying the hardness of classical and quantum cryptographic protocols.► BibTeX data@article{McDonough2026bridgingclassical, doi = {10.22331/q-2026-03-05-2012}, url = {https://doi.org/10.22331/q-2026-03-05-2012}, title = {Bridging {C}lassical and {Q}uantum {I}nformation {S}crambling with the {O}perator {E}ntanglement {S}pectrum}, author = {McDonough, Ben T. and Chamon, Claudio and Wilson, Justin H. and Iadecola, Thomas}, journal = {{Quantum}}, issn = {2521-327X}, publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}, volume = {10}, pages = {2012}, month = mar, year = {2026} }► References [1] Xiao Mi, Pedram Roushan, Chris Quintana, Salvatore Mandra, Jeffrey Marshall, Charles Neill, Frank Arute, Kunal Arya, Juan Atalaya, Ryan Babbush, et al. ``Information scrambling in quantum circuits''. Science 374, 1479–1483 (2021). https://doi.org/10.1126/science.abg5029 [2] Matthew PA Fisher, Vedika Khemani, Adam Nahum, and Sagar Vijay. ``Random quantum circuits''. Annual Review of Condensed Matter Physics 14, 335–379 (2023). https://doi.org/10.1146/annurev-conmatphys-031720-030658 [3] Jordan Cotler, Nicholas Hunter-Jones, Junyu Liu, and Beni Yoshida. ``Chaos, complexity, and random matrices''. Journal of High Energy Physics 2017, 1–60 (2017). https://doi.org/10.1007/JHEP11(2017)048 [4] Scott D. Geraedts, Rahul Nandkishore, and Nicolas Regnault. ``Many-body localization and thermalization: Insights from the entanglement spectrum''. Phys. Rev. B 93, 174202 (2016). https://doi.org/10.1103/PhysRevB.93.174202 [5] Zhi-Cheng Yang, Alioscia Hamma, Salvatore M. Giampaolo, Eduardo R. Mucciolo, and Claudio Chamon. ``Entanglement complexity in quantum many-body dynamics, thermalization, and localization''. Phys. Rev. B 96, 020408 (2017). https://doi.org/10.1103/PhysRevB.96.020408 [6] Claudio Chamon, Alioscia Hamma, and Eduardo R. Mucciolo. ``Emergent irreversibility and entanglement spectrum statistics''. Phys. Rev. Lett. 112, 240501 (2014). https://doi.org/10.1103/PhysRevLett.112.240501 [7] Po-Yao Chang, Xiao Chen, Sarang Gopalakrishnan, and J. H. Pixley. ``Evolution of entanglement spectra under generic quantum dynamics''. Phys. Rev. Lett. 123, 190602 (2019). https://doi.org/10.1103/PhysRevLett.123.190602 [8] Daniel Shaffer, Claudio Chamon, Alioscia Hamma, and Eduardo R Mucciolo. ``Irreversibility and entanglement spectrum statistics in quantum circuits''. Journal of Statistical Mechanics: Theory and Experiment 2014, P12007 (2014). https://doi.org/10.1088/1742-5468/2014/12/P12007 [9] T. Rakovszky, S. Gopalakrishnan, S. A. Parameswaran, and F. Pollmann. ``Signatures of information scrambling in the dynamics of the entanglement spectrum''. Phys. Rev. B 100, 125115 (2019). https://doi.org/10.1103/PhysRevB.100.125115 [10] Xiao Chen and Andreas W. W. Ludwig. ``Universal spectral correlations in the chaotic wave function and the development of quantum chaos''. Phys. Rev. B 98, 064309 (2018). https://doi.org/10.1103/PhysRevB.98.064309 [11] S D Geraedts, N Regnault, and R M Nandkishore. ``Characterizing the many-body localization transition using the entanglement spectrum''. New Journal of Physics 19, 113021 (2017). https://doi.org/10.1088/1367-2630/aa93a5 [12] Shiyu Zhou, Zhicheng Yang, Alioscia Hamma, and Claudio Chamon. ``Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics''. SciPost Physics 9, 087 (2020). https://doi.org/10.21468/SciPostPhys.9.6.087 [13] Adam Nahum, Sagar Vijay, and Jeongwan Haah. ``Operator spreading in random unitary circuits''. Phys. Rev. X 8, 021014 (2018). https://doi.org/10.1103/PhysRevX.8.021014 [14] Pavan Hosur, Xiao-Liang Qi, Daniel A Roberts, and Beni Yoshida. ``Chaos in quantum channels''. Journal of High Energy Physics 2016, 1–49 (2016). https://doi.org/10.1007/JHEP02(2016)004 [15] Adam Nahum, Jonathan Ruhman, Sagar Vijay, and Jeongwan Haah. ``Quantum entanglement growth under random unitary dynamics''. Phys. Rev. X 7, 031016 (2017). https://doi.org/10.1103/PhysRevX.7.031016 [16] Xiaoguang Wang and Paolo Zanardi. ``Quantum entanglement of unitary operators on bipartite systems''. Phys. Rev. A 66, 044303 (2002). https://doi.org/10.1103/PhysRevA.66.044303 [17] Paolo Zanardi. ``Entanglement of quantum evolutions''. Phys. Rev. A 63, 040304 (2001). https://doi.org/10.1103/PhysRevA.63.040304 [18] Shenglong Xu and Brian Swingle. ``Accessing scrambling using matrix product operators''. Nat. Phys. 16, 199–204 (2019). https://doi.org/10.1038/s41567-019-0712-4 [19] Georgios Styliaris, Namit Anand, and Paolo Zanardi. ``Information scrambling over bipartitions: Equilibration, entropy production, and typicality''. Phys. Rev. Lett. 126, 030601 (2021). https://doi.org/10.1103/PhysRevLett.126.030601 [20] Shenglong Xu and Brian Swingle. ``Scrambling dynamics and out-of-time-ordered correlators in quantum many-body systems''. PRX Quantum 5, 010201 (2024). https://doi.org/10.1103/PRXQuantum.5.010201 [21] Iztok Pižorn and Tomaž Prosen. ``Operator space entanglement entropy in $xy$ spin chains''. Phys. Rev. B 79, 184416 (2009). https://doi.org/10.1103/PhysRevB.79.184416 [22] Tomaž Prosen. ``Chaos and complexity of quantum motion''. Journal of Physics A: Mathematical and Theoretical 40, 7881–7918 (2007). https://doi.org/10.1088/1751-8113/40/28/s02 [23] Tomaž Prosen and Iztok Pižorn. ``Operator space entanglement entropy in a transverse Ising chain''. Phys. Rev. A 76, 032316 (2007). https://doi.org/10.1103/PhysRevA.76.032316 [24] Neil Dowling, Pavel Kos, and Kavan Modi. ``Scrambling is necessary but not sufficient for chaos''. Phys. Rev. Lett. 131, 180403 (2023). https://doi.org/10.1103/PhysRevLett.131.180403 [25] Don N. Page. ``Average entropy of a subsystem''. Phys. Rev. Lett. 71, 1291–1294 (1993). https://doi.org/10.1103/PhysRevLett.71.1291 [26] Jorge Sánchez-Ruiz. ``Simple proof of Page's conjecture on the average entropy of a subsystem''. Phys. Rev. E 52, 5653–5655 (1995). https://doi.org/10.1103/PhysRevE.52.5653 [27] Jason Iaconis. ``Quantum state complexity in computationally tractable quantum circuits''. PRX Quantum 2, 010329 (2021). https://doi.org/10.1103/PRXQuantum.2.010329 [28] Andrea Pizzi and Norman Y. Yao. ``Bipartite mutual information in classical many-body dynamics''. Phys. Rev. B 110, L020301 (2024). https://doi.org/10.1103/PhysRevB.110.L020301 [29] Jason Iaconis, Sagar Vijay, and Rahul Nandkishore. ``Anomalous subdiffusion from subsystem symmetries''. Physical Review B 100, 214301 (2019). https://doi.org/10.1103/PhysRevB.100.214301 [30] Claudio Chamon, Eduardo R Mucciolo, and Andrei E Ruckenstein. ``Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers''. Annals of Physics 446, 169086 (2022). https://doi.org/10.1016/j.aop.2022.169086 [31] Bruno Bertini, Katja Klobas, Pavel Kos, and Daniel Malz. ``Quantum and classical dynamics with random permutation circuits''. Physical Review X 15, 011015 (2025). https://doi.org/10.1103/PhysRevX.15.011015 [32] Andrea Pizzi, Daniel Malz, Andreas Nunnenkamp, and Johannes Knolle. ``Bridging the gap between classical and quantum many-body information dynamics''. Phys. Rev. B 106, 214303 (2022). https://doi.org/10.1103/PhysRevB.106.214303 [33] J. Haferkamp, F. Montealegre-Mora, M. Heinrich, J. Eisert, D. Gross, and I. Roth. ``Efficient unitary designs with a system-size independent number of non-Clifford gates''. Communications in Mathematical Physics 397, 995–1041 (2022). https://doi.org/10.1007/s00220-022-04507-6 [34] Xiao Chen and Tianci Zhou. ``Operator scrambling and quantum chaos'' (2018). arXiv:1804.08655. arXiv:1804.08655 [35] Eugene P. Wigner. ``On the statistical distribution of the widths and spacings of nuclear resonance levels''. Mathematical Proceedings of the Cambridge Philosophical Society 47, 790–798 (1951). https://doi.org/10.1017/S0305004100027237 [36] Dorit Aharonov. ``A simple proof that Toffoli and Hadamard are quantum universal'' (2003). arXiv:quant-ph/0301040. arXiv:quant-ph/0301040 [37] Yasar Y Atas, Eugene Bogomolny, Olivier Giraud, and Guillame Roux. ``Distribution of the ratio of consecutive level spacings in random matrix ensembles''. Physical review letters 110, 084101 (2013). https://doi.org/10.1103/PhysRevLett.110.084101 [38] Vladimir Alexandrovich Marčenko and Leonid Andreevich Pastur. ``Distribution of eigenvalues for some sets of random matrices''. Matematicheskii Sbornik 114, 507–536 (1967). https://doi.org/10.1070/SM1967v001n04ABEH001994 [39] Benoît Collins and Ion Nechita. ``Random matrix techniques in quantum information theory''. Journal of Mathematical Physics 57, 015215 (2015). https://doi.org/10.1063/1.4936880 [40] Celine Nadal, Satya N. Majumdar, and Massimo Vergassola. ``Statistical distribution of quantum entanglement for a random bipartite state''. Journal of Statistical Physics 142, 403–438 (2011). https://doi.org/10.1007/s10955-010-0108-4 [41] Dan Voiculescu. ``Limit laws for random matrices and free products''. Inventiones mathematicae 104, 201–220 (1991). https://doi.org/10.1007/BF01245072 [42] Adina Roxana Feier. ``Methods of proof in random matrix theory''. Volume 9. Harvard University. (2012). url: https://www.math.harvard.edu/media/feier.pdf. https://www.math.harvard.edu/media/feier.pdf [43] Dénes Petz and Júlia Réffy. ``On asymptotics of large Haar distributed unitary matrices''.
Periodica Mathematica Hungarica 49, 103–117 (2004). https://doi.org/10.1023/B:MAHU.0000040542.56072.ab [44] Karol Zyczkowski and Hans-Jürgen Sommers. ``Truncations of random unitary matrices''. Journal of Physics A: Mathematical and General 33, 2045–2057 (2000). https://doi.org/10.1088/0305-4470/33/10/307 [45] Jean Ginibre. ``Statistical ensembles of complex, quaternion, and real matrices''. Journal of Mathematical Physics 6, 440–449 (1965). https://doi.org/10.1063/1.1704292 [46] Alice Guionnet. ``Bernoulli random matrices'' (2021). arXiv:2112.05506. arXiv:2112.05506 [47] A. Khorunzhy and V. Vengerovsky. ``On asymptotic solvability of random graph's Laplacians'' (2000). arXiv:math-ph/0009028. arXiv:math-ph/0009028 [48] Noga Alon and Joel H Spencer. ``The probabilistic method''. John Wiley & Sons. (2015). https://doi.org/10.1002/0471722154 [49] Don Coppersmith and Edna Grossman. ``Generators for certain alternating groups with applications to cryptography''. SIAM Journal on Applied Mathematics 29, 624–627 (1975). https://doi.org/10.1137/0129051 [50] Neil Dowling, Kavan Modi, and Gregory A. L. White. ``Bridging entanglement and magic resources within operator space''.
Physical Review Letters 135 (2025). https://doi.org/10.1103/c7k1-xcwy [51] Calvin Bakker and Wout Merbis. ``Operator entanglement growth quantifies complexity of cellular automata''.
In International Conference on Computational Science. Pages 33–47. Springer (2024). https://doi.org/10.1007/978-3-031-63749-0_3 [52] Tony Metger, Alexander Poremba, Makrand Sinha, and Henry Yuen. ``Simple constructions of linear-depth t-designs and pseudorandom unitaries'' (2024). arXiv:2404.12647. arXiv:2404.12647 [53] Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G.S.L. Brandão, and Patrick Hayden. ``Efficient unitary designs from random sums and permutations''. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). Page 476–484. IEEE (2024). https://doi.org/10.1109/focs61266.2024.00037 [54] Benjamin McDonough. ``benmcdonough20/AutomataOperatorEntanglement''. https://doi.org/10.5281/zenodo.15615989 (2025). https://doi.org/10.5281/zenodo.15615989 [55] P. Erdös and A. Rényi. ``On the evolution of random graphs''. Pages 38–82.
Princeton University Press. Princeton (2006). [56] Charles Bordenave, Marc Lelarge, and Justin Salez. ``The rank of diluted random graphs''. The Annals of Probability 39 (2011). https://doi.org/10.1214/10-aop567 [57] Charles Bordenave, Arnab Sen, and Bálint Virág. ``Mean quantum percolation''. Journal of the European Mathematical Society 19, 3679–3707 (2017). https://doi.org/10.4171/jems/750 [58] Justin Salez. ``Every totally real algebraic integer is a tree eigenvalue''. Journal of Combinatorial Theory, Series B 111, 249–256 (2015). https://doi.org/10.1016/j.jctb.2014.09.001 [59] Eva-Maria Hainzl and Élie de Panafieu. ``Tree Walks and the Spectrum of Random Graphs''. In Cécile Mailler and Sebastian Wild, editors, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Volume 302 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). https://doi.org/10.4230/LIPIcs.AofA.2024.11 [60] Benoit Collins, Sho Matsumoto, and Jonathan Novak. ``The Weingarten calculus''. Notices of the American Mathematical Society 69, 1 (2022). https://doi.org/10.1090/noti2474Cited byCould not fetch Crossref cited-by data during last attempt 2026-03-05 10:43:37: Could not fetch cited-by data for 10.22331/q-2026-03-05-2012 from Crossref. This is normal if the DOI was registered recently. Could not fetch ADS cited-by data during last attempt 2026-03-05 10:43:38: No response from ADS or unable to decode the received json data when getting the list of citing works.This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.
