41 citations · 108 across the 17 of their papers we have counts for
6 papers · 1 filter
A lower bound on the overhead of addressable surgery on sparse stabiliser codes
Nouédyn Baspin
We show that, for stabilisers codes, there always exists a logical subspace requiring ancillary qubits to be measured with a sparse surgery ancilla. For CSS codes th…
2 Fast 2 Surgery: Fast surgery on QLDPC codes with space overhead
Nouédyn Baspin
We show that the fast surgery framework of Baspin-Berent-Cohen can be instantiated using at most ancilla qubits, improving on the previously achievable $O(n\c…
Non-CSS Quantum Code Embedding
Andrew C. Yuan, Nouédyn Baspin
We generalize the unified framework in [Phys. Rev. A 113, 022438 (2026)] to accommodate arbitrary stabilizer codes (referred as non-CSS for emphasis). The generalization has immedi…
4D and 5D Layer Codes through Color Routing
Andrew C. Yuan, Nouédyn Baspin
We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to dimensions. Much like its predecessor, the present construction…
Quantum Weight Reduction with Layer Codes
Andrew C. Yuan, Nouédyn Baspin, Dominic J. Williamson
Quantum weight reduction procedures ease the implementation of quantum codes by sparsifying them, resulting in low-weight checks and low-degree qubits. However, to date, only few q…
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Paul Webster, Lucas Berent, Omprakash Chandra +5
The realisation of utility-scale quantum computing inextricably depends on the design of practical, low-overhead fault-tolerant architectures. We introduce the Pinnacle Architectur…