Polynomials, quantum query complexity, and Grothendieck's inequality
From MaRDI portal
Publication:5368759
DOI10.4230/LIPIcs.CCC.2016.25zbMath1380.68184arXiv1511.08682MaRDI QIDQ5368759
Scott Aaronson, J. Smotrovs, Jānis Iraids, Martins Kokainis, Andris Ambainis
Publication date: 10 October 2017
Full work available at URL: https://arxiv.org/abs/1511.08682
Related Items
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing, Quantum Query Algorithms Are Completely Bounded Forms, Quantum Query Algorithms are Completely Bounded Forms., Failure of the trilinear operator space Grothendieck theorem, Fourier 1-norm and quantum speed-up, Revisiting Deutsch-Jozsa algorithm, From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm