Pith Number

pith:LS6LU542

pith:2026:LS6LU542X65SNTRUHVZ63EUEK3

not attested not anchored not stored refs resolved

T Count as a Numerically Solvable Minimization Problem

Dirk Englund, Ed Younis, Hyeongrak Choi, Marc Grau Davis, Mathias Weiden

The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice.

arxiv:2603.25101 v2 · 2026-03-26 · 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{LS6LU542X65SNTRUHVZ63EUEK3}

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 demonstrate that these problems are numerically solvable in practice.

C2weakest assumption

The continuous relaxation and numerical minimization accurately detect the existence of a discrete T-count circuit without being trapped in local minima that would produce false negatives on feasible counts.

C3one line summary

T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.

References

33 extracted · 33 resolved · 0 Pith anchors

[1] This procedure of carefully choosing starting points using the results of other optimization problems turned out to be roughly a 30% speedup and in some cases im- proved the quality of results. IV. NU 2048

[2] Matthew Amy, Dmitri Maslov, Michele Mosca, and Mar- tin Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits.IEEE Transactions on Computer-Aided Design of Int 2013

[3] Alex Bocharov, Martin Roetteler, and Krysta M. Svore. Efficient synthesis of universal repeat-until-success quan- tum circuits.Phys. Rev. Lett., 114:080502, Feb 2015 2015

[4] Childs, Dmitri Maslov, Yunseong Nam, Neil J 2018

[5] Fault tolerant non-clifford state preparation for arbitrary rotations.arXiv preprint arXiv:2303.17380, 2023 2023

Formal links

2 machine-checked theorem links

Receipt and verification

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

Canonical hash

5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f

Aliases

arxiv: 2603.25101 · arxiv_version: 2603.25101v2 · doi: 10.48550/arxiv.2603.25101 · pith_short_12: LS6LU542X65S · pith_short_16: LS6LU542X65SNTRU · pith_short_8: LS6LU542

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/LS6LU542X65SNTRUHVZ63EUEK3 \
  | 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: 5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "f5a7fe276e35defb85a043f13ab4af9a8fc463302f162368d5264438d0621bbe",
    "cross_cats_sorted": [
      "cs.ET"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-03-26T07:15:52Z",
    "title_canon_sha256": "0d6749575af62ce1a5fd509ddadbd977bcd7fe603c1c7d60bb7a84beb1c7fef6"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2603.25101",
    "kind": "arxiv",
    "version": 2
  }
}