5 papers · 1 filter
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
Boren Gu, Tamas Noszko, Vincent Steffan +4
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-ra…
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Shin Ho Choe, Vincent Steffan, Florian Vigneau +5
The major challenge on the way to fault-tolerant quantum computing comes from the insufficient quality of hardware components and the difficulty of scaling their number without fur…
Logical Operators and Derived Automorphisms of Tile Codes
Nikolas P. Breuckmann, Shin Ho Choe, Jens Niklas Eberhardt +2
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 un…
Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary
Vincent Steffan, Shin Ho Choe, Nikolas P. Breuckmann +2
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for…
Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions
Jens Niklas Eberhardt, Francisco Revson F. Pereira, Vincent Steffan
Quantum low-density parity-check codes are promising candidates for quantum error correcting codes as they might offer more resource-efficient alternatives to surface code architec…