Fetching the paper…
Reading the bibliography…
The vast majority of quantum states and unitaries have circuit complexity exponential in the number of qubits.
Über die Gleichverteilung von Zahlen mod. Eins
H. Weyl · 1916
Earlier work this paper cites.
On the linear independence of fractional powers of integers
Abram S Besicovitch · 1940
Earlier work this paper cites.
The synthesis of two-terminal switching circuits
Claude E Shannon · 1949
Earlier work this paper cites.
An application of Galois theory to elementary arithmetic
Ian Richards · 1974
Earlier work this paper cites.
Transcendental Number Theory
Alan Baker · 1975
Earlier work this paper cites.
A Boolean function requiring 3n network size
Norbert Blum · 1983
Earlier work this paper cites.
A lower bound for the formula size of rational functions
K. A. Kalorkoti · 1985
Earlier work this paper cites.
Critères pour l’indépendance algébrique
Patrice Philippon · 1986
Earlier work this paper cites.
Grands degrés de transcendance pour des familles d’exponentielles
Guy Diaz · 1989
Earlier work this paper cites.
Lower bounds for polynomial evaluation and interpolation problems
V. Shoup and R. Smolensky · 1991
Earlier work this paper cites.
Approximation by quantum circuits, 1995, quant-ph/9508006
E. Knill · 1995
Cited alongside, same era.
Field and Galois Theory
P. Morandi · 1996
Cited alongside, same era.
Efficient discrete approximations of quantum gates
Aram W Harrow, Benjamin Recht, and Isaac L Chuang · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
Quantum computation and quantum information, 2002
Michael A Nielsen and Isaac Chuang · 2002
Cited alongside, same era.
Asymptotically optimal quantum circuits for
Stephen S. Bullock, Dianne P. O’Leary, and Gavin K. Brennen · 2005
Cited alongside, same era.
Lieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order
A Mathematical Introduction to Compressive Sensing
S. Foucart and H. Rauhut · 2013
Later among the works it cites.
Random walks in compact groups
Péter Pál Varjú · 2013
Later among the works it cites.
Generating topological order: No speedup by dissipation
Robert König and Fernando Pastawski · 2014
Later among the works it cites.
Transcendental Numbers
Ram Murty and Purusottam Rath · 2014
Later among the works it cites.
The complexity of quantum states and transformations: From quantum money to black holes
Scott Aaronson · 2016
Later among the works it cites.
A better-than-3n lower bound for the circuit complexity of an explicit function
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, and Alexander S. Kulikov · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Bravyi, M. B. Hastings, and F. Verstraete · 2006
Cited alongside, same era.
The Solovay-Kitaev algorithm
Christopher M Dawson and Michael A Nielsen · 2006
Cited alongside, same era.
A geometric approach to quantum circuit lower bounds
Michael A. Nielsen · 2006
Cited alongside, same era.
Uniform Distribution of Sequences
L. Kuipers and H. Niederreiter · 2012
Cited alongside, same era.
Computational complexity and black hole horizons
Leonard Susskind · 2016
Later among the works it cites.
Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
Adam Bouland and Tudor Giurgica-Tiron · 2021
Later among the works it cites.
Epsilon-nets, unitary designs, and random quantum circuits
Michał Oszmaniec, Adam Sawicki, and Michał Horodecki · 2022
Closest in time.