Fetching the paper…
Reading the bibliography…
We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\delta}(U)$ to approximate a unitary $U$ up to an error of $\delta$ in operator norm distance.
Energy gaps and elementary excitations for certain vbs-quantum antiferromagnets
S. Knabe · 1988
Earlier work this paper cites.
Comparison techniques for random walk on finite groups
P. Diaconis and L. Saloff-Coste · 1993
Earlier work this paper cites.
The spectral gap for some spin chains with discrete symmetry breaking
B. Nachtergaele · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Efficient discrete approximations of quantum gates
A. W. Harrow, B. Recht, and I. L. Chuang · 2002
Earlier work this paper cites.
Clifford group
M. Ozols · 2008
Earlier work this paper cites.
On the convergence to equilibrium of Kac’s random walk on matrices
R. I. Oliveira · 2009
Earlier work this paper cites.
A spectral gap theorem in su ( d ) (d)
J. Bourgain and A. Gamburd · 2012
Earlier work this paper cites.
Random walks in compact groups
P. Varjú · 2013
Earlier work this paper cites.
Analysis of boolean functions
R. O’Donnell · 2014
Earlier work this paper cites.
Local random quantum circuits are approximate polynomial-designs
F. G. S. L. Brandão, A. W. Harrow, and M. Horodecki · 2016
Cited alongside, same era.
Efficient quantum pseudorandomness
F. G. S. L. Brandao, A. W. Harrow, and M. Horodecki · 2016
Cited alongside, same era.
Chaos and complexity by design
D. A. Roberts and B. Yoshida · 2017
Cited alongside, same era.
Second law of quantum complexity
A. R. Brown and L. Susskind · 2018
Cited alongside, same era.
Pseudorandom quantum states
Z. Ji, Y.-K. Liu, and F. Song · 2018
Cited alongside, same era.
Shorter stabilizer circuits via bruhat decomposition and quantum circuit transformations
Dmitri Maslov and Martin Roetteler · 2018
Cited alongside, same era.
Linear growth of quantum circuit complexity
J. Haferkamp, P. Faist, N. B. T. Kothakonda, J. Eisert, and N. Yunger Halpern · 2021
Later among the works it cites.
Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
J. Haferkamp and N. Hunter-Jones · 2021
Later among the works it cites.
Epsilon-nets, unitary designs and random quantum circuits
M. Oszmaniec, A. Sawicki, and M. Horodecki · 2021
Later among the works it cites.
A. Bouland, B. Fefferman, S. Ghosh, U. Vazirani, and Z. Zhou · 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}(nt^{5+o(1)})
J. Haferkamp · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. Hunter-Jones · 2019
Cited alongside, same era.
Models of quantum complexity growth
F. G. S. L. Brandão, W. Chemissany, N. Hunter-Jones, R. Kueng, and J. Preskill · 2021
Cited alongside, same era.
Hadamard-free circuits expose the structure of the clifford group
S. Bravyi and D. Maslov · 2021
Cited alongside, same era.
Shao-Kai Jian, Gregory Bentsen, and Brian Swingle · 2022
Later among the works it cites.
Short proofs of linear growth of quantum circuit complexity
Z. Li · 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.
Resource theory of quantum uncomplexity
N. Yunger Halpern, N. B. T. Kothakonda, J. Haferkamp, A. Munson, J. Eisert, and P. Faist · 2022
Later among the works it cites.