My work has been presented at (amongst others):

- Conference on Quantum Information Processing (QIP)
- International Cryptology Conference (CRYPTO)
- International Conference on Quantum Cryptography (QCrypt)
- Asian Quantum Information Science Conference (AQIS)
- IEEE International Symposium on Information Theory (ISIT)

A full list of my talks is included in my CV.

### Slides

**Matrix trace inequalities for quantum entropy**[CWI Amsterdam, QuSoft (2018)]

[Analysis in Quantum Information Theory (2017), Institut Henri Poincaré Paris]**The road to quantum computers**[IBP event Quantum Technologies (2017), Imperial College London]

**On composite hypothesis testing**[Seminar University of York (2017)]

**Multivariate trace inequalities**[QMath13: Mathematical Results in Quantum Physics (2016), GeorgiaTech]

**Strong converse rates for private communication over quantum channels**[Beyond I.I.D. in Information Theory Workshop (2017), Singapore]

[Secure communication via Quantum Channels (2017), Center for Interdisciplinary Research – ZiF, Bielefeld][Conference on the Theory of Quantum Computation, Communication and Cryptography – TQC (2016), Free University of Berlin]

**Exploiting variational formulas for quantum relative entropy**[Conference on the Theory of Quantum Computation, Communication and Cryptography – TQC (2016), Free University of Berlin]

[IEEE International Symposium on Information Theory – ISIT (2016), Barcelona]**Quantum coding with finite resources**

[Seminar at Technical University of Munich (2016)]

[American Physical Society March meeting (2016), Baltimore, see their page for interactive slides]

[Colloquium at the Institute for Quantum Computing, University of Waterloo (2015)]**Quantum bilinear optimization**

[SIAM Conference on Optimization, Vancouver (2017)]

[CWI Amsterdam, QuSoft (2016)]

[Seminar at Louisiana State University, Hearne Institute for Theoretical Physics (2016)]**Semidefinite programming hierarchies for quantum adversaries**

[International Conference on Quantum Cryptography – QCrypt (2015), Tokyo, video feed]

[Trustworthy Quantum Information Workshop (2015), Ann Arbor]

[Southwest Quantum Information and Technology Workshop – SQuInT (2015), Berkeley]**Relative entropies of recovery and conditional quantum mutual information**[Beyond I.I.D. in Information Theory Workshop (2015), Banff, blackboard talk (video feed linked)]

**Quantum adversaries via operator space theory**

[Western States Mathematical Physics Meeting (2015), Caltech]**Entropy inequalities**

[School in Quantum Information and Computation (2015), University of Campina Grande]**The uncertainty principle in the presence of quantum memory**

[Physics Colloquium at Louisiana State University (2014), interactive Prezi presentation]**Identifying the information gain of a quantum measurement**

[IEEE International Symposium on Information Theory (2014), Honolulu]**Channel simulations**

[Beyond I.I.D. in Information Theory Workshop (2013), Cambridge]**Quantum to classical randomness extractors**

[Advances in Cryptology – CRYPTO (2012), Santa Barbara]

[International Conference on Quantum Cryptography – QCrypt (2012)]**Entanglement cost of quantum channels**

[IEEE International Symposium on Information Theory – ISIT (2012), Boston]**A conceptually simple proof of the quantum reverse Shannon theorem**

[Conference on Theory of Quantum Computation, Communication, and Cryptography – TQC (2010), Leeds]

[Workshop on Complex Quantum Systems (2010), Singapore]

### Other recent presentations

**Entropy for multipartite quantum systems**[European Research Council Brussels (2017)]

**Conditional Decoupling of Quantum Information**

[Information and Complexity Day, École Normale Supérieure de Lyon (2016) & Seminar at Technical University of Munich (2016/2017) & ETH Zurich (2017) & University of Technology Sydney (2017)]**The Quantum Revolution in Cryptography**

[Imperial College London, Department of Computing (2016)]**Quantum entropy**

[Seminar at Stanford University & University of Sydney (2016)]

(slides/notes available upon request)