Convergent relaxations of polynomial optimization problems with noncommuting variables

SIAM Journal on Optimization

Volumn 20, Issue 5, 2010, Pages 2157-2180

  Pironio, S ^a,b   Navascues M ^c   Acin A ^d  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

^d ICFO INSTITUT DE CIENCIES FOTONIQUES   (Spain)

Author keywords

Global optimization; Noncommutative variables; Positive polynomials; Semidefinite programming

Indexed keywords

A-MONOTONE; ASSOCIATED POLYNOMIALS; BOUNDED OPERATORS; GLOBAL OPTIMIZER; GLOBAL OPTIMUM; LOWER BOUNDS; NON-COMMUTATIVE; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL INEQUALITIES; POLYNOMIAL OPTIMIZATION PROBLEM; POSITIVE POLYNOMIALS; QUANTUM INFORMATION SCIENCE; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMMING PROBLEM; SEMIDEFINITE PROGRAMMING RELAXATIONS;

CONSTRAINT THEORY; GLOBAL OPTIMIZATION; POLYNOMIALS; QUANTUM OPTICS; QUANTUM THEORY;

MATHEMATICAL PROGRAMMING;

EID: 77956073690     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090760155     Document Type: Article

References (27)

1. K. Cafuta, I. Klep, and J. Povh. NCSOStools: A computer algebra system for symbolic and numerical computation with noncommutative polynomials, http://ncsostools.fis.unm.si.
2. R. E. Curto and L. A. Fialkow, Solution of the truncated complex moment problem with flat data, Mem. Amer. Math. Soc. 568, 119 (1996).
3. A. C. Doherty, Y. C. Liang, B. Toner, and S. Wehner, The quantum moment problem and bounds on entangled multi-prover games, in Proceedings of IEEE Conference on Computational Complexity, 2008, pp. 199-210.
4. J. W. Helton, "Positive" noncommutative polynomials are sums of squares, Ann. of Math., 156 (2002), pp. 675-694.
5. J.W. Helton and S. A. McCullough, A Positivstellensatz for non-commutative polynomials, Trans. Amer. Math. Soc., 356 (2004), pp. 3721-3737.
6. J. W. Helton and M. Putinar, Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization, in Operator Theory, Structured Matrices, and Dilations: Tiberiu Constantinescu Memorial Volume, International Book Series of Mathematical Texts, Theta, Bucharest, 2007, pp. 229-306.
7. D. Henrion and J. B. Lasserre, Detecting global optimality and extracting solutions in GloptiPoly, in Positive Polynomials in Control, Lecture Notes in Control and Information Sciences 312, D. Henrion and A. Garulli, eds., Springer, Berlin, 2005, pp. 293-310.
8. D. Henrion and J. B. Lasserre, Convergent relaxations of polynomial matrix inequalities and static output feedback, IEEE Trans. Automat. Control, 51 (2006), pp. 192-202.
9. T. Ito, H. Kobayashi, and K. Matsumoto, Quantum multi-prover interactive proofs and decidability, in preparation.
10. I. Klep and J. Povh, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, J. Pure Appl. Algebra, 214 (2010), pp. 740-749.
11. I. Klep and M. Schweighofer, A Nichtnegativstellensatz for polynomials in noncommuting variables, Israel J. Math., 161 (2007), pp. 17-27.
12. J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
13. M. Laurent, Sums of squares, moment matrices and optimization over polynomials, in Emerging Applications of Algebraic Geometry, M. Putinar and S. Sullivant, eds., IMA Vol. Math. Appl. 149, Springer, New York, 2009, pp. 157-270.
14. J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, available from http://users.isy.liu.se/johanl/yalmip.
15. D. A. Mazziotti, Variational minimization of atomic and molecular ground-state energies via the two-particle reduced density matrix, Phys. Rev. A, 65 (2002), 062511.
16. D. A. Mazziotti, Realization of quantum chemistry without wave functions through first-order semidefinite programming, Phys. Rev. Lett., 93 (2004), 213001.
17. T. Mora, An introduction to commutative and noncommutative Gröbner bases, Theoret. Comput. Sci, 134 (1994), pp. 131-173.
18. M. Navascues, S. Pironio, and A. Acin, Bounding the set of quantum correlations, Phys. Rev. Lett., 98 (2007), 010401.
19. M. Navascues, S. Pironio, and A. Acin, A convergent hierarchy of semdefinite programs characterizing the set of quantum correlations, New J. Phys., 10 (2008), 073013.
20. K. F. Pál and T. Vértesi, Quantum bounds on Bell inequalities, Phys. Rev. A, 79 (2009), 022120.
21. P. A. Parrilo, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robstness and Optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 2000.
22. S. Pironio, A. Acin, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, Random numbers certified by Bell's theorem, arXiv:0911.3427.
23. M. Putinar, Positive polynomials on compact semi-algebraic sets, Indiana Univ. Math. J., 42 (1993), pp. 969-984.
24. M. Reed and B. Simon, Functional Analysis, Vol.1, Methods ofModernMathematical Physics, Academic Press, New York, 1972.
25. J. F. Sturm, SeDuMi, a MATLAB toolbox for optimization over symmetric cones, http:// sedumi.mcmaster.ca.
26. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
27. J. von Neumann, On rings of operators. Reduction theory, Ann. of Math., 50 (1949), pp. 401- 485.