Prepare-and-measure scenarios with photon-number constraints
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912624335126528 |
|---|---|
| author | Carceller, Carles Roch i Pauwels, Jef Pironio, Stefano Tavakoli, Armin |
| author_facet | Carceller, Carles Roch i Pauwels, Jef Pironio, Stefano Tavakoli, Armin |
| contents | We study correlations in the prepare-and-measure scenario when quantum communication is constrained by photon-number statistics. Such constraints are natural and practical control parameters for semi-device-independent certification in optical platforms. To analyse these scenarios, we show how semidefinite programming relaxations for non-commutative polynomial optimization can be used to bound the set of quantum correlations under restrictions on the photon-number distribution. The practicality of this method is demonstrated by computing optimal performance bounds on several well-known communication tasks. We then apply the method to the certification of semi-device-inpependent random number generation protocols and show how to bound the conditional Shannon entropy. We showcase this versatile tool by improving randomness extraction in established protocols based on coherent states and homodyne measurements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_13000 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Prepare-and-measure scenarios with photon-number constraints Carceller, Carles Roch i Pauwels, Jef Pironio, Stefano Tavakoli, Armin Quantum Physics We study correlations in the prepare-and-measure scenario when quantum communication is constrained by photon-number statistics. Such constraints are natural and practical control parameters for semi-device-independent certification in optical platforms. To analyse these scenarios, we show how semidefinite programming relaxations for non-commutative polynomial optimization can be used to bound the set of quantum correlations under restrictions on the photon-number distribution. The practicality of this method is demonstrated by computing optimal performance bounds on several well-known communication tasks. We then apply the method to the certification of semi-device-inpependent random number generation protocols and show how to bound the conditional Shannon entropy. We showcase this versatile tool by improving randomness extraction in established protocols based on coherent states and homodyne measurements. |
| title | Prepare-and-measure scenarios with photon-number constraints |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2412.13000 |