Fetching the paper…
Reading the bibliography…
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable.
Semidefinite programming formulations for the completely bounded norm of a tensor, 2019
Sander Gribling and Monique Laurent · 1901
Earlier work this paper cites.
An example of a non nuclear C ∗ {C}^{*} -algebra, which has the metric approximation property
Uffe Haagerup · 1978
Earlier work this paper cites.
On the degree of Boolean functions as real polynomials
Noam Nisan and Mario Szegedy · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Quantum computability
Leonard M. Adleman, Jonathan Demarrais, and Ming-Deh A. Huang · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
On the power of quantum computation
Daniel R. Simon · 1997
Earlier work this paper cites.
A strengthened asymptotic freeness result for random matrices with applications to free entropy
Dan Voiculescu · 1998
Earlier work this paper cites.
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf · 2001
Earlier work this paper cites.
Complexity measures and decision tree complexity: a survey
Harry Buhrman and Ronald de Wolf · 2002
Earlier work this paper cites.
Quantum query complexity and semi-definite programming
Howard Barnum, Michael E. Saks, and Mario Szegedy · 2003
Earlier work this paper cites.
On randomized and quantum query complexities, 2005
Gatis Midrijanis · 2005
Earlier work this paper cites.
Every decision tree has an influential variable
Ryan O’Donnell, Michael E. Saks, Oded Schramm, and Rocco A. Servedio · 2005
Cited alongside, same era.
Polynomial degree vs. quantum query complexity
Andris Ambainis · 2006
Cited alongside, same era.
On the Fourier tails of bounded functions over the discrete cube
Irit Dinur, Ehud Friedgut, Guy Kindler, and Ryan O’Donnell · 2006
Cited alongside, same era.
Lectures on the Combinatorics of Free Probability
Alexandru Nica and Roland Speicher · 2006
Cited alongside, same era.
Strong Haagerup inequalities for free r r -diagonal elements
Todd Kemp and Roland Speicher · 2007
Cited alongside, same era.
Some applications of hypercontractive inequalities in quantum information theory
Ashley Montanaro · 2012
Cited alongside, same era.
Separations in query complexity based on pointer functions
Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, and Juris Smotrovs · 2017
Later among the works it cites.
Low-sensitivity functions from unambiguous certificates
Shalev Ben-David, Pooya Hatami, and Avishay Tal · 2017
Later among the works it cites.
Random and free observables saturate the Tsirelson bound for CHSH inequality
Z. Yin, A. W. Harrow, M. Horodecki, M. Marciniak, and A. Rutkowski · 2017
Later among the works it cites.
Forrelation: A problem that optimally separates quantum from classical computing
Scott Aaronson and Andris Ambainis · 2018
Later among the works it cites.
On the Fourier spectrum of functions on Boolean cubes
Andreas Defant, Mieczyslaw Mastylo, and Antonio Pérez · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The need for structure in quantum speedups
Scott Aaronson and Andris Ambainis · 2014
Cited alongside, same era.
The strong asymptotic freeness of Haar and deterministic matrices
Benoît Collins and Camille Male · 2014
Cited alongside, same era.
Analysis of Boolean Functions
Ryan O’Donnell · 2014
Cited alongside, same era.
Separations in query complexity using cheat sheets
Scott Aaronson, Shalev Ben-David, and Robin Kothari · 2016
Cited alongside, same era.
Random matrix techniques in quantum information theory
Benoît Collins and Ion Nechita · 2016
Cited alongside, same era.
Polynomial bounds for decoupling, with applications
Ryan O’Donnell and Yu Zhao · 2016
Cited alongside, same era.
Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos · 2019
Later among the works it cites.
Towards optimal separations between quantum and randomized query complexities
Avishay Tal · 2020
Later among the works it cites.
Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem
Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal · 2021
Later among the works it cites.
Scott Aaronson, DeVon Ingram, and William Kretschmer · 2021
Later among the works it cites.
Classical algorithms for forrelation
Sergey Bravyi, David Gosset, Daniel Grier, and Luke Schaeffer · 2021
Later among the works it cites.
k k -Forrelation optimally separates quantum and classical query complexity
Nikhil Bansal and Makrand Sinha · 2021
Later among the works it cites.
An optimal separation of randomized and quantum query complexity
Alexander A. Sherstov, Andrey A. Storozhenko, and Pei Wu · 2021
Later among the works it cites.