41 citations · 108 across the 17 of their papers we have counts for
19 papers
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…
Fast surgery for quantum LDPC codes
Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen
Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations…
The Free Energy Barrier: An Eyring-Polanyi bound for stabilizer Hamiltonians, with applications to quantum error correction
Nouédyn Baspin
The lack of an energy barrier in stabilizer Hamiltonians is well known to be an indication of short thermalisation times; and serves as a simple criteria to rule out self-correctio…
Stabilizer codes of less than two dimensions have constant distance
Nouédyn Baspin
The surface code is a two-dimensional stabiliser code with parameters . To this day, no stabiliser code with growing distance is know to live in less than two…
Wire Codes
Nouédyn Baspin, Dominic Williamson
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been d…
On combinatorial structures in linear codes
Nouédyn Baspin
In this work we show that given a connectivity graph of a quantum code, there exists , such that ,…
Layer Codes
Dominic J. Williamson, Nouédyn Baspin
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional localit…
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…
Improved rate-distance trade-offs for quantum codes with restricted connectivity
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna +1
For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi…
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…
Quantifying nonlocality: how outperforming local quantum codes is expensive
Nouédyn Baspin, Anirudh Krishna
Quantum low-density parity-check (LDPC) codes are a promising avenue to reduce the cost of constructing scalable quantum circuits. However, it is unclear how to implement these cod…
Connectivity constrains quantum codes
Nouédyn Baspin, Anirudh Krishna
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, a…
Qubits as edge state detectors: illustration using the SSH model
Meri Zaimi, Christian Boudreault, Nouédyn Baspin +3
As is well known, qubits are the fundamental building blocks of quantum computers, and more generally, of quantum information. A major challenge in the development of quantum devic…
Detecting topological edge states with the dynamics of a qubit
Meri Zaimi, Christian Boudreault, Nouédyn Baspin +4
We consider the Su-Schrieffer-Heeger (SSH) chain, which has 0, 1, or 2 topological edge states depending on the ratio of the hopping parameters and the parity of the chain length.…