Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Spectral properties versus magic generation in T-doped random Clifford circuits

Dominik Szombathy1,2,*, Angelo Valli1,3,4, Cătălin Paşcu Moca3,5, János Asbóth1,4,6, Lóránt Farkas2, Tibor Rakovszky1,7, and Gergely Zaránd1,3,†

  • *Contact author: szombathy.dominik@edu.bme.hu
  • †Contact author: zarand.gergely.attila@ttk.bme.hu

Phys. Rev. Research 7, 043080 – Published 20 October, 2025

DOI: https://doi.org/10.1103/557f-6tpb

Abstract

We study the emergence of complexity in deep random N-qubit T-gate-doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer Rényi entropy distribution and the nonstabilizing power of the circuit. For pure (undoped) Clifford circuits, a unique periodic orbit structure in the space of Pauli strings implies peculiar spectral correlations and level statistics with large degeneracies. T-gate doping induces an exponentially fast transition to chaotic behavior, described by random matrix theory. We compare these complexity indicators with magic generation properties of the Clifford +T ensemble, and determine the distribution of magic, as well as the average nonstabilizing power of the quantum circuit ensemble. In the dilute limit, NT≪N, magic generation is governed by single-qubit behavior. Magic is generated in approximate quanta, increases approximately linearly with the number of T gates, NT, and displays a discrete distribution for small NT. At NT≈N, the distribution becomes quasicontinuous, and for NT≫N, it converges to that of Haar-random unitaries, and averages to a finite magic density, m2, limN→∞〈m2〉Haar=1. This is in contrast to the spectral transition, where O(1) T gates suffice to remove spectral degeneracies and to induce a transition to chaotic behavior in the thermodynamic limit. Magic is therefore a more sensitive indicator of complexity.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (63)

  1. G. Jaeger, Quantum Information: An Overview (Springer New York, NY 2007).
  2. E. Chitambar and G. Gour, Quantum resource theories, Rev. Mod. Phys. 91, 025001 (2019).
  3. R. Jozsa and N. Linden, On the role of entanglement in quantum-computational speed-up, Proc. R. Soc. Lond. A 459, 2011 (2003).
  4. G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91, 147902 (2003).
  5. D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A 57, 127 (1998).
  6. S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).
  7. A. Nahum, J. Ruhman, S. Vijay, and J. Haah, Quantum entanglement growth under random unitary dynamics, Phys. Rev. X 7, 031016 (2017).
  8. H. Kim and D. A. Huse, Ballistic spreading of entanglement in a diffusive nonintegrable system, Phys. Rev. Lett. 111, 127205 (2013).
  9. A. Chandran and C. Laumann, Semiclassical limit for the many-body localization transition, Phys. Rev. B 92, 024301 (2015).
  10. M. Žnidarič, Entanglement growth in diffusive systems, Commun. Phys. 3, 100 (2020).
  11. C. W. von Keyserlingk, T. Rakovszky, F. Pollmann, and S. L. Sondhi, Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws, Phys. Rev. X 8, 021013 (2018).
  12. V. Veitch, S. H. Mousavian, D. Gottesman, and J. Emerson, The resource theory of stabilizer quantum computation, New J. Phys. 16, 013009 (2014).
  13. M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Phys. Rev. Lett. 118, 090501 (2017).
  14. M. Heinrich and D. Gross, Robustness of magic and symmetries of the stabiliser polytope, Quantum 3, 132 (2019).
  15. X. Wang, M. M. Wilde, and Y. Su, Quantifying the magic of quantum channels, New J. Phys. 21, 103002 (2019).
  16. X. Wang, M. M. Wilde, and Y. Su, Efficiently computable bounds for magic state distillation, Phys. Rev. Lett. 124, 090505 (2020).
  17. M. Beverland, E. Campbell, M. Howard, and V. Kliuchnikov, Lower bounds on the non-Clifford resources for quantum computations, Quantum Sci. Technol. 5, 035009 (2020).
  18. Z.-W. Liu and A. Winter, Many-body quantum magic, PRX Quantum 3, 020333 (2022).
  19. L. Leone, S. F. Oliviero, and A. Hamma, Stabilizer Rényi entropy, Phys. Rev. Lett. 128, 050402 (2022).
  20. S. F. E. Oliviero, L. Leone, A. Hamma, and S. Lloyd, Measuring magic on a quantum processor, npj Quantum Inf. 8, 148 (2022).
  21. D. Rattacaso, L. Leone, S. F. E. Oliviero, and A. Hamma, Stabilizer entropy dynamics after a quantum quench, Phys. Rev. A 108, 042407 (2023).
  22. T. Haug and L. Piroli, Quantifying nonstabilizerness of matrix product states, Phys. Rev. B 107, 035148 (2023).
  23. G. Lami and M. Collura, Nonstabilizerness via perfect Pauli sampling of matrix product states, Phys. Rev. Lett. 131, 180401 (2023).
  24. M. Bejan, C. McLauchlan, and B. Béri, Dynamical magic transitions in monitored Clifford+T circuits, PRX Quantum 5, 030332 (2024).
  25. T. Haug, S. Lee, and M. Kim, Efficient quantum algorithms for stabilizer entropies, Phys. Rev. Lett. 132, 240602 (2024).
  26. P. S. Tarabunga, E. Tirrito, M. C. Bañuls, and M. Dalmonte, Nonstabilizerness via matrix product states in the Pauli basis, Phys. Rev. Lett. 133, 010601 (2024).
  27. P. Niroula, C. D. White, Q. Wang, S. Johri, D. Zhu, C. Monroe, C. Noel, and M. J. Gullans, Phase transition in magic with random quantum circuits, Nat. Phys. 20, 1786 (2024).
  28. X. Turkeshi, Coherent errors make magic, Nat. Phys. 20, 1696 (2024).
  29. C. Gidney, N. Shutty, and C. Jones, Magic state cultivation: Growing T states as cheap as CNOT gates, arXiv:2409.17595.
  30. G. E. Fux, B. Béri, R. Fazio, and E. Tirrito, Disentangling unitary dynamics with classically simulable quantum circuits, arXiv:2410.09001.
  31. X. Turkeshi, E. Tirrito, and P. Sierant, Magic spreading in random quantum circuits, Nat. Commun. 16, 2575 (2025).
  32. S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Phys. Rev. Lett. 116, 250501 (2016).
  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, Commun. Math. Phys. 397, 995 (2023).
  34. S. Zhou, Z. Yang, A. Hamma, and C. Chamon, Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics, SciPost Phys. 9, 087 (2020).
  35. S. True and A. Hamma, Transitions in entanglement complexity in random circuits, Quantum 6, 818 (2022).
  36. J. Pöschel, A lecture on the classical kam theorem, in Smooth Ergodic Theory and Its Applications (Seattle, WA, 1999), Proceedings of Symposia in Pure Mathematics (American Mathematical Society, Providence, RI, 2001), Vol. 69, pp. 707–732.
  37. C. Vairogs and B. Yan, Extracting randomness from magic quantum states, Phys. Rev. Res. 7, L022069 (2025).
  38. Y. Zhang and Y. Gu, Quantum magic dynamics in random circuits, arXiv:2410.21128.
  39. Y. Wang and Y. Li, Stabilizer Rényi entropy on qudits, Quantum Info. Proc. 22, 444 (2023).
  40. T. Haug and L. Piroli, Stabilizer entropies and nonstabilizerness monotones, Quantum 7, 1092 (2023).
  41. T. Haug, L. Aolita, and M. S. Kim, Probing quantum complexity via universal saturation of stabilizer entropies, Quantum 9, 1801 (2025).
  42. M. Mezei and D. Stanford, On entanglement spreading in chaotic systems, J. High Energy Phys. 05 (2017) 065 .
  43. S. Bravyi and D. Maslov, Hadamard-free circuits expose the structure of the Clifford group, IEEE Trans. Inf. Theory 67, 4546 (2021).
  44. E. Van Den Berg, A simple method for sampling random Clifford operators, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, Broomfield, CO, USA, 2021), Vol. 8, pp. 54–59.
  45. S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005).
  46. M. Hinsche, M. Ioannou, A. Nietner, J. Haferkamp, Y. Quek, D. Hangleiter, J.-P. Seifert, J. Eisert, and R. Sweke, One T gate makes distribution learning hard, Phys. Rev. Lett. 130, 240602 (2023).
  47. P. Deift and D. Gioev, Random Matrix Theory: Invariant Ensembles and Universality (American Mathematical Society, 2009), Vol. 18.
  48. H. Gharibyan, M. Hanada, S. H. Shenker, and M. Tezuka, Onset of random matrix behavior in scrambling systems, J. High Energy Phys. 07 (2018) 124.
  49. P. J. Forrester, A review of exact results for fluctuation formulas in random matrix theory, Probab. Surv. 20, 170 (2023).
  50. M. Carmeli, Statistical theory of energy levels and random matrices in physics, J. Stat. Phys. 10, 259 (1974).
  51. K. Zyczkowski and M. Kus, Random unitary matrices, J. Phys. A: Math. Gen. 27, 4235 (1994).
  52. J. Huang, X. Qian, and M. Qin, Nonstabilizerness entanglement entropy: A measure of hardness in the classical simulation of quantum many-body systems with tensor network states, Phys. Rev. A 112, 012425 (2025).
  53. H. Anwar, E. T. Campbell, and D. E. Browne, Qutrit magic state distillation, New J. Phys. 14, 063006 (2012).
  54. S. Virmani, S. F. Huelga, and M. B. Plenio, Classical simulability, entanglement breaking, and quantum computation thresholds, Phys. Rev. A 71, 042328 (2005).
  55. S. Cepollaro, G. Chirco, G. Cuffaro, G. Esposito, and A. Hamma, Stabilizer entropy of quantum tetrahedra, Phys. Rev. D 109, 126008 (2024).
  56. A. Krishna and J.-P. Tillich, Towards low overhead magic state distillation, Phys. Rev. Lett. 123, 070507 (2019).
  57. N. Bao, C. Cao, and V. P. Su, Magic state distillation from entangled states, Phys. Rev. A 105, 022602 (2022).
  58. X. Li and S. Luo, Optimality of T-gate for generating magic resource, Commun. Theor. Phys. 75, 045101 (2023).
  59. D. Szombathy, A. Valli, C. P. Moca, L. Farkas, and G. Zaránd, Independent stabilizer Rényi entropy and entanglement fluctuations in random unitary circuits, Phys. Rev. Res. 7, 043072 (2025).
  60. A. Y. Kitaev, Quantum computations: Algorithms and error correction, Russ. Math. Surv. 52, 1191 (1997).
  61. H. Zhu, Multiqubit Clifford groups are unitary 3-designs, Phys. Rev. A 96, 062336 (2017).
  62. D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, Quantum 3, 128 (2019).
  63. D. Litinski, Magic state distillation: Not as costly as you think, Quantum 3, 205 (2019).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation