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:
logical error rate of the neural decoder as a function of physical error rate. The power law fit is a smaller exponent at lower physical error rates than at higher physical error rates.
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.
This is joint work with amazing collaborators Katie Chang, Ted Yoder, Guanyu Zhu, and Tomas Jochym-O'Connor 😎
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.
A meme on how arXiv/quant-ph and scirate is currently flooded with QIP submissions. quant-ph is depicted as a city upon which three tidal waves of increasing height are collapsing. The smallest one is titled "< 8 Oct", the middle one "QIP papers 9 Oct" and the largest one "QIP papers 10 Oct".
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
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
The slides are posted here: sunnyzhiyanghe.github.io/files/Extrac...
Simons was fun as always, many thanks to the organizers of the reunion workshop!
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
We spent a wonderful summer (and months after) designing, running and analyzing this experiment. It was magical seeing theoretical predictions being observed in practice. Many, many thanks to my amazing collaborators at QuEra and Harvard!
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...
The paper presented solid benchmarking results, utilizing their recent work on Relay-BP, a BP-only decoder that is out-performing BP+OSD in their numerics. arxiv.org/abs/2506.01779. The fitted error rates come from an upcoming work, which I’m really looking forward to. See their Appendix A.7.
In section 1 the paper discussed a list of bicycle instructions, which are native operations supported on this architecture. So for everyone wondering “what logical operations are easy/reasonable on the BB codes”, here is your answer!