Pith Number

pith:IPXM3KJ3

pith:2026:IPXM3KJ3YWK6DO6PECE5RNQ7CG

not attested not anchored not stored refs resolved

Linear-Time T-Gate Optimization via Random Abstraction

Aws Albarghouthi

A linear-time randomized algorithm optimizes T gates by propagating constant-width bitstrings to approximate reachable quantum states.

arxiv:2605.13929 v1 · 2026-05-13 · cs.PL · quant-ph

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{IPXM3KJ3YWK6DO6PECE5RNQ7CG}

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 give a linear-time randomized algorithm for phase folding, based on a novel randomized static analysis. Our static analysis soundly approximates the set of reachable quantum states with an arbitrarily high probability. Our key insight is a static analysis that does not track symbolic expressions, but propagates constant-width bitstrings down the circuit.

C2weakest assumption

The randomized bitstring propagation soundly approximates the reachable quantum states with arbitrarily high probability for the purpose of phase folding.

C3one line summary

A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.

References

43 extracted · 43 resolved · 4 Pith anchors

[1] In: Selinger, P., Chiribella, G 2018 · doi:10.4204/eptcs.287.1

[2] Matthew Amy and Joseph Lunderville. 2025. Linear and non-linear relational analyses for quantum program optimization.Proceedings of the ACM on Programming Languages9, POPL, Article 37 (2025), 1072–110 2025 · doi:10.1145/3704873

[3] Matthew Amy, Dmitri Maslov, and Michele Mosca. 2014. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning.IEEE Transactions on Computer-Aided Design of Integrated Circu 2014 · doi:10.1109/tcad.2014.2341953

[4] T-count optimization and reed–muller codes.IEEE Transactions on Information Theory, 65(8):4771–4784 2019 · doi:10.1109/tit.2019.2906374

[5] Benjamin Bichsel, Anouk Paradis, Maximilian Baader, and Martin Vechev. 2023. Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation.Quantum7 (2023), 1185. doi:10.22331/q-2023-11-20- 2023 · doi:10.22331/q-2023-11-20-1185

Receipt and verification

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

Canonical hash

43eecda93bc595e1bbcf2089d8b61f11ace0c439dbd3fa951ad91ef57c0b377f

Aliases

arxiv: 2605.13929 · arxiv_version: 2605.13929v1 · doi: 10.48550/arxiv.2605.13929 · pith_short_12: IPXM3KJ3YWK6 · pith_short_16: IPXM3KJ3YWK6DO6P · pith_short_8: IPXM3KJ3

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/IPXM3KJ3YWK6DO6PECE5RNQ7CG \
  | 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: 43eecda93bc595e1bbcf2089d8b61f11ace0c439dbd3fa951ad91ef57c0b377f

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "fd5278c9e24afe05cb1afb2a01f6b947278b6397311949555ce9a92d967343cc",
    "cross_cats_sorted": [
      "quant-ph"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "primary_cat": "cs.PL",
    "submitted_at": "2026-05-13T15:54:13Z",
    "title_canon_sha256": "1ccbbcb54e8d7b91da6d0628da0e33b65601521f54ed70de233ac91d814228d6"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13929",
    "kind": "arxiv",
    "version": 1
  }
}