Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ncpol2sdpa – Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
University of Borås, Faculty of Librarianship, Information, Education and IT.ORCID iD: 0000-0002-1539-8256
2015 (English)In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 41, no 3Article in journal (Refereed) Published
Resource type
Text
Abstract [en]

A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. We develop an implementation for problems of noncommuting problems that creates the relaxation to be solved by SDPA -- a high-performance solver that runs in a distributed environment. We further exploit the inherent sparsity of optimization problems in quantum physics to reduce the complexity of the resulting relaxations. Constrained problems with a relaxation of order two may contain up to a hundred variables. The implementation is available in Python. The tool helps solve problems such as finding the ground state energy or testing quantum correlations.

Place, publisher, year, edition, pages
2015. Vol. 41, no 3
Keyword [en]
semidefinite programming, SDP, polynomial optimization problem, noncommuting variables, Python, C++, symbolic calculation
National Category
Computational Mathematics
Research subject
Library and Information Science
Identifiers
URN: urn:nbn:se:hb:diva-8543DOI: 10.1145/2699464OAI: oai:DiVA.org:hb-8543DiVA: diva2:894328
Available from: 2016-01-14 Created: 2016-01-14 Last updated: 2017-11-30Bibliographically approved

Open Access in DiVA

fulltext(243 kB)182 downloads
File information
File name FULLTEXT01.pdfFile size 243 kBChecksum SHA-512
87af055b9ba9237a80f3cc5b4cbea9acb7659a65b1102dc839b4955ddf84edf46d5204f25e24bff9ceacf128efa5dff2c8de30ec59dad606e5e1e634831a314b
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Wittek, Peter
By organisation
Faculty of Librarianship, Information, Education and IT
In the same journal
ACM Transactions on Mathematical Software
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 182 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 130 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf