A simple proof of Renner's exponential de Finetti theorem
  We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all calculations, including any use of the theory of types. 
Thomas Vidick, Henry Yuen
quant-ph