Fetching the paper…
Reading the bibliography…
Random reversible and quantum circuits form random walks on the alternating group $\mathrm{Alt}(2^n)$ and unitary group $\mathrm{SU}(2^n)$, respectively.
Unitary designs from statistical mechanics in random quantum circuits, 2019
Nicholas Hunter-Jones · 1905
Earlier work this paper cites.
Models of quantum complexity growth
Fernando GSL Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, and John Preskill · 1912
Earlier work this paper cites.
Random quantum circuits are approximate 2-designs
Aram W Harrow and Richard A Low · 1919
Earlier work this paper cites.
The synthesis of two-terminal switching circuits
Claude. E. Shannon · 1949
Earlier work this paper cites.
Fourier Analysis, Self-Adjointness (Methods of Modern Mathematical Physics)
Michael Reed and Barry Simon · 1975
Earlier work this paper cites.
Interpolation spaces
J Bergh-J Lofstrom and Joran Bergh · 1976
Earlier work this paper cites.
Asymptotic theory of finite dimensional normed spaces: Isoperimetric inequalities in riemannian manifolds
Vitali D Milman and Gideon Schechtman · 1986
Earlier work this paper cites.
Ordering trees by algebraic connectivity
Robert Grone and Russell Merris · 1990
Earlier work this paper cites.
On the orders of doubly transitive permutation groups, elementary estimates
L. Pyber · 1993
Earlier work this paper cites.
Polynomials and Polynomial Inequalities
Peter Borwein and Tamas Erdelyi · 1995
Earlier work this paper cites.
Reversible Markov chains and random walks on graphs
Aldous David and James Allen Fill · 1995
Earlier work this paper cites.
An almost m-wise independent random permutation of the cube
W Timothy Gowers · 1996
Earlier work this paper cites.
The spectral gap for some spin chains with discrete symmetry breaking
Bruno Nachtergaele · 1996
Earlier work this paper cites.
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2002
Earlier work this paper cites.
Efficient unitary designs with a system-size independent number of non-clifford gates
Jonas Haferkamp, Felipe Montealegre-Mora, Markus Heinrich, Jens Eisert, David Gross, and Ingo Roth · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
The eigenvalues of Kac’s master equation
David K Maslen · 2003
Earlier work this paper cites.
PRIMES is in P
Manindra Agrawal, Neeraj Kayal, and Nitin Saxena · 2004
Earlier work this paper cites.
Simple permutations mix well
Shlomo Hoory, Avner Magen, Steven Myers, and Charles Rackoff · 2005
Earlier work this paper cites.
A geometric approach to quantum circuit lower bounds
Michael A Nielsen · 2006
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.
Symmetric groups and expander graphs
Martin Kassabov · 2007
Earlier work this paper cites.
Universal lattices and unbounded rank expanders
Martin Kassabov · 2007
Earlier work this paper cites.
Simple permutations mix even better
Alex Brodsky and Shlomo Hoory · 2008
Earlier work this paper cites.
Randomized benchmarking of quantum gates
Emanuel Knill, Dietrich Leibfried, Rolf Reichle, Joe Britton, R Brad Blakestad, John D Jost, Chris Langer, Roee Ozeri, Signe Seidelin, and David J Wineland · 2008
Earlier work this paper cites.
The detectability lemma and quantum gap amplification
Dorit Aharonov, Itai Arad, Zeph Landau, and Umesh Vazirani · 2009
Earlier work this paper cites.
Large deviation bounds for k-designs
Richard A Low · 2009
Cited alongside, same era.
Convergence rates for arbitrary statistical moments of random quantum circuits
Winton G. Brown and Lorenza Viola · 2010
Cited alongside, same era.
Fluctuations of subsystem entropies at late times
Jordan Cotler, Nicholas Hunter-Jones, and Daniel Ranard · 2010
Cited alongside, same era.
Proof of aldous’ spectral gap conjecture
Pietro Caputo, Thomas Liggett, and Thomas Richthammer · 2010
Cited alongside, same era.
Epsilon-nets, unitary designs, and random quantum circuits
Michał Oszmaniec, Adam Sawicki, and Michał Horodecki · 2021
Later among the works it cites.
Jonas Haferkamp · 2022
Later among the works it cites.
Randomness and complexity in random complex quantum systems
Jonas Haferkamp · 2022
Later among the works it cites.
Linear growth of quantum circuit complexity
Jonas Haferkamp, Philippe Faist, Naga BT Kothakonda, Jens Eisert, and Nicole Yunger Halpern · 2022
Later among the works it cites.
Short proofs of linear growth of quantum circuit complexity, 2022
Zhi Li · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Richard A Low · 2010
Cited alongside, same era.
The detectability lemma and its applications to quantum Hamiltonian complexity
Dorit Aharonov, Itai Arad, Umesh Vazirani, and Zeph Landau · 2011
Cited alongside, same era.
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
Noga Alon and Shachar Lovett · 2012
Cited alongside, same era.
A spectral gap theorem in s u ( d ) su(d)
Jean Bourgain and Alex Gamburd · 2012
Cited alongside, same era.
Jonas Haferkamp and Nicholas Hunter-Jones · 2012
Cited alongside, same era.
Characterizing quantum gates via randomized benchmarking
Easwar Magesan, Jay M Gambetta, and Joseph Emerson · 2012
Cited alongside, same era.
Pseudorandomness
Salil P. Vadhan · 2012
Cited alongside, same era.
Random walks in compact groups, 2012
Péter Pál Varjú · 2012
Cited alongside, same era.
Later among the works it cites.
Xiaogang Liu and Sanming Zhou · 2022
Later among the works it cites.
The quantum union bound made easy
Ryan O’Donnell and Ramgopal Venkateswaran · 2022
Later among the works it cites.
Pierre-Emmanuel Caprace and Martin Kassabov · 2023
Later among the works it cites.
Matthew P.A. Fisher, Vedika Khemani, Adam Nahum, and Sagar Vijay · 2023
Later among the works it cites.
On the moments of random quantum circuits and robust quantum complexity, 2023
Jonas Haferkamp · 2023
Later among the works it cites.
Aram W Harrow and Saeed Mehraban · 2023
Later among the works it cites.
Linear growth of circuit complexity from brownian dynamics
Shao-Kai Jian, Gregory Bentsen, and Brian Swingle · 2023
Later among the works it cites.
Local random quantum circuits form approximate designs on arbitrary architectures, 2023
Shivan Mittal and Nicholas Hunter-Jones · 2023
Later among the works it cites.
Efficient unitary designs and pseudorandom unitaries from permutations, 2024
Chi-Fang Chen, Adam Bouland, Fernando GSL Brandão, Jordan Docter, Patrick Hayden, and Michelle Xu · 2024
Closest in time.
Efficient unitary t-designs from random sums, 2024
Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, and Patrick Hayden · 2024
Closest in time.
A new approach to strong convergence, 2024
Chi-Fang Chen, Jorge Garza-Vargas, Joel A Tropp, and Ramon van Handel · 2024
Closest in time.
Dynamics of pseudoentanglement
Xiaozhou Feng and Matteo Ippoliti · 2024
Closest in time.
More efficient approximate k k -wise independent permutations from random reversible circuits via log-Sobolev inequalities
Lucas Gretta, William He, and Angelos Pelecanos · 2024
Closest in time.
Complexity is not enough for randomness, 2024
Shiyong Guo, Martin Sasieta, and Brian Swingle · 2024
Closest in time.
Efficient approximate unitary designs from random pauli rotations, 2024
Jeongwan Haah, Yunchao Liu, and Xinyu Tan · 2024
Closest in time.
Pseudorandom permutations from random reversible circuits, 2024
William He and Ryan O’Donnell · 2024
Closest in time.
Simple constructions of linear-depth t-designs and pseudorandom unitaries, 2024
Tony Metger, Alexander Poremba, Makrand Sinha, and Henry Yuen · 2024
Closest in time.
Saturation and recurrence of quantum complexity in random local quantum dynamics, 2024
Michał Oszmaniec, Marcin Kotowski, Michał Horodecki, and Nicholas Hunter-Jones · 2024
Closest in time.
Upcomig work, 2024
Thomas Schuster, Jonas Haferkamp, and Hsin-Yuan Huang · 2024
Closest in time.