Pith Number

pith:4S76J3NM

pith:2026:4S76J3NMMICRS6I574KDISQUV5

not attested not anchored not stored refs resolved

Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes

Hessam Mahdavifar, Sheida Rabeti

MBBP-LD improves quantum LDPC decoding by running parallel belief propagation across multiple parity-check bases derived from cycle-free Tanner subtrees.

arxiv:2605.14170 v1 · 2026-05-13 · cs.IT · math.IT

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{4S76J3NMMICRS6I574KDISQUV5}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

For bivariate bicycle codes [[144,12,12]] and [[288,12,18]], MBBP-LD achieves up to 20% reduction in error rate compared to BPGD and up to 30% compared to BP-OSD in the low- and moderate-error regimes while requiring substantially fewer total BP iterations.

C2weakest assumption

The cycle-free subtree decompositions of the Tanner graph produce sufficiently diverse and consistent parity-check representations that improve BP convergence without introducing new inconsistencies or requiring super-linear overhead.

C3one line summary

MBBP-LD creates multiple cycle-free subtree decompositions of the Tanner graph to run parallel BP decodings on quantum LDPC codes, cutting error rates by up to 30% versus BP-OSD and 20% versus BPGD on tested bivariate bicycle codes with fewer total iterations.

References

23 extracted · 23 resolved · 0 Pith anchors

[1] R. Gallager, “Low-density parity-check codes,”IRE Transactions on information theory, vol. 8, no. 1, pp. 21–28, 1962 1962

[2] Fifteen years of quantum LDPC coding and improved decoding strategies, 2015

[3] Quantum low-density parity- check codes, 2021

[4] Quantum low-density parity-check codes 2025

[5] Degenerate quantum LDPC codes with good finite length performance 2021

Receipt and verification

First computed	2026-05-17T23:39:11.364287Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29

Aliases

arxiv: 2605.14170 · arxiv_version: 2605.14170v1 · doi: 10.48550/arxiv.2605.14170 · pith_short_12: 4S76J3NMMICR · pith_short_16: 4S76J3NMMICRS6I5 · pith_short_8: 4S76J3NM

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/4S76J3NMMICRS6I574KDISQUV5 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: e4bfe4edac620519791dff14344a14af644d1f404415600429fc017b8a372e29

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "5cc2ea8abb256e3ef7eecdf4e4d39eb37659453074a747c01e718e9cda486f5c",
    "cross_cats_sorted": [
      "math.IT"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2026-05-13T22:49:35Z",
    "title_canon_sha256": "582cf939a3e8615c5080165b4c032c5ae7ecbb70e6f2626351163750b96cc565"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.14170",
    "kind": "arxiv",
    "version": 1
  }
}