Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908902744915968 |
|---|---|
| author | Huang, Zixin Lami, Ludovico Singh, Vishal Wilde, Mark M. |
| author_facet | Huang, Zixin Lami, Ludovico Singh, Vishal Wilde, Mark M. |
| contents | Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_19911 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination Huang, Zixin Lami, Ludovico Singh, Vishal Wilde, Mark M. Quantum Physics Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms. |
| title | Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.19911 |