Fetching the paper…
Reading the bibliography…
We give algorithms for the optimization problem: $\max_\rho \ip{Q}{\rho}$, where $Q$ is a Hermitian matrix, and the variable $\rho$ is a bipartite {\em separable} quantum state.
Zur theorie der gesellschaftsspiele
J. von Neumann · 1928
Earlier work this paper cites.
Minimax theorems
K. Fan · 1953
Earlier work this paper cites.
On relating time and space to size and depth
Allan Borodin · 1977
Earlier work this paper cites.
Tensor norms and operator ideals
A. Defant and K. Floret · 1992
Earlier work this paper cites.
Parallel linear algebra
J. von zur Gathen · 1993
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.
Quantum Computation and Quantum Information
Michael Nielsen and Issac Chuang · 2000
Earlier work this paper cites.
On the complexity of k k -SAT
R. Impagliazzo and R. Paturi · 2001
Earlier work this paper cites.
Classical and Quantum Computation
A. Kitaev, A. Shen, M. Vyalyi, · 2002
Earlier work this paper cites.
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?,
H. Kobayashi, K. Matsumoto and T. Yamakami, · 2003
Earlier work this paper cites.
A complete family of separability criteria
A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri · 2004
Earlier work this paper cites.
Classical complexity and quantum entanglement
L. Gurvits · 2004
Earlier work this paper cites.
The multiplicative weights update method: a meta algorithm and applications,
S. Arora, E. Hazan, and S. Kale · 2005
Earlier work this paper cites.
Quantum Arthur-Merlin Games,
C. Marriott and J. Watrous, · 2005
Earlier work this paper cites.
The complexity of the local Hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
Online variance minimization
M. Warmuth and D. Kuzmin · 2006
Cited alongside, same era.
Computational complexity of the quantum separability problem
L. M. Ioannou · 2007
Cited alongside, same era.
Efficient algorithms using the multiplicative weights update method
S. Kale · 2007
Cited alongside, same era.
Entanglement Theory and the Quantum Simulation of Many-Body Physics
F. G. S. L. Brandão · 2008
Cited alongside, same era.
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: a Short Survey
E. de Klerk · 2008
Cited alongside, same era.
Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
W. Matthews, S. Wehner, and A. Winter · 2009
Later among the works it cites.
NP vs QMAlog(2)
S. Beigi · 2010
Later among the works it cites.
Short multi-prover quantum proofs for SAT without entangled measurements
J. Chen and A. Drucker · 2010
Later among the works it cites.
Strong 𝖭𝖯 \mathsf{NP} -hardness of the quantum separability problem
S. Gharibian · 2010
Later among the works it cites.
Approximation Algorithms for Homogeneous Polynomial Optimization with Quadratic Constraints
S. He, Z. Li and S. Zhang · 2010
Later among the works it cites.
An efficient test for product states, with applications to quantum Merlin-Arthur games
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The complexity of quantum spin systems on a twodimensional square lattice
R. Oliveira and B. Terhal · 2008
Cited alongside, same era.
Lecture Notes on Theory of Quantum Information
J. Watrous · 2008
Cited alongside, same era.
The Power of Unentanglement
S. Aaronson, S. Beigi, A. Drucker, B. Fefferman and P. Shor, · 2009
Cited alongside, same era.
The power of quantum systems on a line
D. Aharonov, D. Gottesman, S. Irani, and J. Kempe · 2009
Cited alongside, same era.
All languages in NP have very short quantum proofs
H. Blier and A. Tapp, · 2009
Cited alongside, same era.
Quantum entanglement
R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki · 2009
Cited alongside, same era.
A. Harrow and A. Montanaro · 2010
Later among the works it cites.
Equilibrium value method for the proof of QIP = = PSPACE
X. Wu · 2010
Later among the works it cites.
Parallized solutions to semidefinite programmings in quantum complexity theory
X. Wu · 2010
Later among the works it cites.
A quasipolynomial-time algorithm for the quantum separability problem
F. G. S. L. Brandão, M. Christandl, and J. Yard · 2011
Closest in time.
Improved Soundness for QMA with Multiple Provers
A. Chiesa and M. Forbes · 2011
Closest in time.
On QMA Protocols with Two Short Quantum Proofs
F. L. Gall, S. Nakagawa and H. Nishimura · 2011
Closest in time.
S. Ragnarsson and C. F. Van Loan · 2011
Closest in time.
Deterministic Approximation Algorithms for Sphere Constrained Homogeneous Polynomial Optimization Problems
A. M. So · 2011
Closest in time.