Infinite Dimensional Asymmetric Quantum Channel Discrimination
Bjarne Bergh, Jan Kochanowski, Robert Salzmann, Nilanjana Datta

TL;DR
This paper extends quantum channel discrimination theory to infinite dimensions, establishing key lemmas, showing asymptotic equivalence of strategies, and providing explicit bounds and examples.
Contribution
It proves quantum Stein's lemma for infinite-dimensional channels, demonstrates the additivity of geometric R\'enyi divergence, and constructs explicit bounds relating adaptive and parallel strategies.
Findings
Adaptive strategies offer no asymptotic advantage over parallel ones under certain conditions.
The geometric R\'enyi divergence satisfies a chain rule and is additive for channels in infinite dimensions.
Explicit bounds are provided for the difference in discrimination errors between strategies.
Abstract
We study asymmetric binary channel discrimination, for qantum channels acting on separable Hilbert spaces. We establish quantum Stein's lemma for channels for both adaptive and parallel strategies, and show that under finiteness of the geometric R\'enyi divergence between the two channels for some , adaptive strategies offer no asymptotic advantage over parallel ones. One major step in our argument is to demonstrate that the geometric R\'enyi divergence satisfies a chain rule and is additive for channels also in infinite dimensions. These results may be of independent interest. Furthermore, we not only show asymptotic equivalence of parallel and adaptive strategies, but explicitly construct a parallel strategy which approximates a given adaptive -shot strategy, and give an explicit bound on the difference between the discrimination errors for these two strategies. This…
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 Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Complexity and Algorithms in Graphs
