Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination
Zixin Huang, Ludovico Lami, Vishal Singh, Mark M. Wilde

TL;DR
This paper develops new bounds and computational tools for discriminating bosonic quantum channels under energy constraints, advancing quantum sensing and communication capabilities.
Contribution
It introduces an energy-constrained chain rule for the Belavkin-Staszewski divergence and SDP-based bounds for channel discrimination error exponents.
Findings
SDP formulations for relative entropy measures under energy constraints
Optimal probes are Fock-diagonal states
Practical benchmarks for quantum-limited sensing
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
