Fetching the paper…
Reading the bibliography…
Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random.
On random graphs i
Paul Erdős and Alfréd Rényi · 1959
Earlier work this paper cites.
On a classical problem of probability theory
Paul Erdős and Alfréd Rényi · 1961
Earlier work this paper cites.
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. Divincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter · 1995
Earlier work this paper cites.
Randomizing quantum states: Constructions and applications
Patrick Hayden, Debbie Leung, Peter W. Shor, and Andreas Winter · 2003
Earlier work this paper cites.
Scalable noise estimation with random unitary operators
Joseph Emerson, Robert Alicki, and Karol Zyczkowski · 2005
Earlier work this paper cites.
Convergence conditions for random quantum circuits
Joseph Emerson, Etera Livine, and Seth Lloyd · 2005
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
Patrick Hayden and John Preskill · 2007
Earlier work this paper cites.
Quantum t-designs: T-wise independence in the quantum world
Andris Ambainis and Joseph Emerson · 2007
Earlier work this paper cites.
Fast scramblers
Yasuhiro Sekino and L. Susskind · 2008
Earlier work this paper cites.
Class of quantum Many-Body states that can be efficiently simulated
G. Vidal · 2008
Earlier work this paper cites.
Random quantum circuits are approximate 2-designs
Aram W. Harrow and Richard A. Low · 2009
Earlier work this paper cites.
Convergence rates for arbitrary statistical moments of random quantum circuits
Winton G. Brown and Lorenza Viola · 2010
Cited alongside, same era.
Quantum Hamiltonian complexity and the detectability lemma
Dorit Aharonov, Itai Arad, Zeph Landau, and Umesh Vazirani · 2010
Cited alongside, same era.
Characterizing quantum gates via randomized benchmarking
Easwar Magesan, Jay M. Gambetta, and Joseph Emerson · 2012
Cited alongside, same era.
Holographic duality from random tensor networks
Patrick Hayden, Sepehr Nezami, Xiao Liang Qi, Nathaniel Thomas, Michael Walter, and Zhao Yang · 2016
Cited alongside, same era.
Local Random Quantum Circuits are Approximate Polynomial-Designs
Fernando G.S.L. Brandão, Aram W. Harrow, and Michał Horodecki · 2016
Cited alongside, same era.
Complexity-theoretic foundations of quantum supremacy experiments
Unitary designs from statistical mechanics in random quantum circuits
Nicholas Hunter-Jones · 2019
Later among the works it cites.
Noise and the frontier of quantum supremacy
Adam Bouland, Bill Fefferman, Zeph Landau, and Yunchao Liu · 2021
Later among the works it cites.
Quantum supremacy and hardness of estimating output probabilities of quantum circuits
Yasuhiro Kondo, Ryuhei Mori, and Ramis Movassagh · 2021
Later among the works it cites.
Effective Field Theory of Random Quantum Circuits
Yunxiang Liao and Victor Galitski · 2022
Later among the works it cites.
Random Quantum Circuits Anticoncentrate in Log Depth
Alexander M. Dalzell, Nicholas Hunter-Jones, and Fernando G.S.L. Brandão · 2022
Later among the works it cites.
Random quantum circuits are approximate unitary t-designs in depth O(nt5+o(1))
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Scott Aaronson and Lijie Chen · 2017
Cited alongside, same era.
Robust entanglement renormalization on a noisy quantum computer
Isaac H. Kim and Brian Swingle · 2017
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Cited alongside, same era.
Modular architectures for quantum networks
A. Pirker, J. Wallnöfer, and W. Dür · 2018
Cited alongside, same era.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Cited alongside, same era.
Measurement-Induced Phase Transitions in the Dynamics of Entanglement
Brian Skinner, Jonathan Ruhman, and Adam Nahum · 2019
Cited alongside, same era.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G.S.L. Brandao, David A. Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, Austin Fowler, Craig Gidney, Marissa Giustina, Rob Graff, Keith Guerin, Steve Habegger, Matthew P. Harrigan, Michael J. Hartmann, Alan Ho, Markus Hoffmann, Trent Huang, Travis S. Humble, Sergei V. Isakov, Evan Jeffrey, Zhang Jiang, Dvir Kafri, Kostyantyn Kechedzhi, Julian Kelly, Paul V. Klimov, Sergey Knysh, Alexander Korotkov, Fedor Kostritsa, David Landhuis, Mike Lindmark, Erik Lucero, Dmitry Lyakh, Salvatore Mandrà, Jarrod R. McClean, Matthew McEwen, Anthony Megrant, Xiao Mi, Kristel Michielsen, Masoud Mohseni, Josh Mutus, Ofer Naaman, Matthew Neeley, Charles Neill, Murphy Yuezhen Niu, Eric Ostby, Andre Petukhov, John C. Platt, Chris Quintana, Eleanor G. Rieffel, Pedram Roushan, Nicholas C. Rubin, Daniel Sank, Kevin J. Satzinger, Vadim Smelyanskiy, Kevin J. Sung, Matthew D. Trevithick, Amit Vainsencher, Benjamin Villalonga, Theodore White, Z. Jamie Yao, Ping Yeh, Adam Zalcman, Hartmut Neven, and John M. Martinis
Cited in the paper.
Jonas Haferkamp · 2022
Later among the works it cites.
Saturation and recurrence of quantum complexity in random quantum circuits
Michał Oszmaniec, Michał Horodecki, and Nicholas Hunter-Jones · 2022
Later among the works it cites.
The hardness of random quantum circuits
Ramis Movassagh · 2023
Closest in time.
Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
Aram W. Harrow and Saeed Mehraban · 2023
Closest in time.
Local random quantum circuits form approximate designs on arbitrary architectures
Shivan Mittal and Nicholas Hunter-Jones · 2023
Closest in time.