6 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…
Cups and Gates I: Cohomology invariants and logical quantum operations
Nikolas P. Breuckmann, Margarita Davydova, Jens N. Eberhardt +1
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology in…
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…
Planar quantum low-density parity-check codes with open boundaries
Zijian Liang, Jens Niklas Eberhardt, Yu-An Chen
Although high-threshold and low-overhead quantum low-density parity-check (qLDPC) codes, such as bivariate bicycle (BB) codes, can reduce the physical-qubit cost by an order of mag…
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…