Ani

Happy to share that some previous work with @krishnanirudh.bsky.social and @preskill.bsky.social that we call hierarchical codes (2303.04798) was recently published in Quantum! 1/9

Today in QEC on the arXiv: a new quantum version of a known decoder for classical LDPC codes
arxiv.org/abs/2310.07868
Specifically, it converts errors into erasures for hypergraph product codes

As Nicolas Delfosse (is he on here?) points out, erasure errors are easier to correct than Pauli errors. Viderman's algorithm is akin to UNION FIND in that it converts a Pauli error to an erasure. However, Viderman's algo is fine tuned for codes that are expand-y.

Expander bootstrapping "Every expander is a better expander". Ok, that admittedly doesn't make sense but it's a useful mnemonic for me to remember the main tool in a very cool paper that appeared in ITCS last year. They sho...

First post to bluesky! I am very happy to announce a new paper with Inbal Livni Navon and Mary Wootters! arXiv: arxiv.org/abs/2310.07868

In this blog post, I talk about developments in classical error correction that inspired this paper:
thescaffolding.wordpress.com/2023/10/13/e...