Achievable rates in non-asymptotic bosonic quantum communication
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909525215281152 |
|---|---|
| author | Mele, Francesco Anna Barbarino, Giovanni Giovannetti, Vittorio Fanizza, Marco |
| author_facet | Mele, Francesco Anna Barbarino, Giovanni Giovannetti, Vittorio Fanizza, Marco |
| contents | Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit $k$ qubits, distil $k$ Bell pairs, or generate $k$ secret-key bits, within a given error tolerance $\varepsilon$? In this work, we address this question by finding easily computable lower bounds on the non-asymptotic capacities of Gaussian channels. To derive our results, we develop new tools of independent interest. In particular, we find a stringent bound on the probability $P_{>N}$ that a Gaussian state has more than $N$ photons, demonstrating that $P_{>N}$ decreases exponentially with $N$. Furthermore, we design the first algorithm capable of computing the trace distance between two Gaussian states up to a fixed precision. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_05524 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Achievable rates in non-asymptotic bosonic quantum communication Mele, Francesco Anna Barbarino, Giovanni Giovannetti, Vittorio Fanizza, Marco Quantum Physics Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit $k$ qubits, distil $k$ Bell pairs, or generate $k$ secret-key bits, within a given error tolerance $\varepsilon$? In this work, we address this question by finding easily computable lower bounds on the non-asymptotic capacities of Gaussian channels. To derive our results, we develop new tools of independent interest. In particular, we find a stringent bound on the probability $P_{>N}$ that a Gaussian state has more than $N$ photons, demonstrating that $P_{>N}$ decreases exponentially with $N$. Furthermore, we design the first algorithm capable of computing the trace distance between two Gaussian states up to a fixed precision. |
| title | Achievable rates in non-asymptotic bosonic quantum communication |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.05524 |