An improved semidefinite programming hierarchy for testing entanglement

B. Buchberger, Aequationes Mathematicae 4

1970

Earlier work this paper cites.

J. Harris, Algebraic geometry: a first course , Graduate texts in mathematics (Springer, 1992)

1992

Earlier work this paper cites.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization , second corrected edition ed., Algorithms and Combinatorics, Vol. 2 (Springer, 1993)

1993

Earlier work this paper cites.

M. Putinar, Indiana University Mathematics Journal 42

1993

Earlier work this paper cites.

S. Basu, R. Pollack, and M.-F. Roy, J. ACM 43

1996

Earlier work this paper cites.

D. Cox, J. little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra , second edition ed., Undergarduate texts in mathematics (Springer, 1996)

1996

Earlier work this paper cites.

A. Shapiro, Mathematical Programming , 301 (1997)

1997

Earlier work this paper cites.

R. Impagliazzo, R. Paturi, and F. Zane, in Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on (IEEE, 1998) pp. 653–662

1998

Earlier work this paper cites.

A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri, “A complete family of separability criteria,” (2003), arXiv:quant-ph/0308032

2003

Earlier work this paper cites.

L. Gurvits, “Classical deterministic complexity of Edmonds’ problem and quantum entanglement,” (2003), arXiv:quant-ph/0303055

2003

Earlier work this paper cites.

J. Löfberg, in In Proceedings of the CACSD Conference (Taipei, Taiwan, 2004)

2004

Earlier work this paper cites.

E. Klerk, M. Laurent, and P. Parrilo, in Positive Polynomials in Control , Lecture Notes in Control and Information Science, Vol. 312, edited by D. Henrion and A. Garulli (Springer Berlin Heidelberg, 2005) pp. 121–132

2005

Earlier work this paper cites.

M. Trnovská, Journal of Electrical Engineering 56

2005

Earlier work this paper cites.

Y.-K. Liu, The Complexity of the Consistency and N-representability Problems for Quantum States , Ph.D. thesis, Univ. of California, San Diego (2007), 0712.3041

Original

2007

Earlier work this paper cites.

S. Aaronson, S. Beigi, A. Drucker, B. Fefferman, and P. Shor, Annual IEEE Conference on Computational Complexity 0

Original

2008

Earlier work this paper cites.

H. Blier and A. Tapp, in First International Conference on Quantum, Nano, and Micro Technologies (IEEE Computer Society, Los Alamitos, CA, USA, 2009) pp. 34–37, 0709.0738

Original

2009

Cited alongside, same era.

M. Navascués, M. Owari, and M. B. Plenio, Phys. Rev. A 80

Original

2009

Cited alongside, same era.

J. Löfberg, IEEE Transactions on Automatic Control 54

2009

Cited alongside, same era.

M. Laurent, in Emerging Applications of Algebraic Geometry , The IMA Volumes in Mathematics and its Applications, Vol. 149, edited by M. Putinar and S. Sullivant (Springer New York, 2009) pp. 157–270

2009

Cited alongside, same era.

J. Nie and K. Ranestad, SIAM Journal on Optimization 20

2009

Cited alongside, same era.

Y. Shi and X. Wu, in ICALP12 (Springer, 2012) pp. 798–809, 1112.0808

Original

2012

Later among the works it cites.

S. Strelchuk and J. Oppenheim, Phys. Rev. A 86

Original

2012

Later among the works it cites.

A. Pereszlényi, “Multi-prover quantum Merlin-Arthur proof systems with small gap,” (2012), 1205.2761

Original

2012

Later among the works it cites.

A. W. Harrow and A. Montanaro, J. ACM 60

Original

2013

Later among the works it cites.

F. G. S. L. Brandão and A. W. Harrow, in Proceedings of the 45th annual ACM Symposium on theory of computing , STOC ’13 (2013) pp. 861–870, 1210.6367

Original