Pith Number

pith:XTAJIPPF

pith:2026:XTAJIPPF5EPBS73P54GUHMECMN

not attested not anchored not stored refs resolved

Fire and ice: Partially fault-tolerant quantum computing with selective state filtering

Ben W. Reichardt, David Aasen, Rui Chao

Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.

arxiv:2605.15344 v1 · 2026-05-14 · quant-ph

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{XTAJIPPF5EPBS73P54GUHMECMN}

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

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

At realistic simulated noise rates, the scheme is reliable and resource efficient.

C2weakest assumption

The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels.

C3one line summary

Concatenates Laflamme and Iceberg codes with selective filtering for a partially fault-tolerant quantum computation scheme that simulations indicate performs reliably at realistic noise levels.

References

35 extracted · 35 resolved · 14 Pith anchors

[1] V. V. Albert and P. Faist. The error correction zoo. 2025, ://errorcorrectionzoo.org/ 2025

[2] N. Berthusen and E. Durso-Sabina . Simple logical quantum computation with concatenated symplectic double codes. (2025), arXiv:2510.18753 http://arxiv.org/abs/2510.18753 2025

[3] S. Burton, E. Durso-Sabina , and N. C. Brown. Genons, double covers and fault-tolerant C lifford gates. 2024, arXiv:2406.09951 http://arxiv.org/abs/2406.09951 2024

[4] Universal quantum computation with ideal Clifford gates and noisy ancillas.Physical Review A, 71(2) 2005 · doi:10.1103/physreva.71.022316

[5] Majorana Fermion Codes 2010 · doi:10.1088/1367-2630/12/8/083039

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:00:53.556262Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87

Aliases

arxiv: 2605.15344 · arxiv_version: 2605.15344v1 · doi: 10.48550/arxiv.2605.15344 · pith_short_12: XTAJIPPF5EPB · pith_short_16: XTAJIPPF5EPBS73P · pith_short_8: XTAJIPPF

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/XTAJIPPF5EPBS73P54GUHMECMN \
  | 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: bcc0943de5e91e197f6fef0d43b08263738856e8542c4aa0f89371812c8f4d87

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "59ba10e9cccac9b9a20e911298c098c97eb47a63a60333ab0873d236e112c97f",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-05-14T19:13:25Z",
    "title_canon_sha256": "be4e4ea61c171792e35c64ab1f5917188fa0ef2158da63ebad6cc3f012dfe430"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15344",
    "kind": "arxiv",
    "version": 1
  }
}