Details

Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
ID Hrga, Timotej (Author), ID Klep, Igor (Author), ID Povh, Janez (Author)

.pdfPDF - Presentation file, Download (492,47 KB)
MD5: F9BB1CE60EFEC76A6FD622862797D660
URLURL - Source URL, Visit https://epubs.siam.org/doi/10.1137/22M1473340 This link opens in a new window

Abstract
Bell inequalities are pillars of quantum physics in that their violations imply that certain properties of quantum physics (e.g., entanglement) cannot be represented by any classical picture of physics. In this article Bell inequalities and their violations are considered through the lens of noncommutative polynomial optimization. Optimality of these violations is certified for a large majority of a set of standard Bell inequalities, denoted A2-A89 in the literature. The main techniques used in the paper include the NPA hierarchy, i.e., the noncommutative version of the Lasserre semidefinite programming (SDP) hierarchies based on the Helton-McCullough Positivstellensatz,the Gelfand-Naimark-Segal (GNS) construction with a novel use of the Artin-Wedderburn theory for rounding and projecting, and nonlinear programming (NLP). A new "Newton chip"-like technique for reducing sizes of SDPs arising in the constructed polynomial optimization problems is presented.This technique is based on conditional expectations. Finally, noncommutative Gröbner bases are exploited to certify when an optimizer (a solution yielding optimum violation) cannot be extracted from a dual SDP solution.

Language:English
Keywords:noncommutative polynomial, Bell inequality, violation, Gröbner basis, semidefinite programming, eigenvalue optimization, GNS construction, Artin-Wedderburn theory
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
FMF - Faculty of Mathematics and Physics
Publication status:Published
Publication version:Author Accepted Manuscript
Year:2024
Number of pages:Str. 1341-1373
Numbering:Vol. 34, iss. 2
PID:20.500.12556/RUL-175239 This link opens in a new window
UDC:519.8
ISSN on article:1052-6234
DOI:10.1137/22M1473340 This link opens in a new window
COBISS.SI-ID:197627907 This link opens in a new window
Publication date in RUL:22.10.2025
Views:508
Downloads:195
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Record is a part of a journal

Title:SIAM journal on optimization
Shortened title:SIAM j. optim.
Publisher:SIAM
ISSN:1052-6234
COBISS.SI-ID:12144985 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Projects

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0222-2022
Name:Algebra, teorija operatorjev in finančna matematika

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-50002-2023
Name:Realna algebraična geometrija v matričnih spremenljivkah

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2453-2020
Name:Matrično konveksne množice in realna algebraična geometrija

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3004-2021
Name:Hkratna podobnost matrik

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0057-2017
Name:Visoko zmogljiv reševalec za binarne kvadratične probleme

Funder:EC - European Commission
Project number:101017733
Name:QuantERA II ERA-NET Cofund in Quantum Technologies
Acronym:QuantERA II

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P2-0162-2022
Name:Večfazni sistemi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-1691-2019
Name:Weissova domneva in posplošitve

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J2-2512-2020
Name:Stohastični modeli za logistiko proizvodnih procesov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J5-2552-2020
Name:Napovedovanje sodelovanja med raziskovalci s pomočjo odkrivanja zakonitosti iz literature

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0071-2017
Name:Razširitev algoritmov prvega in drugega reda za izbrane razrede optimizacijskih problemov s ciljem rešiti računsko zahtevne industrijske probleme

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back