A new theoretical result solves two fundamental quantum information tasks—entanglement testing and entanglement distillation—by proving a generalized quantum Sanov's theorem. The key finding is that the asymptotic error exponent for both tasks equals the reverse relative entropy of entanglement, a quantity that can be computed
Table of contents
Equivalence between entanglement distillation and entanglement testingOn entropies and their (non-)additivityAxiomatic approachMax-relative entropy and the blurring lemmaClassical generalized Sanov’s theoremLifting from classical to quantumSort: