The full paper can be found here 🙂

arxiv.org/abs/2505.10162 (6/6)

Our decoders work naturally with biased-noise qubits, like cat qubits, enabling fully local 1D quantum memories. The core ideas behind the signal-rule are also flexible, allowing for optimized variants or possible future extensions to surface code decoding. (5/6)

We also propose a variant on two rows of qubits to eliminate the need for any local classical memories, making it an appealing short-term solution. (4/6)

Turns out you actually only need a few bits per qubit to decode the quantum repetition code in 1D with good performance ! We propose the signal-rule decoder, that interpret odd parities as defects attracted by each other, through the exchange of point-like signals. (3/6)

Universal fault-tolerant quantum computation demands real-time error correction—with major hardware constraints and the need for fast, efficient decoders. We consider an alternative architecture, where decoding is performed locally by uniform application of a simple transition rule. (2/6)

High-performance local automaton decoder for defect matching in 1D, happy to share that our new work in with Anthony Leverrier, Mazyar Mirrahimi and @christophe.vuillot.info is now available on the arXiv ! 👀 (1/6)

First realization of a dissipatively stabilized squeezed cat qubit (a slight variation that we called a moon cat 🌛 actually), it was super interesting to work on this with experimentalists!
arxiv.org/abs/2502.07892
My two key takeaways ⬇️⬇️