Hosted by: Daniel Pitonyak

"Hypothesis testing is arguably the most common and elementary task in information processing (e.g., we constantly make decisions based on incomplete information). Its quantum version, quantum state discrimination, is likewise central in quantum information processing. The talk gives an introduction to the topic, focussing on discrimination of a large amount of identically prepared systems. In this limit, a powerful bound on the error rate can be derived. In classical statistics this is know as Chernoff bound. The quantum version of the Chernoff bound will be presented and discussed."