activity
20172026
most citedTowards local testability for quantum coding

15 citations · 41 across the 5 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Local distillation from Reed Muller codes unfolding

Vivien Londe

We generalize the unfolding of a Reed Muller distillation factory of Ruiz et. al. by exhibiting the algebraic structure that the unfolding is based on. We describe a 2D local layou…

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…

quant-ph2021

Toward a Union-Find decoder for quantum LDPC codes

Nicolas Delfosse, Vivien Londe, Michael Beverland

Quantum LDPC codes are a promising direction for low overhead quantum computing. In this paper, we propose a generalization of the Union-Find decoder as adecoder for quantum LDPC c…

quant-ph2020★ 6 cited

Single-Shot Decoding of Linear Rate LDPC Quantum Codes with High Performance

Nikolas P. Breuckmann, Vivien Londe

We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, polynomial scaling distance and efficient decoding schemes. The code…

quant-ph2019★ 15 cited

Towards local testability for quantum coding

Anthony Leverrier, Vivien Londe, Gilles Zémor

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the -faces of the -cube (for ) and stabilizer constraints with faces of d…

quant-ph2017★ 6 cited

Golden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds

Vivien Londe, Anthony Leverrier

We adapt a construction of Guth and Lubotzky [arXiv:1310.5555] to obtain a family of quantum LDPC codes with non-vanishing rate and minimum distance scaling like where $n…