- [1] Dropbox/Universal-bounds-poster-May19 (May 2019)
- A universal construction of tight continuity bounds for entropies (updated)
- [2] Dropbox/Duality_poster_2018 (July 2018, January 2019)
- Operational Duality between Classical Source Coding with QSI and C-Q Channel CodingSummary:
A poster on my work with Hao-Chung Cheng, my supervisor Nilanjana Datta, and Min-Hsiu Hsieh on operational duality of some quantum information-theoretic protocols, presented at the conference

*Beyond IID 2018*in Cambridge, UK in July 2018, and at*Quantum Information Processing*in Boulder, Colorado in January 2019. - [3] Dropbox/Universal-bounds-poster (August, December 2017)
- A universal construction of tight continuity bounds for entropiesSummary:
A poster on my work with my supervisor Nilanjana Datta on uniform continuity bounds for the single-partite entropies, presented at the conference

*Beyond IID 2017*in Singapore in August 2017, and the main conference of the thematic semester Analysis in Quantum Information Theory in Paris in December 2017. - [4] Dropbox/EntropyLCBPoster_May17 (May 2017)
- Local continuity bounds for entropies of finite probability distributionsSummary:
A poster on my work with my supervisor Nilanjana Datta on local continuity bounds for the entropies of finite distributions, presented at the one-day event

*High Dimensional Mathematics*. I gave a short “elevator pitch” to advertise the poster, the video recording of which is posted here. - [5] Dropbox/LP_RIS_poster_Nov16 (November 2016)
- Landauer's Principle in Repeated Interation SystemsSummary:
A poster on my work with Alain Joye, Yan Pautrat, and Renaud Raquepas on Landauer’s Principle in repeated interaction systems, presented at the one-day event

*CCIMI New Directions in the Mathematics of Information*. - [6] Dropbox/QSEP-State_Poster_Sep13 (September 2013)
- QSEP-STATE in QMIPneSummary:
A poster on my work with Chris Bahr, under the supervision of Patrick Hayden, on a quantum complexity theory problem about entanglement, presented at McGill University for an undergraduate computer science poster session. Abstract: The promise problem QSEP-STATE asks if a quantum state described by a circuit is close to a separable (not entangled) state across a given cut, or not. A quantum multiprover protocol was found to give an upper bound for the computational complexity problem of QMIPne, which is the class of problems that can be solved by a computationally bounded quantum verifier exchanging messages with unentangled, computationally unbounded, quantum provers.

A poster on my work with my supervisor Nilanjana Datta on uniform continuity bounds for the single-partite entropies, presented at the conference

Fifth London Symposium on Information Theoryin May 2019. This is an updated version of the poster which includes new results giving necessary and sufficient conditions for the Rényi entropy to be Lipschitz continuous.