Pith Number

pith:KV3MPLQV

pith:2026:KV3MPLQVS6JHG53F3EE6DQROPH

not attested not anchored not stored refs resolved

Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation

Matthew Steinberg, Robert Wille, Sascha Heu{\ss}en, Tom Peham

Search over stabilizer tableaus yields encoders for arbitrary stabilizer codes with up to 43% fewer two-qubit gates.

arxiv:2605.15266 v1 · 2026-05-14 · quant-ph · cs.ET

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{KV3MPLQVS6JHG53F3EE6DQROPH}

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

We develop methods for synthesizing efficient encoders for arbitrary stabilizer codes... obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth.

C2weakest assumption

The search algorithms (greedy and rollout) will reliably locate high-quality stabilizer-equivalent realizations without becoming trapped in poor local optima for the codes of practical interest.

C3one line summary

New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.

References

92 extracted · 92 resolved · 5 Pith anchors

[1] Wille, et al., in2024 IEEE International Conference on Quantum Software (QSW)(IEEE, 2024) pp 2024

[2] D. A. Lidar and T. A. Brun,Quantum error correction (Cambridge University Press, 2013) 2013

[3] S. J. Devitt, W. J. Munro, and K. Nemoto,Quantum er- ror correction for beginners, Rep. Prog. Phys.76, 076001 (2013) 2013

[4] Google Quantum AI,Quantum error correction below the surface code threshold, Nature638, 920–926 (2024) 2024

[5] Pogorelov, et al.,Experimental fault-tolerant code switching, Nat 2025

Formal links

1 machine-checked theorem link

Receipt and verification

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

Canonical hash

5576c7ae159792737765d909e1c22e79f2a6050b49222abc666c17383e073f0e

Aliases

arxiv: 2605.15266 · arxiv_version: 2605.15266v1 · doi: 10.48550/arxiv.2605.15266 · pith_short_12: KV3MPLQVS6JH · pith_short_16: KV3MPLQVS6JHG53F · pith_short_8: KV3MPLQV

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/KV3MPLQVS6JHG53F3EE6DQROPH \
  | 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: 5576c7ae159792737765d909e1c22e79f2a6050b49222abc666c17383e073f0e

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "38e15e3d5f92148e8832528109d66c3d6a4b0eec26c0eff439aee82a24f40839",
    "cross_cats_sorted": [
      "cs.ET"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-05-14T18:00:01Z",
    "title_canon_sha256": "e37a74bb60ad751fc5c1f560f072893e0cb492cd803a7b0ad7ec99923dac8e95"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15266",
    "kind": "arxiv",
    "version": 1
  }
}