pith. sign in

Quantum tanner codes

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 3

years

2026 2 2024 1

verdicts

UNVERDICTED 3

roles

background 1

polarities

unclear 1

representative citing papers

Algorithmic Locality via Provable Convergence in Quantum Tensor Networks

quant-ph · 2026-04-23 · unverdicted · novelty 8.0

For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.

Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds

quant-ph · 2026-05-14 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 3 of 3 citing papers.

  • Algorithmic Locality via Provable Convergence in Quantum Tensor Networks quant-ph · 2026-04-23 · unverdicted · none · ref 63

    For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.

  • High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory quant-ph · 2024-06-20 · unverdicted · none · ref 5

    Radial codes from lifted products of quasi-cyclic codes give [[2r²s, 2(r-1)², ≤2s]] quantum LDPC codes whose simulations show comparable circuit-level performance to surface codes at roughly 1/5 the qubit count with single-shot decoding.

  • Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds quant-ph · 2026-05-14 · unverdicted · none · ref 43

    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.