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 Theory in 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.
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.
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.
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.
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.