A *very* enthusiastic yes for both!

Thanks for sharing! I would have missed this gem if not for your crisp expository note.

I strongly recommend Tobias Osborne's lectures on general relativity. They are full of insight and lots of fun to watch.
www.youtube.com/playlist?lis...

Would you recommend Open World?

Thanks! It depends for which object. For RLDCs, we have this lower bound: eccc.weizmann.ac.il/report/2025/...

For PCPPs and dPCPs, in general that’s a big open problem, but one can view c^3 LTCs as codes augmented with PCPPs.

A personal note: I might be biased, but Cambridge is a truly magical place. I couldn’t imagine a better place to live and work.

The de-quantization behind this new work strongly relies on the earlier breakthrough of Jop Briët and Davi Castro-Silva (arxiv.org/abs/2505.13134) — their contributions were essential to making this possible.

This was a really fun collaboration with the amazing Srinivasan Arunachalam, Davi Castro-Silva, and Arkopal Dutt. We suspect there is a fundamental connection between additive combinatorics and quantum computing, and it would be interesting to deepen our understanding of it.