Fetching the paper…
Reading the bibliography…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions.
“Finite-size criteria for spectral gaps in D D -dimensional quantum spin systems”
Marius Lemm · 1902
Earlier work this paper cites.
“Unitary designs from statistical mechanics in random quantum circuits”
Nicholas Hunter-Jones · 1905
Earlier work this paper cites.
“Models of quantum complexity growth”
Fernando… Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng and John Preskill · 1912
Earlier work this paper cites.
“Energy gaps and elementary excitations for certain VBS-quantum antiferromagnets”
Stefan Knabe · 1988
Earlier work this paper cites.
“Elementary gates for quantum computation”
Adriano Barenco, Charles Bennett, Richard Cleve, David DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John Smolin and Harald Weinfurter · 1995
Earlier work this paper cites.
“Approximation by quantum circuits”
Emanuel Knill · 1995
Earlier work this paper cites.
“Large- N N Scaling Behavior of the Lipkin-Meshkov-Glick Model”
F. Leyvraz and W.. Heiss · 2005
Earlier work this paper cites.
“The emergence of typical entanglement in two-party random processes”
O… Dahlsten, R. Oliveira and M.. Plenio · 2007
Earlier work this paper cites.
“Evenly distributed unitaries: On the structure of unitary designs”
David Gross, Koenraad Audenaert and Jens Eisert · 2007
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.
“Generic Entanglement Can Be Generated Efficiently”
R. Oliveira, O… Dahlsten and M.. Plenio · 2007
Earlier work this paper cites.
“The Detectability Lemma and Quantum Gap Amplification”
Dorit Aharonov, Itai Arad, Zeph Landau and Umesh Vazirani · 2008
Earlier work this paper cites.
“Fast Scramblers”
Yasuhiro Sekino and Leonard Susskind · 2008
Earlier work this paper cites.
“Exact convergence times for generation of random bipartite entanglement”
Marko Žnidarič · 2008
Earlier work this paper cites.
“Exact and approximate unitary 2-designs and their application to fidelity estimation”
Christoph Dankert, Richard Cleve, Joseph Emerson and Etera Livine · 2009
Earlier work this paper cites.
“Random Quantum Circuits are Approximate 2-designs”
A.. Harrow and R.. Low · 2009
Earlier work this paper cites.
“Convergence rates for arbitrary statistical moments of random quantum circuits”
Winton Brown and Lorenza Viola · 2010
Earlier work this paper cites.
“A Spectral Gap Theorem in S U ( d ) SU(d) ”
Jean Bourgain and Alex Gamburd · 2011
Earlier work this paper cites.
“Comment on “Random Quantum Circuits are Approximate 2-designs” by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))”
Igor Diniz and Daniel Jonathan · 2011
Cited alongside, same era.
“Scrambling speed of random quantum circuits”
Winton Brown and Omar Fawzi · 2012
Cited alongside, same era.
“Short random circuits define good quantum error correcting codes”
Winton Brown and Omar Fawzi · 2013
Cited alongside, same era.
“Exponential Quantum Speed-ups Are Generic”
Fernando… Brandão and Michal Horodecki · 2013
Cited alongside, same era.
“Random walks in compact groups”
Péterál Varjú · 2013
“Spectral gaps of frustration-free spin systems with boundary”
Marius Lemm and Evgeny Mozgunov · 2019
Later among the works it cites.
“Improved local spectral gap thresholds for lattices of finite size”
Anurag Anshu · 2020
Later among the works it cites.
“Fastest Local Entanglement Scrambler, Multistage Thermalization, and a Non-Hermitian Phantom”
Jaš Bensa and Marko Žnidarič · 2021
Later among the works it cites.
“Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions”
Jonas Haferkamp and Nicholas Hunter-Jones · 2021
Later among the works it cites.
“Epsilon-Nets, Unitary Designs, and Random Quantum Circuits”
Michał Oszmaniec, Adam Sawicki and Michał Horodecki · 2021
Later among the works it cites.
“Strong Quantum Computational Advantage Using a Superconducting Quantum Processor”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Decoupling with Random Quantum Circuits”
Winton Brown and Omar Fawzi · 2015
Cited alongside, same era.
“Quantum union bounds for sequential projective measurements”
Jingliang Gao · 2015
Cited alongside, same era.
“Simple proof of the detectability lemma and spectral gap amplification”
Anurag Anshu, Itai Arad and Thomas Vidick · 2016
Cited alongside, same era.
“Local random quantum circuits are approximate polynomial-designs”
Fernando… Brandao, Aram Harrow and Michał Horodecki · 2016
Cited alongside, same era.
“Local gap threshold for frustration-free spin systems”
David Gosset and Evgeny Mozgunov · 2016
Cited alongside, same era.
“Quantum entanglement growth under random unitary dynamics”
Adam Nahum, Jonathan Ruhman, Sagar Vijay and Jeongwan Haah · 2017
Cited alongside, same era.
“Mixing properties of stochastic quantum Hamiltonians”
E. Onorati, O. Buerschaper, M. Kliesch, W. Brown, A.. Werner and J. Eisert · 2017
Cited alongside, same era.
Yulin Wu et al · 2021
Later among the works it cites.
“Quantum computational advantage via 60-qubit 24-cycle random circuit sampling”
Qingling Zhu et al · 2021
Later among the works it cites.
“Fluctuations of subsystem entropies at late times”
Jordan Cotler, Nicholas Hunter-Jones and Daniel Ranard · 2022
Later among the works it cites.
“Random Quantum Circuits Anticoncentrate in Log Depth”
Alexander. Dalzell, Nicholas Hunter-Jones and Fernando… Brandão · 2022
Later among the works it cites.
“Random quantum circuits are approximate unitary t t -designs in depth O ( n t 5 + o ( 1 ) ) O\left(nt^{5+o(1)}\right) ”
Jonas Haferkamp · 2022
Later among the works it cites.
“Quantitatively improved finite-size criteria for spectral gaps”
Marius Lemm and David Xiang · 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.
“A polynomial-time classical algorithm for noisy random circuit sampling”
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu and Umesh Vazirani · 2023
Closest in time.
“Approximate t t -designs in generic circuit architectures” To appear
Daniel Belkin, James Allen, Soumik Ghosh, Christopher Kang, Sophia Lin, James Sud, Fred Chong, Bill Fefferman and Bryan. Clark · 2023
Closest in time.
“Approximate Unitary t t -Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates”
Aram Harrow and Saeed Mehraban · 2023
Closest in time.
“Phase transition in Random Circuit Sampling”
A. Morvan et al · 2023
Closest in time.
“On the average-case complexity of learning output distributions of quantum circuits”
Alexander Nietner, Marios Ioannou, Ryan Sweke, Richard Kueng, Jens Eisert, Marcel Hinsche and Jonas Haferkamp · 2023
Closest in time.