Achievable Identification Rates in Noisy Bosonic Broadcast Channels

TL;DR

This paper investigates the limits of message verification in noisy bosonic quantum channels, deriving achievable identification rates using quantum hypothesis testing and discrete approximations, advancing understanding in infinite-dimensional quantum communication.

Contribution

It introduces new achievable identification rate regions for noisy bosonic broadcast channels using coherent states and hypothesis testing techniques.

Findings

Derived achievable identification rate regions under noise constraints

Utilized quantum hypothesis testing for rate analysis

Approximated infinite alphabets with discrete subsets

Abstract

Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its behaviour in bosonic systems remains less understood. This work analyses identification over noisy bosonic broadcast channels using coherent states. We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting. Our approach leverages quantum hypothesis testing and approximates the infinite sender alphabet with discrete subsets to maintain power constraints.