collaborators

9 papers

quant-ph2026

Fast logical operations in quantum LDPC codes using simple resource states

Mark Webster, Nicolas Delfosse

Quantum LPDC codes provide a substantial reduction in qubit overhead required for fault-tolerant quantum computation compared to surface code, thanks to their high encoding rate. H…

quant-ph2026

Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks

Aydin Deger, Stergios Koutsioumpas, Mark Webster +3

We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…

quant-ph2026

Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

Felix Tripier, Woo Chang Chung, Jacob Young +15

We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed descrip…

quant-ph2026

Distance-Finding Algorithms for Quantum Codes and Circuits

Mark Webster, Abraham Jacob, Oscar Higgott

The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing…

quant-ph2025

Low-overhead Magic State Circuits with Transversal CNOTs

Nicholas Fazio, Mark Webster, Zhenyu Cai

With the successful demonstration of transversal CNOTs in many recent experiments, it is the right moment to examine its implications on one of the most critical parts of fault-tol…

quant-ph2025

Colour Codes Reach Surface Code Performance using Vibe Decoding

Stergios Koutsioumpas, Tamas Noszko, Hasan Sayginel +2

Two-dimensional quantum colour codes hold significant promise for quantum error correction, offering advantages such as planar connectivity and low overhead logical gates. Despite…