Error Correction Zoo

Error Correction Zoo

@eczoo.bsky.social

Repository and taxonomy of encodings to robustly store and process classical or quantum information. Recent results and highlights. 1000 codes and counting! https://errorcorrectionzoo.org/ https://discord.gg/gg3pJZNYxQ

785 followers2 following62 posts

Pinned

And if you have an EC or QEC paper, consider getting an agent to push to the Zoo!

Victor V. Albert@vva.bsky.social

We're at a strange, specific moment. Takes range from "publications are dead by fall" to "I tried LLMs in November, they were bad." If you have an LLM-assisted paper, take full responsibility as usual. Do everything: arXiv, GitHub, website, and integrate with databases if appropriate.

The forward-looking Oratomic time-efficient architecture claims to "potentially enable runtimes of 10 days for ECC–256 with ≈26,000 qubits, and 97 days for RSA–2048 with ≈102,000." This is based on stitching together several gadgets and plausibly assuming they can work together on an atom platform.

View full thread

On the hardware side, serious players will be looking to create scalable foundry-level tools for atom-based devices like those for chip-based hardware. One thing Team Atoms always has going for them: Nature made all atoms identical!

Assuming these estimates hold up, the number of physical qubits already made in the lab and the number required for running utility-scale algorithms would be, for the first time, in the same ballpark. Given Google's parallel paper and move to scope out atom platforms, people are starting to notice.

The forward-looking Oratomic time-efficient architecture claims to "potentially enable runtimes of 10 days for ECC–256 with ≈26,000 qubits, and 97 days for RSA–2048 with ≈102,000." This is based on stitching together several gadgets and plausibly assuming they can work together on an atom platform.

View full thread

Shor's algorithm has lots of moving parts, and runtimes are improving every year. The non-geometrically local connectivity of neutral atoms enables further reductions using QLDPC codes. There is plenty of room at the bottom here: QLDPC is the bleeding edge.

Many gadgets have yet to be fully optimized for the QLDPC + neutral atom combination. This optimization is crucial, as atom-based platforms are natively slower than chip-based platforms by orders of magnitude.

The forward-looking Oratomic time-efficient architecture claims to "potentially enable runtimes of 10 days for ECC–256 with ≈26,000 qubits, and 97 days for RSA–2048 with ≈102,000." This is based on stitching together several gadgets and plausibly assuming they can work together on an atom platform.

The paper punts the LLM-assisted QEC codes used for the time-efficient estimate to future work. We are left to speculate why they were omitted. Perhaps time pressure, perhaps novel constructions too hard to explain for now.

"Third, implementation of real-time QEC with sufficiently high throughput and latency may favor using simple decoders (e.g., cellular automata), which may not be compatible with the most resource-efficient QEC codes."

"For decades, experimental progress on QEC lagged far behind theory, but this is starting to change."

John Preskill@preskill.bsky.social

When and how will quantum computing broadly benefit humanity? Despite exhilarating recent progress, we still don’t know. Here my friend Jens Eisert and I assess the current status and the challenges ahead. arxiv.org/abs/2510.19928

In closing of #qec2025, we have put up our 1000th code -- the [[8,3,2]] surface code on a cube (aka the Landahl plucky code)! It is a non-CSS code different from the smallest interesting color code. Stabilizer generators are X, Y, or Z strings on the faces. errorcorrectionzoo.org/c/cubic_surf...

errorcorrectionzoo.org\([[8,3,2]]\) Surface code on a cubeAn [[8,3,2]] twist-defect surface code whose qubits lie on the vertices of a cube. It is obtained by three-coloring the faces of a cube and placing X, Y, and Z stabilizer generators on each pair of fa...

We mourn the loss of one of the founders of the QEC (Knill-Laflamme) conditions and one of the first to write down the five qubit code (aka the Laflamme code). errorcorrectionzoo.org/c/stab_5_1_3

John Preskill@preskill.bsky.social

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...

Error Correction Zoo reposted

Ted Yoder summarised the onslaught of qLDPC logic papers (for fixed architectures) from IBM (and others). I’ve read most/some of these papers but had a few gaps remaining in my understanding before today …

Error Correction Zoo reposted

📣 Call for Papers (EXTENDED DEADLINE!) 📣 The deadline for the IEEE BITS Special Issue on Error-Correcting Codes has now been extended by about two weeks. The new deadline for the 3-page "white paper" is now May 2, 2025: www.itsoc.org/sites/defaul...

itsoc.orgitsoc.org

CALL FOR PAPERS: With Robert Calderbank, Krishna Narayanan, Henry Pfister and Mary Wootters, I'm editing a special issue of the IEEE BITS magazine on Error-Correcting Codes & invite expository/tutorial articles. Deadline: April 17 (white paper). Please circulate widely. www.itsoc.org/sites/defaul...

Error Correction Zoo reposted

Huge congratulations to my amazing student Yeyuan Chen (+co-author Zihan Zhang of OSU advised by Zeyu Guo) for being awarded the STOC 2025 Best Student Paper Award! Their monumental result proves that explicit Reed-Solomon codes can correct more errors than previously known: arxiv.org/abs/2408.15925

arxiv.orgExplicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton BoundsIn this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\ge1.$ Specifically, we show the following: (1) FRS code of length $...

We’re excited to share updates ensuring the long-term sustainability of the EC Zoo. To continue delivering great content and improving your experience, we’re introducing a new subscription-based model. Check out our website for more detailed information!