Fetching the paper…
Reading the bibliography…
The unitary design formation in random circuits has attracted considerable attention due to its wide range of practical applications and relevance to fundamental physics.
S. Lloyd, Almost any quantum logic gate is universal, Phys. Rev. Lett. 75
1995
Earlier work this paper cites.
A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs, Commun. Math. Phys. 291
2009
Earlier work this paper cites.
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 (2009) pp. 417–426
2009
Earlier work this paper cites.
A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs, Commun. Math. Phys. 291
2009
Earlier work this paper cites.
W. G. Brown and L. Viola, Convergence rates for arbitrary statistical moments of random quantum circuits, Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
W. G. Brown and L. Viola, Convergence rates for arbitrary statistical moments of random quantum circuits, Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011) pp. 333–342
2011
Earlier work this paper cites.
P. P. Varjú, Random walks in compact groups, Documenta Mathematica 18
2013
Earlier work this paper cites.
P. P. Varjú, Random walks in compact groups, Documenta Mathematica 18
2013
Earlier work this paper cites.
Z. Webb, The clifford group forms a unitary 3-design, arXiv preprint arXiv:1510.02769 (2015)
2015
Earlier work this paper cites.
F. G. Brandão, A. W. Harrow, and M. Horodecki, Local random quantum circuits are approximate polynomial-designs, Commun. Math. Phys. 346
2016
Earlier work this paper cites.
A. Anshu, I. Arad, and T. Vidick, Simple proof of the detectability lemma and spectral gap amplification, Phys. Rev. B 93
2016
Earlier work this paper cites.
F. G. Brandão, A. W. Harrow, and M. Horodecki, Local random quantum circuits are approximate polynomial-designs, Commun. Math. Phys. 346
2016
Earlier work this paper cites.
A. Nahum, J. Ruhman, S. Vijay, and J. Haah, Quantum entanglement growth under random unitary dynamics, Phys. Rev. X 7
2017
Earlier work this paper cites.
H. Zhu, Multiqubit clifford groups are unitary 3-designs, Phys. Rev. A 96
2017
Earlier work this paper cites.
D. A. Roberts and B. Yoshida, Chaos and complexity by design, J. High Energ. Phys. 2017
2017
Earlier work this paper cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14
2018
Earlier work this paper cites.
A. Nahum, S. Vijay, and J. Haah, Operator spreading in random unitary circuits, Phys. Rev. X 8
2018
Earlier work this paper cites.
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
2018
Earlier work this paper cites.
D. Hangleiter, J. Bermejo-Vega, M. Schwarz, and J. Eisert, Anticoncentration theorems for schemes showing a quantum speedup, Quantum 2
2018
Earlier work this paper cites.
2019
Earlier work this paper cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandão, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Cited alongside, same era.
H.-Y. Huang, R. Kueng, and J. Preskill, Predicting many properties of a quantum system from very few measurements, Nature Physics 16
2020
Cited alongside, same era.
K. Kaneko, E. Iyoda, and T. Sagawa, Characterizing complexity of many-body quantum dynamics by higher-order eigenstate thermalization, Phys. Rev. A 101
2020
Cited alongside, same era.
J. Haferkamp and N. Hunter-Jones, Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions, Phys. Rev. A 104
2021
Cited alongside, same era.
M. Oszmaniec, A. Sawicki, and M. Horodecki, Epsilon-nets, unitary designs, and random quantum circuits, IEEE Trans. Inf. Theory. 68
J. S. Cotler, D. K. Mark, H.-Y. Huang, F. Hernandez, J. Choi, A. L. Shaw, M. Endres, and S. Choi, Emergent quantum state designs from individual many-body wave functions, PRX Quantum 4
2023
Later among the works it cites.
K. Wan, W. J. Huggins, J. Lee, and R. Babbush, Matchgate shadows for fermionic quantum simulation, Commun. Math. Phys. 404
2023
Later among the works it cites.
2023
Later among the works it cites.
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2021
Cited alongside, same era.
F. G. Brandão, W. Chemissany, N. Hunter-Jones, R. Kueng, and J. Preskill, Models of quantum complexity growth, PRX Quantum 2
2021
Cited alongside, same era.
J. Haferkamp and N. Hunter-Jones, Improved spectral gaps for random quantum circuits: Large local dimensions and all-to-all interactions, Phys. Rev. A 104
2021
Cited alongside, same era.
M. Oszmaniec, A. Sawicki, and M. Horodecki, Epsilon-nets, unitary designs, and random quantum circuits, IEEE Trans. Inf. Theory. 68
2021
Cited alongside, same era.
J. Helsen, I. Roth, E. Onorati, A. H. Werner, and J. Eisert, General framework for randomized benchmarking, PRX Quantum 3
2022
Cited alongside, same era.
J. Haferkamp, Random quantum circuits are approximate unitary t t -designs in depth O ( n t 5 + o ( 1 ) ) O\left(nt^{5+o(1)}\right) , Quantum 6
2022
Cited alongside, same era.
Q. Zhu, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, M. Gong, et al. , Quantum computational advantage via 60-qubit 24-cycle random circuit sampling, Science bulletin 67
2022
Cited alongside, same era.
J. Haferkamp, P. Faist, N. B. Kothakonda, J. Eisert, and N. Yunger Halpern, Linear growth of quantum circuit complexity, Nature Physics 18
2022
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
A. Morvan, B. Villalonga, X. Mi, S. Mandrà, A. Bengtsson, P. V. Klimov, Z. Chen, S. Hong, C. Erickson, I. K. Drozdov, et al. , Phase transitions in random circuit sampling, Nature 634
2024
Later among the works it cites.
M. Oszmaniec, M. Kotowski, M. Horodecki, and N. Hunter-Jones, Saturation and recurrence of quantum complexity in random local quantum dynamics, Phys. Rev. X 14
2024
Later among the works it cites.
A. A. Mele, Introduction to haar measure tools in quantum information: A beginner’s tutorial, Quantum 8
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
A. A. Mele, Introduction to haar measure tools in quantum information: A beginner’s tutorial, Quantum 8
2024
Later among the works it cites.
2024
Later among the works it cites.
D. Belkin, J. Allen, S. Ghosh, C. Kang, S. Lin, J. Sud, F. T. Chong, B. Fefferman, and B. K. Clark, Approximate t-designs in generic circuit architectures, PRX Quantum 5
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
M. Oszmaniec, M. Kotowski, M. Horodecki, and N. Hunter-Jones, Saturation and recurrence of quantum complexity in random local quantum dynamics, Phys. Rev. X 14
2024
Later among the works it cites.
D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen, et al. , Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor, Phys. Rev. Lett. 134
2025
Closest in time.