Excited to share our paper arxiv.org/abs/2604.16209 on ultra-high-rate codes co-designed for atom arrays! We co-design qLDPC codes with rates around 1/2, showing that they can reach good logical error rates under a circuit-level noise model. This was a fun project with Chen, Nishad, Casey and Andi.

Great program this year!

Accepted submissions for QEC26 are out: qec-conference.org/2026/accepte.... Congratulations! If you are attending QEC, a few reminders below:

This is a good example of why you should be cautious when extrapolating to the low logical error rate regime arxiv.org/abs/2604.08358

I would bet against Q day by 2030, but I wouldn't bet against it at 10:1 odds. ~10% risk is unacceptably high here, so I'm very in favor of transitioning to quantum-safe cryptography by 2029: blog.google/innovation-a... Yes this means I 90% expect to be made fun of in 2030. Oh well.

Don't know what Quantum Youtube is, but 👍

Good old code surgery, now more parsimonious than ever. arxiv.org/abs/2603.05082 Joint work with amazing collaborators Andrew Yuan, Alex Cowtan, David Lin, and Dom Williamson.

Gave a talk recently at Coogee on constructing and analysing spacetime volumes of LDPC codes & surgeries thereof. Thanks to @sunnyhe.bsky.social @domwilliamson.bsky.social and Ted Yoder for the wonderful collaboration. www.youtube.com/watch?v=Lxzw...

Quantum code surgery: fast, addressable, parallel, (almost) constant space overhead, all at once on your favorite hypergraph product codes. arxiv.org/abs/2603.021...

Excited to share our perspective article, written with Maddie Cain and Misha Lukin, on designing low-overhead fault-tolerant architectures: rdcu.be/eVTiB. The landscape is rapidly evolving, and excited to see where the field goes next!

Fault-tolerant logical measurement just got a lot faster! In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot). arxiv.org/abs/2510.14895

Quantum code surgery, but get them for constant time a piece if you run many of them. arxiv.org/abs/2510.14895 Joint work with Alex Cowtan, Dom Williamson and Ted Yoder.

Have you heard of high-density parity-check codes before? Anyways, layer codes with random HDPC input codes have provable and numerical partial self-correction properties. arxiv.org/abs/2510.06659 Joint work with Shouzhen Gu, Libor Caha, Shin Ho Choe, Aleksander Kubica, and Eugene Tang.

Check it out: permutation unitaries in the 3rd level of the Clifford hierarchy whose inverses escape any fixed, finite level of the hierarchy. arxiv.org/abs/2510.04993 Joint work with Luke Robitaille and Xinyu (Norah) Tan.

Can ChatGPT help with research? Maybe not yet for finding new results, but it can certainly speed up some tedious tasks. An example about quantum Tanner codes #qLDPC Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)

Peter Shor receives a small gift on the 30th anniversary of his QEC paper at #QEC2025.

Very exciting announcement, the next Quantum Error Correction conference QEC26 will be hosted by Google 7-12 June 2026 in Santa Barbara. See you there! @dripto.bsky.social @mattmcewen.bsky.social

Fault-tolerance is, at its core, a combinatorial study. arxiv.org/abs/2508.08246

The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there! qip2026.lu.lv

In May I gave a talk at Simons about our recent work on extractors architectures, which is a surgery-powered proposal to perform universal Pauli-based computation on any QLDPC codes, with reasonable overheads. arxiv.org/abs/2503.10390 The talk recording is here: www.youtube.com/watch?v=L6cDAbaW2Zs

Our paper on logical magic state distillation was just published in Nature! www.nature.com/articles/s41...

New preprint out!! scirate.com/arxiv/2507.0... Here, we follow up our previous work by constructing the first asymptotically good quantum codes to have transversally addressable non-Clifford gates.

Raymond Laflamme 1960-2025. A great scientist, renowned for his pioneering contributions to quantum error correction. A great leader, founding director of the Institute for Quantum Computing. A great colleague and teacher whose legacy continues to inspire us. uwaterloo.ca/institute-fo...

Amazing work from the IBM Quantum team on the bicycle architecture, a proposal for a modular quantum computer built using bivariate bicycle codes as memory and code surgery + automorphisms + T state factory for universal computation. arxiv.org/abs/2506.03094

It's a thrill to announce names of the amazing set of theory people joining NYU CS+CSE this year: @aineshbakshi.bsky.social, Allen Liu, @fermima.bsky.social, Sanjeev Khanna, Tony Metger, and Juan Perdomo. @nyucourant.bsky.social @nyutandon.bsky.social

Great work by the IBM Quantum team on Relay-BP, a BP-only heuristic decoder for general qLDPC codes. From a first look, the performance seems strong and further supports qLDPC architectures from a decoding-focused perspective. arxiv.org/abs/2506.01779

I'm often asked if I'll redo the 2019 quantum factoring estimate. Denser storage by yokes, smaller magic factories by cultivation, slimmer approx arithmetic by Chevignard et al… surely the cost is lower now? Yes, it's lower now. security.googleblog.com/2025/05/trac... arxiv.org/abs/2505.15917

Mike finally paid for the "pro" version of sketchup, so we owned the 3d models attached to the paper, meaning the yoked surface codes paper is now published! www.nature.com/articles/s41... The message of this paper is: anytime someone says they're 10x better than surface codes, actually it's 4x.

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

For sigbovik, I factored all 8 bit ints (up to 255) with a quantum computer github.com/strilanc/fal... I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing. It took 121 quantum samples to finish the entire task. But...

Only one week left to submit a contributed talk to QEC 25! qec25.yalepages.org August 11 - 15, 2025, hosted at Yale University. This promises to be the best QEC yet! Please repost!

QLDPC codes are a promising approach to efficient quantum memory. However, performing computation on such high-density memory is notoriously difficult. In a new work, we introduce extractors, which can be attached to any code block to augment it into a quantum processor. arxiv.org/abs/2503.10390