Fetching the paper…
Reading the bibliography…
One-parameter interpolations between any two unitary matrices (e.g., quantum gates) $U_1$ and $U_2$ along efficient paths contained in the unitary group are constructed.
Polynomial codes over certain finite fields
Irving S Reed and Gustave Solomon · 1960
Earlier work this paper cites.
Error correction for algebraic block codes
Lloyd R Welch and Elwyn R Berlekamp · 1986
Earlier work this paper cites.
New directions in testing
Richard J Lipton · 1989
Earlier work this paper cites.
On the degree of polynomials that approximate symmetric boolean functions (preliminary version)
Ramamohan Paturi · 1992
Earlier work this paper cites.
Introduction to linear algebra
Gilbert Strang · 1993
Earlier work this paper cites.
Numerical linear algebra
Lloyd N Trefethen and David Bau III · 1997
Earlier work this paper cites.
How to generate random matrices from the classical compact groups
Francesco Mezzadri · 2006
Earlier work this paper cites.
Black holes as mirrors: quantum information in random subsystems
Patrick Hayden and John Preskill · 2007
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J Bremner, Richard Jozsa, and Dan J Shepherd · 2011
Cited alongside, same era.
Quantum speedups are generic
Fernando G.S.L. Brandao and Michal Horodecki · 2013
Cited alongside, same era.
Concentration of measure and the compact classical matrix groups
Elizabeth Meckes · 2014
Cited alongside, same era.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2016
Lecture notes in essential coding theory
Madhu Sudan · 2017
Later among the works it cites.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven · 2018
Closest in time.
Quantum supremacy and the complexity of random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2018
Closest in time.
How many qubits are needed for quantum computational supremacy?
Alexander M Dalzell, Aram W Harrow, Dax Enshan Koh, and Rolando L La Placa · 2018
Closest in time.
Aram Harrow and Saeed Mehraban · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Quantum computational supremacy
Aram W Harrow and Ashley Montanaro · 2017
Cited alongside, same era.
Quantum computing in the nisq era and beyond
John Preskill · 2018
Closest in time.
Holographic spacetimes as quantum circuits of path-integrations
Tadashi Takayanagi · 2018
Closest in time.