Random quantum circuits are approximate unitary $t$-designs in depth $O\left(nt^{5+o(1)}\right)$

Jonas Haferkamp

doi:10.22331/q-2022-09-08-795

Random quantum circuits are approximate unitary $t$-designs in depth $O\left(nt^{5+o(1)}\right)$

Jonas Haferkamp

Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Germany

Published:	2022-09-08, volume 6, page 795
Eprint:	arXiv:2203.16571v3
Doi:	https://doi.org/10.22331/q-2022-09-08-795
Citation:	Quantum 6, 795 (2022).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary $t$-designs. Unitary $t$-designs are probability distributions that mimic Haar randomness up to $t$th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth $O(n t^{10.5})$ are approximate unitary $t$-designs. In this work, we revisit this argument, which lower bounds the spectral gap of moment operators for local random quantum circuits by $\Omega(n^{-1}t^{-9.5})$. We improve this lower bound to $\Omega(n^{-1}t^{-4-o(1)})$, where the $o(1)$ term goes to $0$ as $t\to\infty$. A direct consequence of this scaling is that random quantum circuits generate approximate unitary $t$-designs in depth $O(nt^{5+o(1)})$. Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group. As an auxiliary result, we prove fast convergence to the Haar measure for random Clifford unitaries interleaved with Haar random single qubit unitaries.

► BibTeX data

@article{Haferkamp2022randomquantum,
  doi = {10.22331/q-2022-09-08-795},
  url = {https://doi.org/10.22331/q-2022-09-08-795},
  title = {Random quantum circuits are approximate unitary {$t$}-designs in depth {$O\left(nt^{5+o(1)}\right)$}},
  author = {Haferkamp, Jonas},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {6},
  pages = {795},
  month = sep,
  year = {2022}
}

► References

[1] S. Aaronson and A. Arkhipov. The computational complexity of linear optics. Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 333–342, 2011. doi:10.1364/QIM.2014.QTh1A.2.
https://doi.org/10.1364/QIM.2014.QTh1A.2

[2] S. Aaronson and D. Gottesman. Improved simulation of stabilizer circuits. Physical Review A, 70(5):052328, 2004. doi:10.1103/PhysRevA.70.052328.
https://doi.org/10.1103/PhysRevA.70.052328

[3] A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter. The mother of all protocols: restructuring quantum information's family tree. Proc. R. Soc. A, 465:2537, 2009. doi:10.1098/rspa.2009.0202.
https://doi.org/10.1098/rspa.2009.0202

[4] D. Aharonov, I. Arad, Z. Landau, and U. Vazirani. The Detectability Lemma and Quantum Gap Amplification. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC ’09, page 417, 2009. doi:10.1145/1536414.1536472.
https://doi.org/10.1145/1536414.1536472

[5] D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 20–30, 1998. doi:10.1145/276698.276708.
https://doi.org/10.1145/276698.276708

[6] A. Ambainis and J. Emerson. Quantum t-designs: t-wise independence in the quantum world. In Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on, pages 129–140, June 2007. doi:10.1109/CCC.2007.26.
https://doi.org/10.1109/CCC.2007.26

[7] A. Anshu, I. Arad, and T. Vidick. Simple proof of the detectability lemma and spectral gap amplification. Phys. Rev. B, 93:205142, 2016. doi:10.1103/PhysRevB.93.205142.
https://doi.org/10.1103/PhysRevB.93.205142

[8] J. Bourgain and A. Gamburd. A spectral gap theorem in su $(d) $. Journal of the European Mathematical Society, 14(5):1455–1511, 2012. doi:10.4171/JEMS/337.
https://doi.org/10.4171/JEMS/337

[9] F. G. S. L. Brandão, A. W. Harrow, and M. Horodecki. Local Random Quantum Circuits are Approximate Polynomial-Designs. Commun. Math. Phys., 346:397, 2016. doi:10.1007/s00220-016-2706-8.
https://doi.org/10.1007/s00220-016-2706-8

[10] F. G. S. L. Brandao, A. W. Harrow, and M. Horodecki. Efficient quantum pseudorandomness. Physical review letters, 116(17):170502, 2016. doi:10.1103/PhysRevLett.116.170502.
https://doi.org/10.1103/PhysRevLett.116.170502

[11] Fernando GSL Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, and John Preskill. Models of quantum complexity growth. PRX Quantum, 2(3):030316, 2021. doi:10.1103/PRXQuantum.2.030316.
https://doi.org/10.1103/PRXQuantum.2.030316

[12] S. Bravyi and D. Maslov. Hadamard-free circuits expose the structure of the Clifford group. IEEE Transactions on Information Theory, 67(7):4546–4563, 2021. doi:10.1109/TIT.2021.3081415.
https://doi.org/10.1109/TIT.2021.3081415

[13] A. R. Brown and L. Susskind. Second law of quantum complexity. Phys. Rev., D97:086015, 2018. doi:10.1103/PhysRevD.97.086015.
https://doi.org/10.1103/PhysRevD.97.086015

[14] R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing in Markov chains. In Proceedings 38th Annual Symposium on Foundations of Computer Science, page 223, 1997. doi:10.1109/SFCS.1997.646111.
https://doi.org/10.1109/SFCS.1997.646111

[15] I. Chatzigeorgiou. Bounds on the Lambert function and their application to the outage analysis of user cooperation. IEEE Communications Letters, 17(8):1505–1508, 2013. doi:10.1109/LCOMM.2013.070113.130972.
https://doi.org/10.1109/LCOMM.2013.070113.130972

[16] R. Cleve, D. Leung, L. Liu, and C. Wang. Near-linear constructions of exact unitary 2-designs. Quant. Inf. Comp., 16:0721–0756, 2015. doi:10.26421/QIC16.9-10-1.
https://doi.org/10.26421/QIC16.9-10-1

[17] C. Dankert. Efficient simulation of random quantum states and operators, 2005. doi:10.48550/arXiv.quant-ph/0512217.
https://doi.org/10.48550/arXiv.quant-ph/0512217
arXiv:quant-ph/0512217

[18] C. Dankert, R. Cleve, J. Emerson, and E. Livine. Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev., A80:012304, 2009. doi:10.1103/PhysRevA.80.012304.
https://doi.org/10.1103/PhysRevA.80.012304

[19] P. Diaconis and L. Saloff-Coste. Comparison techniques for random walk on finite groups. The Annals of Probability, pages 2131–2156, 1993. doi:10.1214/aoap/1177005359.
https://doi.org/10.1214/aoap/1177005359

[20] D. P DiVincenzo, D. W. Leung, and B. M. Terhal. Quantum data hiding. IEEE, Trans. Inf Theory, 48:3580–599, 2002. doi:10.48550/arXiv.quant-ph/0103098.
https://doi.org/10.48550/arXiv.quant-ph/0103098
arXiv:quant-ph/0103098

[21] J. Emerson, R. Alicki, and K. Życzkowski. Scalable noise estimation with random unitary operators. J. Opt. B: Quantum Semiclass. Opt., 7(10):S347, 2005. doi:10.1088/1464-4266/7/10/021.
https://doi.org/10.1088/1464-4266/7/10/021

[22] J. Gao. Quantum union bounds for sequential projective measurements. Phys. Rev. A, 92:052331, 2015. arXiv:1410.5688, doi:10.1103/PhysRevA.92.052331.
https://doi.org/10.1103/PhysRevA.92.052331
arXiv:1410.5688

[23] D. Gross, K. Audenaert, and J. Eisert. Evenly distributed unitaries: On the structure of unitary designs. J. Math. Phys., 48:052104, 2007. doi:10.1063/1.2716992.
https://doi.org/10.1063/1.2716992

[24] D. Gross, S. Nezami, and M. Walter. Schur–Weyl duality for the Clifford group with applications: Property testing, a robust Hudson theorem, and de Finetti representations. Communications in Mathematical Physics, 385(3):1325–1393, 2021. doi:10.1007/s00220-021-04118-7.
https://doi.org/10.1007/s00220-021-04118-7

[25] J. Haferkamp, P. Faist, N. B. T. Kothakonda, J. Eisert, and N. Yunger Halpern. Linear growth of quantum circuit complexity. Nature Physics, 18:528–532, 2021. doi:10.1038/s41567-022-01539-6.
https://doi.org/10.1038/s41567-022-01539-6

[26] J. Haferkamp and N. Hunter-Jones. Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions. Physical Review A, 104(2):022417, 2021. doi:10.1103/PhysRevA.104.022417.
https://doi.org/10.1103/PhysRevA.104.022417

[27] J. Haferkamp, F. Montealegre-Mora, M. Heinrich, J. Eisert, D. Gross, and I. Roth. Quantum homeopathy works: Efficient unitary designs with a system-size independent number of non-Clifford gates. 2020. doi:10.48550/arXiv.2002.09524.
https://doi.org/10.48550/arXiv.2002.09524

[28] A. Harrow and S. Mehraban. Approximate unitary $ t $-designs by short random quantum circuits using nearest-neighbor and long-range gates. arXiv preprint arXiv:1809.06957, 2018. doi:10.48550/arXiv.1809.06957.
https://doi.org/10.48550/arXiv.1809.06957
arXiv:1809.06957

[29] A. W. Harrow and R. A. Low. Random quantum circuits are approximate 2-designs. Communications in Mathematical Physics, 291(1):257–302, 2009. doi:10.1007/s00220-009-0873-6.
https://doi.org/10.1007/s00220-009-0873-6

[30] P. Hayden and J. Preskill. Black holes as mirrors: Quantum information in random subsystems. JHEP, 09:120, 2007. doi:10.1088/1126-6708/2007/09/120.
https://doi.org/10.1088/1126-6708/2007/09/120

[31] N. Hunter-Jones. Unitary designs from statistical mechanics in random quantum circuits. 2019. arXiv:1905.12053.
arXiv:1905.12053

[32] T. Jiang. How many entries of a typical orthogonal matrix can be approximated by independent normals? The Annals of Probability, 34(4):1497–1529, 2006. doi:10.1214/009117906000000205.
https://doi.org/10.1214/009117906000000205

[33] E. Knill. Approximation by quantum circuits. arXiv preprint, 1995. doi:10.48550/arXiv.quant-ph/9508006.
https://doi.org/10.48550/arXiv.quant-ph/9508006
arXiv:quant-ph/9508006

[34] E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland. Randomized benchmarking of quantum gates. Phys. Rev. A, 77:012307, 2008. doi:10.1103/PhysRevA.77.012307.
https://doi.org/10.1103/PhysRevA.77.012307

[35] L. Leone, S. F. E. Oliviero, Y. Zhou, and A. Hamma. Quantum chaos is quantum. Quantum, 5:453, 2021. doi:10.22331/q-2021-05-04-453.
https://doi.org/10.22331/q-2021-05-04-453

[36] R. A. Low. Pseudo-randomness and Learning in Quantum Computation. arXiv preprint, 2010. PhD Thesis, 2010. doi:10.48550/arXiv.1006.5227.
https://doi.org/10.48550/arXiv.1006.5227

[37] E. Magesan, J. M. Gambetta, and J. Emerson. Characterizing quantum gates via randomized benchmarking. Phys. Rev. A, 85:042311, 2012. arXiv:1109.6887, doi:10.1103/PhysRevA.85.042311.
https://doi.org/10.1103/PhysRevA.85.042311
arXiv:1109.6887

[38] R. Mezher, J. Ghalbouni, J. Dgheim, and D. Markham. Efficient quantum pseudorandomness with simple graph states. Physical Review A, 97(2):022333, 2018. doi:10.1103/PhysRevA.97.022333.
https://doi.org/10.1103/PhysRevA.97.022333

[39] F. Montealegre-Mora and D. Gross. Rank-deficient representations in the theta correspondence over finite fields arise from quantum codes. Representation Theory of the American Mathematical Society, 25(8):193–223, 2021. doi:10.1090/ert/563.
https://doi.org/10.1090/ert/563

[40] F. Montealegre-Mora and D. Gross. Duality theory for Clifford tensor powers. arXiv preprint, 2022. doi:10.48550/arXiv.2208.01688.
https://doi.org/10.48550/arXiv.2208.01688

[41] B. Nachtergaele. The spectral gap for some spin chains with discrete symmetry breaking. Commun. Math. Phys., 175:565, 1996. doi:10.1007/BF02099509.
https://doi.org/10.1007/BF02099509

[42] Y. Nakata, C. Hirche, M. Koashi, and A. Winter. Efficient quantum pseudorandomness with nearly time-independent hamiltonian dynamics. Physical Review X, 7(2):021006, 2017. doi:10.1103/PhysRevX.7.021006.
https://doi.org/10.1103/PhysRevX.7.021006

[43] G. Nebe, E. M. Rains, and N. J. A Sloane. The invariants of the Clifford groups. arXiv preprint, 2001. doi:10.48550/arXiv.math/0001038.
https://doi.org/10.48550/arXiv.math/0001038

[44] R. I. Oliveira. On the convergence to equilibrium of Kac's random walk on matrices. Ann. Appl. Probab., 19:1200, 2009. doi:10.1214/08-AAP550.
https://doi.org/10.1214/08-AAP550

[45] S. F. E. Oliviero, L. Leone, and A. Hamma. Transitions in entanglement complexity in random quantum circuits by measurements. Physics Letters A, 418:127721, 2021. doi:10.1016/j.physleta.2021.127721.
https://doi.org/10.1016/j.physleta.2021.127721

[46] E. Onorati, O. Buerschaper, M. Kliesch, W. Brown, A. H. Werner, and J. Eisert. Mixing properties of stochastic quantum Hamiltonians. Communications in Mathematical Physics, 355(3):905–947, 2017. doi:10.1007/s00220-017-2950-6.
https://doi.org/10.1007/s00220-017-2950-6

[47] M. Oszmaniec, A. Sawicki, and M. Horodecki. Epsilon-nets, unitary designs and random quantum circuits. IEEE Transactions on Information Theory, 2021. doi:10.1109/TIT.2021.3128110.
https://doi.org/10.1109/TIT.2021.3128110

[48] L. Susskind. Black Holes and Complexity Classes. arXiv preprint, 2018. doi:10.48550/arXiv.1802.02175.
https://doi.org/10.48550/arXiv.1802.02175

[49] P. P. Varjú. Random walks in compact groups. Doc. Math., 18:1137–1175, 2013. doi:10.48550/arXiv.1209.1745.
https://doi.org/10.48550/arXiv.1209.1745

[50] J. Watrous. The theory of quantum information. Cambridge university press, 2018. doi:10.1017/9781316848142.
https://doi.org/10.1017/9781316848142

[51] Z. Webb. The Clifford group forms a unitary 3-design. Quantum Info. Comput., 16:1379, 2016. doi:10.5555/3179439.3179447.
https://doi.org/10.5555/3179439.3179447

[52] S. Zhou, Z. Yang, A. Hamma, and C. Chamon. Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics. SciPost Physics, 9(6):087, 2020.
arXiv:1906.01079v1

[53] H. Zhu. Multiqubit clifford groups are unitary 3-designs. Phys. Rev. A, 96:062336, 2017. doi:10.1103/PhysRevA.96.062336.
https://doi.org/10.1103/PhysRevA.96.062336

Cited by

[1] Stefano Baiguera, Vijay Balasubramanian, Pawel Caputa, Shira Chapman, Jonas Haferkamp, Michal P. Heller, and Nicole Yunger Halpern, "Quantum complexity in gravity, quantum field theory, and quantum information science", Physics Reports 1159, 1 (2026).

[2] Alexander Nietner, Marios Ioannou, Ryan Sweke, Richard Kueng, Jens Eisert, Marcel Hinsche, and Jonas Haferkamp, "On the average-case complexity of learning output distributions of quantum circuits", Quantum 9, 1883 (2025).

[3] Shao-Kai Jian, Gregory Bentsen, and Brian Swingle, "Linear growth of circuit complexity from Brownian dynamics", Journal of High Energy Physics 2023 8, 190 (2023).

[4] Leo Joon Il Moon, Mandar M Sohoni, Michael A Shimizu, Praveen Viswanathan, Kevin Zhang, Eun-Ah Kim, and Peter L McMahon, "Hamiltonian-reconstruction distance as a success metric for the variational quantum eigensolver", Quantum Science and Technology 11 2, 025035 (2026).

[5] Y S Teo, S U Shringarpure, S Cho, and H Jeong, "Linear-optical protocols for mitigating and suppressing noise in bosonic systems", Quantum Science and Technology 10 3, 035003 (2025).

[6] Eric R. Anschuetz and Bobak T. Kiani, "Quantum variational algorithms are swamped with traps", Nature Communications 13 1, 7760 (2022).

[7] Marcell D. Kovács, Christopher J. Turner, Lluis Masanes, and Arijeet Pal, "Operator space fragmentation in perturbed Floquet-Clifford circuits", Quantum 10, 2107 (2026).

[8] Tobias Haug, Soovin Lee, and M. S. Kim, "Efficient Quantum Algorithms for Stabilizer Entropies", Physical Review Letters 132 24, 240602 (2024).

[9] Keerthi Kumaran, Manas Sajjan, Sangchul Oh, and Sabre Kais, "Random projection using random quantum circuits", Physical Review Research 6 1, 013010 (2024).

[10] Markus Heinrich, Jonas Haferkamp, Ingo Roth, and Jonas Helsen, "Anticoncentration Is (Almost) All You Need", Physical Review Letters 137 5, 050601 (2026).

[11] Bruno Bertini, Katja Klobas, Pavel Kos, and Daniel Malz, "Quantum and Classical Dynamics with Random Permutation Circuits", Physical Review X 15 1, 011015 (2025).

[12] Samuel Thomas Punch and Krishnendu Guha, 2026 39th International Conference on VLSI Design & 25th International Conference on Embedded Systems (VLSID) 299 (2026) ISBN:979-8-3315-9040-6.

[13] Daniel Belkin, James Allen, Soumik Ghosh, Christopher Kang, Sophia Lin, James Sud, Frederic T. Chong, Bill Fefferman, and Bryan K. Clark, "Approximate t -Designs in Generic Circuit Architectures", PRX Quantum 5 4, 040344 (2024).

[14] Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G.S.L. Brandão, and Patrick Hayden, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) 476 (2024) ISBN:979-8-3315-1674-1.

[15] Marco Sciorilli, Lucas Borges, Taylor L. Patti, Diego García-Martín, Giancarlo Camilo, Anima Anandkumar, and Leandro Aolita, "Towards large-scale quantum optimization solvers with few qubits", Nature Communications 16 1, 476 (2025).

[16] Sumner N. Hearth, Michael O. Flynn, Anushya Chandran, and Chris R. Laumann, "Unitary k -Designs from Random Number-Conserving Quantum Circuits", Physical Review X 15 2, 021022 (2025).

[17] Sujay Kazi, Martín Larocca, Marco Farinati, Patrick J. Coles, M. Cerezo, and Robert Zeier, "Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras", PRX Quantum 6 4, 040345 (2025).

[18] Yuxuan Du, Xinbiao Wang, Naixu Guo, Zhan Yu, Yang Qian, Kaining Zhang, Min-Hsiu Hsieh, Patrick Rebentrost, and Dacheng Tao, A Gentle Introduction to Quantum Machine Learning 111 (2025) ISBN:978-981-95-1283-6.

[19] Bruno Bertini, Pieter W. Claeys, and Tomaž Prosen, "Exactly solvable quantum many-body dynamics from space-time duality", Reviews of Modern Physics 98 2, 025001 (2026).

[20] Yuzhen Zhang, Sagar Vijay, Yingfei Gu, and Yimu Bao, "Designs from Magic-Augmented Clifford Circuits", PRX Quantum 7 1, 010344 (2026).

[21] Emanuel Dallas, Faidon Andreadakis, and Paolo Zanardi, "Butterfly effect in encoding-decoding quantum circuits", Physical Review A 113 4, 042428 (2026).

[22] Piotr Borodako and Adam Sawicki, "The high-dimension limit of characters of compact reductive Lie groups and restrictions on the production of quantum randomness", Journal of Physics A: Mathematical and Theoretical 59 28, 285207 (2026).

[23] Ágoston Kaposi, Zoltán Kolarovszki, Adrian Solymos, and Zoltán Zimborás, "Generalized group designs: constructing novel unitary 2-, 3- and 4-designs", Quantum 10, 2008 (2026).

[24] Jeongwan Haah, Yunchao Liu, and Xinyu Tan, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) 463 (2024) ISBN:979-8-3315-1674-1.

[25] Wonjun Lee, Minki Hhan, Gil Young Cho, and Hyukjoon Kwon, "Shallow Quantum Circuit for Generating Extremely Low-Entangled Approximate State Designs", Physical Review Letters 136 15, 150603 (2026).

[26] Pablo Bermejo, Paolo Braccia, Manuel S. Rudolph, Zoë Holmes, Lukasz Cincio, and M. Cerezo, "Quantum Convolutional Neural Networks are Effectively Classically Simulable", PRX Quantum 7 2, 020304 (2026).

[27] Tobias Haug and Lorenzo Piroli, "Quantifying nonstabilizerness of matrix product states", Physical Review B 107 3, 035148 (2023).

[28] Klée Pollock, Peter P. Orth, and Thomas Iadecola, "Variational microcanonical estimator", Physical Review Research 5 3, 033224 (2023).

[29] Filipa C R Peres, Rafael Wagner, and Ernesto F Galvão, "Non-stabilizerness and entanglement from cat-state injection", New Journal of Physics 26 1, 013051 (2024).

[30] Scott Aaronson and Shih-Han Hung, Proceedings of the 55th Annual ACM Symposium on Theory of Computing 933 (2023) ISBN:9781450399135.

[31] Paolo Braccia, Pablo Bermejo, Lukasz Cincio, and M. Cerezo, "Computing exact moments of local random quantum circuits via tensor networks", Quantum Machine Intelligence 6 2, 54 (2024).

[32] Shiyong Guo, Martin Sasieta, and Brian Swingle, "Complexity is not enough for randomness", SciPost Physics 17 6, 151 (2024).

[33] Satwik Kundu and Swaroop Ghosh, Proceedings of the Great Lakes Symposium on VLSI 2025 273 (2025) ISBN:9798400714962.

[34] Felipe Montealegre-Mora and David Gross, "Duality theory for Clifford tensor powers", Journal of Mathematical Physics 66 9, 092202 (2025).

[35] Yanglin Hu and Marco Tomamichel, "Fundamental limits on quantum cloning from the no-signaling principle", Physical Review A 109 2, 022221 (2024).

[36] Xhek Turkeshi, Anatoly Dymarsky, and Piotr Sierant, "Pauli spectrum and nonstabilizerness of typical quantum many-body states", Physical Review B 111 5, 054301 (2025).

[37] Andi Gu, Lorenzo Leone, Soumik Ghosh, Jens Eisert, Susanne F. Yelin, and Yihui Quek, "Pseudomagic Quantum States", Physical Review Letters 132 21, 210602 (2024).

[38] Diego García-Martín, Paolo Braccia, and M Cerezo, "Architectures and random properties of symplectic quantum circuits", Quantum Science and Technology 11 1, 015012 (2026).

[39] Tony Metger, Alexander Poremba, Makrand Sinha, and Henry Yuen, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) 485 (2024) ISBN:979-8-3315-1674-1.

[40] Thomas Schuster, Jonas Haferkamp, and Hsin-Yuan Huang, "Random unitaries in extremely low depth", Science 389 6755, 92 (2025).

[41] Andrew E. Deneris, Pablo Bermejo, Paolo Braccia, Lukasz Cincio, and M. Cerezo, "Exact spectral gaps of random one-dimensional quantum circuits", Physical Review A 112 6, 062619 (2025).

[42] J. Montes, F. Borondo, and Gabriel G. Carlo, "Universal configuration for optimizing randomness generation in variational distributed quantum circuits", Physical Review A 113 3, 032610 (2026).

[43] Valentin Heyraud, Héloise Chomet, and Jules Tilly, "Unified framework for matchgate classical shadows", npj Quantum Information 11 1, 65 (2025).

[44] Antonio A. Mele, Glen B. Mbeng, Giuseppe E. Santoro, Mario Collura, and Pietro Torta, "Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz", Physical Review A 106 6, L060401 (2022).

[45] Piotr Wysocki, Jan Chwedeńczuk, and Marcin Płodzień, "Volume-Law Protection of Metrological Advantage", Physical Review Letters 137 3, 030801 (2026).

[46] Jeongwan Haah, Yunchao Liu, and Xinyu Tan, "Efficient Approximate Unitary Designs from Random Pauli Rotations", Communications in Mathematical Physics 406 12, 309 (2025).

[47] Piotr Dulian and Adam Sawicki, "A Random Matrix Model for Random Approximate t-Designs", IEEE Transactions on Information Theory 70 4, 2637 (2024).

[48] Jeongwan Haah, Robin Kothari, Ryan O’Donnell, and Ewin Tang, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) 363 (2023) ISBN:979-8-3503-1894-4.

[49] Anthony Munson, Naga Bhavya Teja Kothakonda, Jonas Haferkamp, Nicole Yunger Halpern, Jens Eisert, and Philippe Faist, "Complexity-Constrained Quantum Thermodynamics", PRX Quantum 6 1, 010346 (2025).

[50] M. Bilkis, M. Cerezo, Guillaume Verdon, Patrick J. Coles, and Lukasz Cincio, "A semi-agnostic ansatz with variable structure for variational quantum algorithms", Quantum Machine Intelligence 5 2, 43 (2023).

[51] Toshihiro Yada, Ryotaro Suzuki, Yosuke Mitsuhashi, and Nobuyuki Yoshioka, "Non-Haar Random Circuits form Unitary Designs as Fast as Haar Random Circuits", Physical Review Letters 136 3, 030401 (2026).

[52] Valentin Heyraud, Zejian Li, Kaelan Donatella, Alexandre Le Boité, and Cristiano Ciuti, "Efficient Estimation of Trainability for Variational Quantum Circuits", PRX Quantum 4 4, 040335 (2023).

[53] Michele Fava, Jorge Kurchan, and Silvia Pappalardi, "Designs via Free Probability", Physical Review X 15 1, 011031 (2025).

[54] Saeed Mehraban and Mehrdad Tahmasbi, Proceedings of the 56th Annual ACM Symposium on Theory of Computing 608 (2024) ISBN:9798400703836.

[55] Yi-Neng Zhou, Robin Löwenberg, and Julian Sonner, "Realizing Unitary k -Designs with a Single Quench", Physical Review Letters 136 22, 220403 (2026).

[56] Xhek Turkeshi, Marco Schirò, and Piotr Sierant, "Measuring nonstabilizerness via multifractal flatness", Physical Review A 108 4, 042408 (2023).

[57] Wai-Keong Mok, Tobias Haug, Adam L. Shaw, Manuel Endres, and John Preskill, "Optimal Conversion from Classical to Quantum Randomness via Quantum Chaos", Physical Review Letters 134 18, 180403 (2025).

[58] Prabhanjan Ananth, John Bostanci, Aditya Gulati, and Yao-Ting Lin, Lecture Notes in Computer Science 15607, 138 (2025) ISBN:978-3-031-91097-5.

[59] Felix Fritzsch and Pieter W. Claeys, "Free Probability in a Minimal Quantum Circuit Model", Physical Review X 16 3, 031027 (2026).

[60] Lorenzo Leone, Salvatore F.E. Oliviero, Alioscia Hamma, Jens Eisert, and Lennart Bittel, "Non-Clifford Cost of Random Unitaries", PRX Quantum 7 2, 020321 (2026).

[61] Cambyse Rouzé, Bolyai Society Mathematical Studies 29, 263 (2024) ISBN:978-3-031-50465-5.

[62] Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, and Matthias C. Caro, "Learning Quantum States and Unitaries of Bounded Gate Complexity", PRX Quantum 5 4, 040306 (2024).

[63] Yosuke Mitsuhashi, Ryotaro Suzuki, Tomohiro Soejima, and Nobuyuki Yoshioka, "Characterization of randomness in quantum circuits of continuous gate sets", Physical Review A 111 5, 052409 (2025).

[64] Yoshifumi Nakata, Yuki Takeuchi, Martin Kliesch, and Andrew Darmawan, "Computational Complexity of Unitary and State Design Properties", PRX Quantum 6 3, 030345 (2025).

[65] Xhek Turkeshi, Emanuele Tirrito, and Piotr Sierant, "Magic spreading in random quantum circuits", Nature Communications 16 1, 2575 (2025).

[66] Katja Klobas, Colin Rylands, and Bruno Bertini, "Translation symmetry restoration under random unitary dynamics", Physical Review B 111 14, L140304 (2025).

[67] David Aram Korbany, Michael J. Gullans, and Lorenzo Piroli, "Long-Range Nonstabilizerness and Phases of Matter", Physical Review Letters 135 16, 160404 (2025).

[68] Poetri Sonya Tarabunga, Martina Frau, Tobias Haug, Emanuele Tirrito, and Lorenzo Piroli, "A nonstabilizerness monotone from stabilizerness asymmetry", Quantum Science and Technology 10 4, 045026 (2025).

[69] Ryan O’Donnell, Rocco A. Servedio, and Pedro Paredes, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) 1240 (2023) ISBN:979-8-3503-1894-4.

[70] Victoria Mellor and Fahad Ahmad, "The Hamiltonian Pseudorandom Function: A Symmetric Encryption Primitive Grounded in Symplectic Geometry and Chaotic Dynamics", Quantum Reports 8 3, 62 (2026).

[71] Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, and Philippe Faist, "Quantum complexity phase transitions in monitored random circuits", Quantum 9, 1627 (2025).

[72] Soham Ghosh, Vladlen Galetsky, Pol Julià Farré, Christian Deppe, Roberto Ferrara, and Holger Boche, "Existential unforgeability in quantum authentication from quantum physical unclonable functions based on random von Neumann measurement", Physical Review Research 6 4, 043306 (2024).

[73] Anne Broadbent, Eric Culf, and Denis Rochette, "Optimal Untelegraphable Encryption and Implications for Uncloneable Encryption", Abstract_only IACR Communications in Cryptology 3 2, cc3-1-73 (2026).

[74] Antonio Anna Mele, "Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial", Quantum 8, 1340 (2024).

[75] Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, and Mingnan Zhao, Lecture Notes in Computer Science 15365, 3 (2025) ISBN:978-3-031-78016-5.

[76] Diego García-Martín, Martín Larocca, and M. Cerezo, "Quantum neural networks form Gaussian processes", Nature Physics 21 7, 1153 (2025).

[77] Yanglin Hu, Enrique Cervero-Martín, Elias Theil, Laura Mančinska, and Marco Tomamichel, "Sample-optimal and memory-efficient quantum state tomography", Physical Review A 113 5, 052446 (2026).

[78] Dominik Hangleiter and Jens Eisert, "Computational advantage of quantum random sampling", Reviews of Modern Physics 95 3, 035001 (2023).

[79] Asim Sharma and Avah Banerjee, 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) 142 (2025) ISBN:979-8-3315-5736-2.

[80] David Aram Korbany, Tyler D. Ellison, David T. Stephen, and Lorenzo Piroli, "Long-range nonstabilizerness of topologically encoded states from mutual information", arXiv:2605.22424, (2026).

[81] Lennart Bittel and Lorenzo Leone, "Adaptively Secure Unitary Designs with Constant Non-Clifford Cost", Physical Review Letters 136 21, 210802 (2026).

[82] Stefano Baiguera, Vijay Balasubramanian, Pawel Caputa, Shira Chapman, Jonas Haferkamp, Michal P. Heller, and Nicole Yunger Halpern, "Quantum complexity in gravity, quantum field theory, and quantum information science", arXiv:2503.10753, (2025).

[83] Yale Fan, Nicholas Hunter-Jones, Andreas Karch, and Shivan Mittal, "Sharp Transitions for Subsystem Complexity", arXiv:2510.18832, (2025).

[84] Shivan Mittal and Nicholas Hunter-Jones, "Local random quantum circuits form approximate designs on arbitrary architectures", arXiv:2310.19355, (2023).

[85] Dmitry Grinko and Satoshi Yoshida, "Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms", arXiv:2509.26623, (2025).

[86] Philippe Faist and Sumeet Khatri, "Thermalization with partial information", arXiv:2508.03993, (2025).

[87] Scott Aaronson and Shih-Han Hung, "Certified Randomness from Quantum Supremacy", arXiv:2303.01625, (2023).

[88] Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich, Jonas Helsen, Marcel Hinsche, Thomas Schuster, and Zoltán Zimborás, "Will it glue? On short-depth designs beyond the unitary group", arXiv:2506.23925, (2025).

[89] Aram W. Harrow and Saeed Mehraban, "Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates", Communications in Mathematical Physics 401 2, 1531 (2023).

[90] Markus Heinrich, Martin Kliesch, and Ingo Roth, "Randomized benchmarking with random quantum circuits", arXiv:2212.06181, (2022).

[91] Jeongwan Haah, Robin Kothari, Ryan O'Donnell, and Ewin Tang, "Query-optimal estimation of unitary channels in diamond distance", arXiv:2302.14066, (2023).

[92] Michał Oszmaniec, Marcin Kotowski, Michał Horodecki, and Nicholas Hunter-Jones, "Saturation and Recurrence of Quantum Complexity in Random Local Quantum Dynamics", Physical Review X 14 4, 041068 (2024).

[93] Quynh T. Nguyen, "The mixed Schur transform: efficient quantum circuit and applications", arXiv:2310.01613, (2023).

[94] Saeed Mehraban and Mehrdad Tahmasbi, "Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach", arXiv:2305.10277, (2023).

[95] Tobias Haug and M. S. Kim, "Scalable Measures of Magic Resource for Quantum Computers", PRX Quantum 4 1, 010301 (2023).

[96] Hyejin Kim, Yiqing Zhou, Yichen Xu, Kaarthik Varma, Amir H. Karamlou, Ilan T. Rosen, Jesse C. Hoke, Chao Wan, Jin Peng Zhou, William D. Oliver, Yuri D. Lensky, Kilian Q. Weinberger, and Eun-Ah Kim, "Attention to quantum complexity", Science Advances 11 41, eadu0059 (2025).

[97] Samuel Punch and Krishnendu Guha, "Adaptive t Design Dummy-Gate Obfuscation for Cryogenic Scale Enforcement", arXiv:2509.00812, (2025).

[98] Erik L. Connerty, Margarite LaBorde, and Ethan N. Evans, "Leveraging Metrologically Useful States in Quantum Reservoir Networks", arXiv:2607.06500, (2026).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-10 11:58:01) and SAO/NASA ADS (last updated successfully 2026-08-10 11:58:03). The list may be incomplete as not all publishers provide suitable and complete citation data.

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.