activity
20192026
most citedQuantifying nonlocality: how outperforming local quantum codes is expensive

41 citations · 108 across the 17 of their papers we have counts for

collaborators
Showing quant-phShow all

16 papers · 1 filter

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026★ 2 cited

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2024

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…

quant-ph2023★ 8 cited

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…

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★ 2 cited

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…

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…

quant-ph2021★ 41 cited

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…

quant-ph2021★ 35 cited

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…