Fetching the paper…
Reading the bibliography…
Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group.
A theorem of Frobenius, a theorem of Amitsur-Levitski and cohomology theory
Bertram Kostant · 1958
Earlier work this paper cites.
Generalized matrix functions
Marvin Marcus and Henryk Minc · 1965
Earlier work this paper cites.
Cones in the group algebra related to Schur’s determinantal inequality
Robert Grone, Russel Merris, and William Watkins · 1988
Earlier work this paper cites.
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Reinhard F. Werner · 1989
Earlier work this paper cites.
Positive polynomials on compact semi-algebraic sets
Mihai Putinar · 1993
Earlier work this paper cites.
Separability of mixed states: necessary and sufficient conditions
Michał Horodecki, Paweł Horodecki, and Ryszard Horodecki · 1996
Earlier work this paper cites.
Separability criterion for density matrices
Asher Peres · 1996
Earlier work this paper cites.
Semidefinite Programming
Lieven Vandenberghe and Stephen Boyd · 1996
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Jean-Bernard Lasserre · 2000
Earlier work this paper cites.
Separability properties of tripartite states with U ⊗ U ⊗ U U\otimes U\otimes U symmetry
Tilo Eggeling and Reinhard F. Werner · 2001
Earlier work this paper cites.
Classical deterministic complexity of Edmond’s problem and quantum entanglement
Leonid Gurvits · 2003
Earlier work this paper cites.
Robust semidefinite programming approach to the separability problem
Fernando G. S. L. Brandão and Reinaldo O. Vianna · 2004
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.
Complete hierarchies of efficient approximations to problems in entanglement theory
Jens Eisert, Philipp Hyllus, Otfried Gühne, and Marcos Curty · 2004
Earlier work this paper cites.
Representation theory. A first course
William Fulton and Joe Harris · 2004
Earlier work this paper cites.
Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
Benoît Collins and Piotr Śniady · 2006
Earlier work this paper cites.
Matrix sum-of-squares relaxations for robust semi-definite programs
Carsten W. Scherer and Camile W. J. Hol · 2006
Earlier work this paper cites.
Distillability of Werner states using entanglement witnesses and robust semidefinite programs
Reinaldo O. Vianna and Andrew C. Doherty · 2006
Cited alongside, same era.
One-and-a-half quantum de Finetti theorems
Matthias Christandl, Robert König, Graeme Mitchison, and Renato Renner · 2007
Cited alongside, same era.
Lie Groups, An Approach through Invariants and Representations
Claudio Procesi · 2007
Cited alongside, same era.
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
Miguel Navascués, Stefano Pironio, and Antonio Acín · 2008
Cited alongside, same era.
Computing sum of squares decompositions with rational coefficients
Helfried Peyrl and Pablo A. Parrilo · 2008
Cited alongside, same era.
Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
Cécilia Lancien, Otfried Gühne, Ritabrata Sengupta, and Marcus Huber · 2015
Later among the works it cites.
Quantum steering: a review with focus on semidefinite programming
Daniel Cavalcanti and Paul Skrzypczyk · 2016
Later among the works it cites.
An update on a few permanent conjectures
Fuzhen Zhang · 2016
Later among the works it cites.
Entanglement and the truncated moment problem
Fabian Bohnet-Waldraff, Daniel Braun, and Olivier Giraud · 2017
Later among the works it cites.
An improved semidefinite programming hierarchy for testing entanglement
Aram W. Harrow, Anand Natarajan, and Xiaodi Wu · 2017
Later among the works it cites.
Applications of semi-definite optimization in quantum information protocols
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Claudio Procesi · 2008
Cited alongside, same era.
Efficient multi-port teleportation schemes
Michał Studziński, Marek Mozrzymas, Piotr Kopszak, and Michał Horodecki · 2008
Cited alongside, same era.
Entanglement detection
Otfried Gühne and Géza Tóth · 2009
Cited alongside, same era.
Power of symmetric extensions for entanglement detection
Miguel Navascués, Masaki Owari, and Martin B. Plenio · 2009
Cited alongside, same era.
Taming multiparticle entanglement
Bastian Jungnitsch, Tobias Moroder, and Otfried Gühne · 2011
Cited alongside, same era.
Handbook on semidefinite, conic and polynomial optimization
Miguel F. Anjos and Jean B. Lasserre, editors · 2012
Cited alongside, same era.
Semidefinite Optimization and Convex Algebraic Geometry
Grigoriy Blekherman, Pablo A. Parrilo, and Rekha R. Thomas, editors · 2013
Cited alongside, same era.
Piotr Mironowicz · 2018
Later among the works it cites.
A simplified formalism of the algebra of partially transposed permutation operators with applications
Marek Mozrzymas, Michał Studziński, and Michał Horodecki · 2018
Later among the works it cites.
Semidefinite Optimization for Quantum Information
Xin Wang · 2018
Later among the works it cites.
Entanglement of symmetric Werner states
Hans Maassen and Burkhard Kümmerer · 2019
Later among the works it cites.
Semidefinite programming hierarchies for constrained bilinear optimization
Mario Berta, Francesco Borderi, Omar Fawzi, and Volker B. Scholz · 2021
Closest in time.
Unveiling quantum entanglement in many-body systems from partial information
Irénée Frérot, Flavio Baccari, and Antonio Acín · 2021
Closest in time.
Matrix forms of immanant inequalities
Felix Huber and Hans Maassen · 2021
Closest in time.
Positive maps and trace polynomials from the symmetric group
Felix Huber · 2021
Closest in time.
Sparse noncommutative polynomial optimization
Igor Klep, Victor Magron, and Janez Povh · 2021
Closest in time.
Optimization over trace polynomials
Igor Klep, Victor Magron, and Jurij Volčič · 2021
Closest in time.
Exploiting term sparsity in Noncommutative Polynomial Optimization
Jie Wang and Victor Magron · 2021
Closest in time.