With a bit of delay, some highlights from the final day of #QIP2020: Starting with @wangxinfelix talking about quantifying the magic resources for quantum computation. 
Next up was Axel Dahlberg on the complexity of transforming graph states using
local Clifford operations, Pauli measurements and
classical communication.
local Clifford operations, Pauli measurements and
classical communication.
The final session of QIP saw some great QI talks, starting with @felix_led discussing Error Thresholds for Arbitrary Pauli Noise.
Followed by Ashutosh Goswami on Purely Quantum Polar Codes.
Next, @kunfang00 discussed two submissions: 1) A chain rule for the quantum relative entropy and 2) Geometric Renyi Divergence and its Applications in
Quantum Information Theory.
Quantum Information Theory.
I particularly liked this slide from @kunfang00's talk with open problems. One of which is credited to @markwilde and, I think, refers to this tweet:
One thought regarding the second open problem which I am very interested in: Maybe we already have a candidate from arxiv.org/abs/quant-ph/0… by @quantum_graeme, @JohnASmolin and A. Winter? Or do we know by now of any channels where the assisted and unass. capacities are different?
And the final speaker of #QIP2020 was @liyinan9252 with a very interesting talk on The Haemers Bound of Noncommutative Graphs.
