Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.19612 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908902239502336 |
|---|---|
| author | Chen, Shin-Liang Miklin, Nikolai |
| author_facet | Chen, Shin-Liang Miklin, Nikolai |
| contents | Self-testing is a phenomenon where the use of specific quantum states or measurements can be inferred solely from the correlations they generate. We introduce a universal method for conducting robustness analysis in the self-testing of various quantum resources. Unlike previous numerical approaches, which rely on selecting specific isometries, our method optimizes over equivalence transformations, thereby leading to tighter robustness bounds. This optimization employs the well-established technique of semidefinite programming relaxations for non-commuting polynomial optimization. Our method can be universally applied to diverse self-testing settings, including steerable assemblages in the Bell scenario, constellations of quantum states in the prepare-and-measure scenario, and entangled states in the steering scenario. We demonstrate the method's capability to surpass previously reported robustness bounds across a range of concrete examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_19612 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Universal method for optimized robustness in self-testing of quantum resources Chen, Shin-Liang Miklin, Nikolai Quantum Physics Self-testing is a phenomenon where the use of specific quantum states or measurements can be inferred solely from the correlations they generate. We introduce a universal method for conducting robustness analysis in the self-testing of various quantum resources. Unlike previous numerical approaches, which rely on selecting specific isometries, our method optimizes over equivalence transformations, thereby leading to tighter robustness bounds. This optimization employs the well-established technique of semidefinite programming relaxations for non-commuting polynomial optimization. Our method can be universally applied to diverse self-testing settings, including steerable assemblages in the Bell scenario, constellations of quantum states in the prepare-and-measure scenario, and entangled states in the steering scenario. We demonstrate the method's capability to surpass previously reported robustness bounds across a range of concrete examples. |
| title | Universal method for optimized robustness in self-testing of quantum resources |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.19612 |