University of Cambridge > Talks.cam > Information Theory Seminar > Classical Reductions and Converse Bounds in Quantum Hypothesis Testing

Classical Reductions and Converse Bounds in Quantum Hypothesis Testing

Download to your calendar using vCal

  • UserDr Gonzalo Vazquez-Vilar, Universidad Carlos III de Madrid
  • ClockWednesday 06 May 2026, 14:00-15:00
  • HouseMR5, CMS Pavilion A.

If you have a question about this talk, please contact Dr Varun Jog .

Abstract: Quantum hypothesis testing is central to quantum information theory, with applications in communication and error correction. In this talk, we study the performance limits of quantum hypothesis testing in both non-asymptotic and asymptotic regimes. Using the Nussbaum–Szkoła mapping, which reduces the quantum binary hypothesis testing problem to a classical surrogate, we derive non-asymptotic converse bounds that provide a unified treatment of small, moderate, and large deviations. We also show that the M-ary hypothesis testing problem admits an exact binary formulation, reducing its analysis to a single structured test. Overall, this talk illustrates how classical methodologies can provide both intuitive insight and powerful analytical tools for understanding quantum information processing tasks.

This talk is part of the Information Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity