Semidefinite block-matrix relaxations for computing quantum correlations
arXiv QuantumArchived Mar 23, 2026✓ Full text saved
arXiv:2603.19388v1 Announce Type: new Abstract: Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant types of constraints. Here, we propose a semidefinite relaxation methodology that can incorporate a breadth of constraints needed in various quantum correlation problems, thereby generalising the seminal Navascu\'e
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 19 Mar 2026]
Semidefinite block-matrix relaxations for computing quantum correlations
Nicola D'Alessandro, Carles Roch i Carceller, Armin Tavakoli
Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant types of constraints. Here, we propose a semidefinite relaxation methodology that can incorporate a breadth of constraints needed in various quantum correlation problems, thereby generalising the seminal Navascués-Pironio-Acín hierarchy. It yields useful results at reasonable computational cost. We showcase the methodology and its features by using it to address five different quantum information problems. These are (i) entanglement witnessing from imperfect measurement devices, (ii) certifying measurements from fidelity-constrained sources, (iii) computing dimensionality in genuine multi-particle entangled states, (iv) benchmarking dimensionality for state preparation devices, and (v) finding uncertainty relations for nearly anti-commuting observables. These applications reflect both the usefulness and versatility of the methodology, as well as its potential for broader relevance in the field.
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2603.19388 [quant-ph]
(or arXiv:2603.19388v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.19388
Focus to learn more
Submission history
From: Nicola D'Alessandro [view email]
[v1] Thu, 19 Mar 2026 18:25:31 UTC (89 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-03
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)