IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-0769-0_21.html
   My bibliography  Save this book chapter

SDP Relaxations for Non-Commutative Polynomial Optimization

In: Handbook on Semidefinite, Conic and Polynomial Optimization

Author

Listed:
  • Miguel Navascués

    (University of Bristol)

  • Stefano Pironio

    (Laboratoire d’Information Quantique)

  • Antonio Acín

    (Mediterranean Technology Park
    ICREA-Institució Catalana de Recerca i Estudis Avançats)

Abstract

We consider the problem of minimizing an arbitrary hermitian polynomial p(X) in non-commutative variables X = (X1, …, XN), where the polynomial p(X) is evaluated over all states and bounded operators (X1, …, Xn) satisfying a finite set of polynomial constraints. Problems of this type appear frequently in areas as diverse as quantum chemistry, condensed matter physics, and quantum information science; finding numerical tools to attack them is thus essential. In this chapter, we describe a hierarchy of semidefinite programming relaxations of this generic problem, which converges to the optimal solution in the asymptotic limit. Furthermore, we derive sufficient optimality conditions for each step of the hierarchy. Our method is related to recent results in non-commutative algebraic geometry and can be seen as a generalization to the non-commutative setting of well-known semidefinite programming hierarchies that have been introduced in scalar (i.e. commutative) polynomial optimization. After presenting our results, we discuss at the end of the chapter some open questions and possible directions for future research.

Suggested Citation

  • Miguel Navascués & Stefano Pironio & Antonio Acín, 2012. "SDP Relaxations for Non-Commutative Polynomial Optimization," International Series in Operations Research & Management Science, in: Miguel F. Anjos & Jean B. Lasserre (ed.), Handbook on Semidefinite, Conic and Polynomial Optimization, chapter 0, pages 601-634, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-0769-0_21
    DOI: 10.1007/978-1-4614-0769-0_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gribling, Sander & Laat, David de & Laurent, Monique, 2017. "Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization," Other publications TiSEM 2dddf156-3d4b-4936-bf02-a, Tilburg University, School of Economics and Management.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4614-0769-0_21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.