Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
Breuckmann, Francisco Revson Fernandes Pereira, and Jens Niklas Eberhardt
3 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
3
Pith papers citing it
2
external citations · OpenAlex
fields
quant-ph 3years
2026 3representative citing papers
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
Four block-algebra constructions for morphing circuits are given, recovering a prior surface-code result and adding a new three-round color-code model via numerical search over finite-group representations.
citing papers explorer
-
Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices
Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
-
Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
-
Block algebra for morphing circuits
Four block-algebra constructions for morphing circuits are given, recovering a prior surface-code result and adding a new three-round color-code model via numerical search over finite-group representations.