New paper with Nouédyn Baspin, Ray Li and Venkat Guruswami! arxiv.org/abs/2307.03283 These are bounds that relate the properties of a stabilizer code and its connectivity graph. I wrote a short blog post to go with it. thescaffolding.wordpress.com/2023/07/10/con…

Can we implement high-rate, low-overhead qLDPC codes on today’s quantum hardware, and use them to execute computations? For reconfigurable neutral atom quantum computers, looks like the answer is yes! Check out our paper at scirate.com/arxiv/2308.086… and upcoming talk at QEC2023!

We can implement qLDPC codes with favorable parameters in neutral atoms via physically moving qubits! Formally, there's no threshold, but for nearly all practical purposes, this is okay :) arxiv.org/abs/2308.08648

My favorite project so far. Fault-tolerant quantum computation might not be that far from practice if you could implement qLDPC codes!

Starting with a simpler version of a problem is always a good idea. To design better QLDPC code decoders, it could one could start with decoding erasures. Nice progress in that direction today: arxiv.org/abs/2310.07868

Nice work including a bunch of ideas to improve SSF decoders. I'm glad to see that they figured out how to generalize our VH decoder to correct Pauli errors (instead of erasures)!