[1]  Dropbox/EEB_RIS   (January 2020, 22 slides)
Entanglement-breaking properties of repeated interaction systems

A talk for the Quantum Information Processing group meeting at the Cavendish Laboratory discussing the results of arXiv:1902.08173 placed in the physical context of repeated interaction systems. In particular, I introduce the characterization of faithful eventually-entanglement breaking channels through a series of counterexamples.

[2]  Dropbox/BIID19_slides   (July 2019, 35 slides)
Entanglement breaking times for quantum Markovian evolutions

A talk at Beyond IID 2019 discussing the results of arXiv:1902.08173, which is work done in collaboration with Cambyse Rouzé and Daniel Stilck França.

[3]   (March 2019, 22 slides, 7 animations)
When do we lose correlations under partial Markovian evolution?

A brief presentation introducing partial Markovian evolution (classically), entanglement, and some of the results from arXiv:1902.08173, which was done in collaboration with Cambyse Rouzé and Daniel Stilck França. This talk was given at the March 2019 CCIMI retreat.

[4]  vimeo/251537549   (November 2017, 3:27 minutes)
Quantum Information Theory

Winning entry for the 2017 CCIMI video contest. Video:

Many thanks to falcxne for allowing use of his songs “Said You Wouldn’t Change” (from the album Timbits III), “I Hate Homework (Interlude)” (from Timbits II) and “NYC (Interlude)” (from Timbits III); you can find these and more at And thanks to Phillipe Faist for creating the entropy zoo and allowing me to use it in the video. For more details on the continuity bounds mentioned, you can find a preprint here, which is joint work with my supervisor, Dr. Nilanjana Datta.

Lastly, one clarification: in the video, I talk about the data-compression example in the language of classical information theory, for simplicity. However, the quantum case can be described in a very similar way, with the von Neumann entropy replacing the Shannon entropy.

[5]  Dropbox/EntropyLCBslides_May17   (May 2017, 7 slides)
Local continuity bounds for entropies of finite probability distributions

A presentation 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. These are the slides I gave accompanying my short talk, the video of which is here.

[6]  Dropbox/Autrans_talk_LP_in_RIS_2016   (July 2016, 34 slides)
Landauer’s Principle in Repeated Interaction Systems

The slides for the talk I gave at the Autrans summer school Stochastic Methods in Quantum Mechanics on my work with Alain Joye, Yan Pautrat, and Renaud Raquepas on Landauer’s Principle in repeated interaction systems.

[7]  Dropbox/LandauerRISWaterloo2016.pdf   (Winter 2016; 31 slides)
Landauer's Principle in RIS

Slides for a talk I gave to the Physics of Information lab at Waterloo, February 2016, about Landauer’s Principle in Repeated Interaction Systems. Based on the preprint arxiv/1510.00533.

[8]  Dropbox/LandauerPresentation.pdf   (Summer 2014; 53 slides)
Landauer's Principle

“Landauer’s principle states that the energy cost to erase one bit of information by the action of a thermal reservoir at equilibrium temperature $T$ is always at least $kT$, and provides an interesting link between information theory and physics. My goal is to discuss Landauer’s principle generally, and for the case of a 2 level system coupled to a thermal reservoir modelled by an XY spin chain (or sequence of spin-1/2 particles), using the tools of quantum statistical mechanics."

[9]  Dropbox/QsepStateInQMIPne.pdf   (Winter 2014; 17 slides)
QSEP-State is in QMIPne

“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 of QMIPne, which is the class of problems that can be solved by a computationally bounded quantum verifier exchanging messages with unentangled, computationally bounded, quantum provers."

[10]  Dropbox/Qsep-CircuitPresentation.pdf   (Summer 2013; 60 slides)

“QSEP-CIRCUIT, as defined in a recent paper by Patrick Hayden, Kevin Milner, and Mark Wilde ( in the computer science department here at McGill, is the problem of determining whether or not a quantum state given as a circuit is separable or not. The problem has been shown to be in QIP(2), and to be NP-hard and QSZK-hard, which lends credence to the idea that the problem is QMA-hard. The goal of this talk is to provide background for and explain in detail what QSEP-CIRCUIT and QMA are, explain why we care whether or not QSEP-CIRCUIT is QMA-hard, and hopefully showcase quantum information theory as an exciting and dynamic field. No background knowledge will be assumed."