activity
20122025
most citedAlmost-linear time decoding algorithm for topological codes

226 citations · 1.4k across the 31 of their papers we have counts for

collaborators

33 papers

quant-ph2025★ 6 cited

Quantum error correction for long chains of trapped ions

Min Ye, Nicolas Delfosse

We propose a model for quantum computing with long chains of trapped ions and we design quantum error correction schemes for this model. The main components of a quantum error corr…

quant-ph2024

Correction of circuit faults in a stacked quantum memory using rank-metric codes

Nicolas Delfosse, Gilles Zémor

We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error corre…

quant-ph2023★ 5 cited

How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off

Nicolas Delfosse, Andres Paz, Alexander Vaschillo +1

Achieving practical quantum advantage requires a classical decoding algorithm to identify and correct faults during computation. This classical decoding algorithm must deliver both…

quant-ph2023

Splitting decoders for correcting hypergraph faults

Nicolas Delfosse, Adam Paetznick, Jeongwan Haah +1

The surface code is one of the most popular quantum error correction codes. It comes with efficient decoders, such as the Minimum Weight Perfect Matching (MWPM) decoder and the Uni…

quant-ph2023★ 11 cited

Spacetime codes of Clifford circuits

Nicolas Delfosse, Adam Paetznick

We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Cliffo…

quant-ph2022★ 14 cited

Fast erasure decoder for hypergraph product codes

Nicholas Connolly, Vivien Londe, Anthony Leverrier +1

We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show…