Minimax discrimination of two Pauli channels
Abstract
We consider the problem of optimally discriminating two Pauli channels in the minimax strategy, maximizing the smallest of the probabilities of correct identification of the channel. We find the optimal input state at the channel and show the conditions under which using entanglement strictly enhances distinguishability. We finally compare the minimax strategy with the Bayesian one.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.