Nouédyn Baspin

most citedA lower bound on the overhead of quantum error correction in low dimensions

4 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

cs.IT2023★ 1 cited

On combinatorial structures in linear codes

Nouédyn Baspin

In this work we show that given a connectivity graph $G$ of a $[[n, k, d]]$ quantum code, there exists ${K_{i}}_{i}, K_{i} \subset G$ , such that $\sum_{i} ∣ K_{i} ∣ \in Ω (k), ∣ K_{i} ∣ \in Ω (d)$ ,…

quant-ph2023

Simulating LDPC code Hamiltonians on 2D lattices

Harriet Apel, Nouédyn Baspin

While LDPC codes have been demonstrated with desirable error correcting properties, this has come at a cost of diverging from the geometrical constraints of many hardware platforms…

quant-ph2023★ 4 cited

A lower bound on the overhead of quantum error correction in low dimensions

Nouédyn Baspin, Omar Fawzi, Ala Shayeghi

We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitra…