Fetching the paper…
Reading the bibliography…
We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program.
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1981
Earlier work this paper cites.
Quantum analogues of the bell inequalities. the case of two spatially separated domains
B.S. Tsirel’son · 1987
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 2001
Earlier work this paper cites.
Lectures on Modern Convex Optimization
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
Quantum lower bounds by quantum arguments
A. Ambainis · 2002
Earlier work this paper cites.
Complexity measures and decision tree complexity: A survey
H. Buhrman and R. de Wolf · 2002
Earlier work this paper cites.
Quantum query complexity and semi-definite programming
H. Barnum, M. E. Saks, and M. Szegedy · 2003
Earlier work this paper cites.
Negative weights make adversaries stronger
P. Høyer, T. Lee, and R. Špalek · 2007
Earlier work this paper cites.
A dual polynomial for OR
R. Špalek · 2008
Cited alongside, same era.
Span programs and quantum query complexity
B. Reichardt · 2009
Cited alongside, same era.
Semidefinite programs for completely bounded norms
J. Watrous · 2009
Cited alongside, same era.
Quantum query complexity of state conversion
T. Lee, R. Mittal, B. Reichardt, R. Špalek, and M. Szegedy · 2011
Cited alongside, same era.
Reflections for quantum query algorithms
B. Reichardt · 2011
Cited alongside, same era.
Dual lower bounds for approximate degree and markov-bernstein inequalities
Forrelation: A problem that optimally separates quantum from classical computing
S. Aaronson and A. Ambainis · 2015
Later among the works it cites.
Polynomials, quantum query complexity and Grothendieck’s inequality
S. Aaronson, A. Ambainis, J. Iraids, M. Kokainis, and J. Smotrovs · 2016
Later among the works it cites.
Separations in query complexity using cheat sheets
S. Aaronson, S. Ben-David, and R. Kothari · 2016
Later among the works it cites.
On the turing model complexity of interior point methods for semidefinite programming
E. de Klerk and F. Vallentin · 2016
Later among the works it cites.
Three-Player Entangled XOR Games are NP-Hard to Approximate
T. Vidick · 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…
M. Bun and J. Thaler · 2013
Cited alongside, same era.
Approximating the AND-OR Tree
A.A. Sherstov · 2013
Cited alongside, same era.
Quantum query algorithms are completely bounded forms
S. Arunachalam, J. Briët, and C. Palazuelos · 2017
Later among the works it cites.
The polynomial method strikes back: tight quantum query bounds via dual polynomials
M. Bun, R. Kothari, and J. Thaler · 2018
Later among the works it cites.