Fetching the paper…
Reading the bibliography…
Random transformations are typically good at "scrambling" information.
Average entropy of a subsystem
D.N. Page · 1993
Earlier work this paper cites.
Chaos and quantum thermalization
M. Srednicki · 1994
Earlier work this paper cites.
The spectral gap for some spin chains with discrete symmetry breaking
B. Nachtergaele · 1996
Earlier work this paper cites.
Quantum computation and quantum information
M.A. Nielsen and I.L. Chuang · 2000
Earlier work this paper cites.
Pseudo-random unitary operators for quantum information processing
J. Emerson, Y.S. Weinstein, M. Saraceno, S. Lloyd, and D.G. Cory · 2003
Earlier work this paper cites.
Convergence conditions for random quantum circuits
J. Emerson, E. Livine, and S. Lloyd · 2005
Earlier work this paper cites.
Partial quantum information
M. Horodecki, J. Oppenheim, and A. Winter · 2005
Earlier work this paper cites.
Quantum state merging and negative information
M. Horodecki, J. Oppenheim, and A. Winter · 2006
Earlier work this paper cites.
Mathematical aspects of mixing times in markov chains
R. Montenegro and P. Tetali · 2006
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
P. Hayden and J. Preskill · 2007
Earlier work this paper cites.
Generic entanglement can be generated efficiently
R. Oliveira, OCO Dahlsten, and MB Plenio · 2007
Cited alongside, same era.
A decoupling approach to the quantum capacity
P. Hayden, M. Horodecki, J. Yard, and A. Winter · 2008
Cited alongside, same era.
Thermalization and its mechanism for generic isolated quantum systems
M. Rigol, V. Dunjko, and M. Olshanii · 2008
Cited alongside, same era.
Fast scramblers
Y. Sekino and L. Susskind · 2008
Cited alongside, same era.
Exact convergence times for generation of random bipartite entanglement
M. Žnidarič · 2008
Cited alongside, same era.
The mother of all protocols: Restructering quantum information’s family tree
A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter · 2009
Cited alongside, same era.
F. Dupuis, M. Berta, J. Wullschleger, and R. Renner · 2010
Later among the works it cites.
A decoupling approach to quantum information theory
F. Dupuis · 2010
Later among the works it cites.
Pseudo-randomness and Learning in Quantum Computation
Richard A. Low · 2010
Later among the works it cites.
Towards the fast scrambling conjecture
N. Lashkari, D. Stanford, M. Hastings, T. Osborne, and P. Hayden · 2011
Later among the works it cites.
Quantum simulation of time-dependent hamiltonians and the convenient illusion of hilbert space
D. Poulin, A. Qarry, R. Somma, and F. Verstraete · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exact and approximate unitary 2-designs and their application to fidelity estimation
C. Dankert, R. Cleve, J. Emerson, and E. Livine · 2009
Cited alongside, same era.
Random quantum circuits are approximate 2-designs
A. Harrow and R. Low · 2009
Cited alongside, same era.
On the convergence to equilibrium of kac’s random walk on matrices
R.I. Oliveira · 2009
Cited alongside, same era.
Convergence rates for arbitrary statistical moments of random quantum circuits
W.G. Brown and L. Viola · 2010
Cited alongside, same era.
Later among the works it cites.
Decoupling with unitary almost two-designs
O. Szehr, F. Dupuis, M. Tomamichel, and R. Renner · 2011
Later among the works it cites.
Convergence to equilibrium under a random hamiltonian
F.G.S.L. Brandão, P. Ćwikliński, M. Horodecki, P. Horodecki, J.K. Korbicz, and M. Mozrzymas · 2012
Closest in time.
Local random quantum circuits are approximate polynomial-designs
F.G.S.L Brandao, A.W. Harrow, and M. Horodecki · 2012
Closest in time.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
A. Gál, K.A. Hansen, M. Kouckỳ, P. Pudlák, and E. Viola · 2012
Closest in time.