Fetching the paper…
Reading the bibliography…
We present several polynomial- and quasipolynomial-time approximation schemes for a large class of generalized operator norms.
The moduli of smoothness and convexity and the Rademacher averages of the trace classes s { p } s_{\{}p\} ( 1 ≤ p < ∞ ) (1\leq p<\infty)
Nicole Tomczak-Jaegermann · 1974
Earlier work this paper cites.
Finite exchangeable sequences
P. Diaconis and D. Freedman · 1980
Earlier work this paper cites.
Probability in Banach spaces. Isoperimetry and processes
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Earlier work this paper cites.
Sharp uniform convexity and smoothness inequalities for trace norms
Keith Ball, Eric A. Carlen, and Elliott H. Lieb · 1994
Earlier work this paper cites.
Clarkson type inequalities and their relations to the concepts of type and cotype
Mikio Kato, Lars-Erik. Persson, and Yasuji Takahashi · 2000
Earlier work this paper cites.
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
Leonid Gurvits · 2003
Earlier work this paper cites.
Playing large games using simple strategies
Richard J. Lipton, Evangelos Markakis, and Aranyak Mehta · 2003
Earlier work this paper cites.
Complete family of separability criteria
Andrew C. Doherty, Pablo A. Parrilo, and Federico M. Spedalieri · 2004
Earlier work this paper cites.
Randomizing quantum states: Constructions and applications
P. Hayden, D. W. Leung, P. W. Shor, and A. J. Winter · 2004
Earlier work this paper cites.
General entanglement breaking channels
M. Horodecki, P.W. Shor, and M.B. Ruskai · 2004
Earlier work this paper cites.
Computation of matrix norms with applications to robust optimization
Daureen Steinberg · 2005
Earlier work this paper cites.
A PTAS for the minimization of polynomials of fixed degree over the simplex
Etienne De Klerk, Monique Laurent, and Pablo A Parrilo · 2006
Earlier work this paper cites.
A PTAS for the minimization of polynomials of fixed degree over the simplex
Etienne De Klerk, Monique Laurent, and Pablo A Parrilo · 2006
Earlier work this paper cites.
A simple proof of monogamy of entanglement
D. Yang · 2006
Cited alongside, same era.
Lower bounds in communication complexity based on factorization norms
Nati Linial and Adi Shraibman · 2007
Cited alongside, same era.
History of Banach Spaces and Linear Operators
A. Pietsch · 2007
Cited alongside, same era.
Lower bounds in communication complexity based on factorization norms
Nati Linial and Adi Shraibman · 2009
Cited alongside, same era.
William Matthews, Stephanie Wehner, and Andreas Winter · 2009
Cited alongside, same era.
Subexponential algorithms for unique games and related problems
Sanjeev Arora, Boaz Barak, and David Steurer · 2010
Hypercontractivity, sum-of-squares proofs, and their applications
Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou · 2012
Later among the works it cites.
On the Banach-space-valued Azuma inequality and small-set isoperimetry of Alon-Roichman graphs
Assaf Naor · 2012
Later among the works it cites.
Epsilon-net method for optimizations over separable states
Yaoyun Shi and Xiaodi Wu · 2012
Later among the works it cites.
The approximate rank of a matrix and its algorithmic applications: Approximate rank
Noga Alon, Troy Lee, Adi Shraibman, and Santosh Vempala · 2013
Later among the works it cites.
The approximate rank of a matrix and its algorithmic applications: Approximate rank
Noga Alon, Troy Lee, Adi Shraibman, and Santosh Vempala · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An efficient test for product states, with applications to quantum Merlin-Arthur games
Aram W. Harrow and Ashley Montanaro · 2010
Cited alongside, same era.
Practical large-scale optimization for max-norm regularization
Jason D Lee, Ben Recht, Ruslan R Salakhutdinov, Nathan Srebro, and Joel Tropp · 2010
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices, 2010, arXiv:1004.4389
J. A. Tropp · 2010
Cited alongside, same era.
A quasipolynomial-time algorithm for the quantum separability problem
Fernando G.S.L. Brandão, Matthias Christandl, and Jon Yard · 2011
Cited alongside, same era.
F.G.S.L. Brandão and M. Christandl · 2011
Cited alongside, same era.
Faithful squashed entanglement
F. G. S. L. Brandão, M. Christandl, and J. Yard · 2011
Cited alongside, same era.
Later among the works it cites.
Quantum de Finetti theorems under local measurements with applications
Fernando G. S. L. Brandão and Aram W. Harrow · 2013
Later among the works it cites.
Rounding sum-of-squares relaxations
Boaz Barak, Jonathan Kelner, and David Steurer · 2013
Later among the works it cites.
Testing product states, quantum Merlin-Arthur games and tensor optimization
Aram W. Harrow and Ashley Montanaro · 2013
Later among the works it cites.
S. Aaronson, R. Impagliazzo, and D. Moshkovitz · 2014
Later among the works it cites.
Approximating the best Nash equilibrium in n o ( l o g ( n ) ) n^{o(log(n))} -time breaks the Exponential Time Hypothesis, 2014
M. Braverman, Y. K. Ko, and Omri Weinstein · 2014
Later among the works it cites.
Quantum de Finetti theorem measured with fully one-way LOCC norm, 2014, arXiv:1408.6829
Ke Li and Graeme Smith · 2014
Later among the works it cites.
Relative entropy and squashed entanglement
Ke Li and Andreas Winter · 2014
Later among the works it cites.
Finding approximate Nash equilibria using LP hierarchies, 2015
Aram W. Harrow · 2015
Closest in time.