Vincent Steffan

Planar low-overhead quantum memories with only nearest-neighbour gates

Abstract High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-range connectivity or qubit shuttling, both of which are difficult to realise in superconduct...

Logical Operators and Derived Automorphisms of Tile Codes

The recently introduced tile codes are a promising alternative to surface codes, combining two-dimensional locality with higher encoding efficiency. While surface codes are well understood in terms of their logical operators and boundary behavior, much less is known about tile co...