Home on EPH

The motivation behind this post is to show some off some nice gifs.

A javascript demonstration of the perceptron algorithm, written for a reading group session.

With Nilanjana Datta.

We consider the geometry of the trace-ball of quantum states, find maximal and minimal states in a particular partial order called majorization, and use these states to construct local continuity bounds for quantum entropies.

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.

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.

A refinement and generalization of our previous work on Landauer’s Principle in repeated interaction systems.

Repeated interaction systems (RIS) Introduction to arrow of time A more careful description of the forward and backward processes Hypothesis testing on the arrow of time Connection to Landauer’s Principle I gave an informal talk today on the arrow of time…

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.

Update (21 May 18): It turns out this post is one of the top hits on google for “python travelling salesmen”!

I’m setting up a new laptop and figured it was a good chance to document setting up SublimeText for LaTeX, as quasi follow up to my recent post about live LaTeXing.

A friend suggested I write a guide about live notetaking in LaTeX, since it’s pretty useful and something I have a fair amount of experience with.

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.

My masters thesis; essentially, an expanded version of most of arXiv:1510.00533, in my own words.

I’ve been working on my thesisEdit: this was my master’s thesis over reading week, and I think I’ve finished my introduction to Landauer’s Principle.

Cantor’s Set Construction Properties Cantor’s function I wrote these notes in February 2016 for an Analysis 2 tutorial when I was a teaching assistant at McGill, and always intended to put them here eventually; before August 2018 though, I hadn’t translat…

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

Extremal combinatorics: Sperner systems, the Littlewood-Offord problem, intersecting hypergraphics, compression, Turan type problems, Ramsey theory, convexity, incidence problems, and algebraic methods.

Last semester, I helped a friend review McGill’s Analyis 3 course by trying to provide a better feel for completeness; this post will be a slightly edited version of that.

I’ve made a new blog!

“We study Landauer’s Principle for Repeated Interaction Systems (RIS) consisting of a reference quantum system \(\mathcal{S}\) in contact with a structured environment \(\mathcal{E}\) made of a chain of independent quantum probes; \(\mathcal{S}\) interacts

“The Haar measure allows integration over topological groups, which has many applications; for example, the use of the Haar measure in proving the Fully Quantum Slepian Wolf (or state transfer) protocol fundamental to quantum information theory is briefly…

“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.

“The black hole information paradox concerns the intersection of quantum mechanics and general relativity, so its resolution could point the way towards a quantum theory of gravity.

“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.

Introduction to metric spaces, topological spaces.

2013 University Physics Competition submisssion.

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.

“QSEP-CIRCUIT, as defined in a recent paper by Patrick Hayden, Kevin Milner, and Mark Wilde (http://arxiv.org/abs/1211.6120) in the computer science department here at McGill, is the problem of determining whether or not a quantum state given as a circuit…

“Synthesizing some of the literature on non-local games and communication complexity scenarios provides a deeper understanding of the fundamental differences between classical mechanics and quantum mechanics, as exemplified by the quantum violation of Bell