Pith Number

pith:UBLSEGKW

pith:2026:UBLSEGKWWLW3UIXWYXQPLG4JXV

not attested not anchored not stored refs resolved

Ising anyons in the $SU(2)_2$ Chern--Simons theory

Andrey Morozov, Artem Belov

Representation differences between the Ising minimal model and SU(2)_2 Chern-Simons theory leave observables for topological quantum computation unchanged.

arxiv:2605.15268 v1 · 2026-05-14 · hep-th · 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{UBLSEGKWWLW3UIXWYXQPLG4JXV}

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

While representation structure differs, it does not affect the observables underlying topological quantum computation algorithms.

C2weakest assumption

The premise that equivalence at the level of observables survives the observed mismatch in the number of irreducible highest-weight representations versus the number of Ising anyons, at least for the low-degree tensor products examined.

C3one line summary

Differences in representation structure between the Ising minimal model and SU(2)_2 Chern-Simons theory do not impact observables relevant to topological quantum computation.

References

37 extracted · 37 resolved · 0 Pith anchors

[1] Paul Benioff. The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines.Journal of Statistical Physics, 22(5):563–591, May 19 1980

[2] Richard P. Feynman. Simulating physics with computers.International Journal of Theoretical Physics, 21(6):467–488, Jun 1982 1982

[3] Quantum theory, the church–turing principle and the universal quantum computer.Pro- ceedings of the Royal Society of London 1985

[4] Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.SIAM Journal on Computing, 26(5):1484–1509, 1997 1997

[5] Lov K. Grover. A fast quantum mechanical algorithm for database search, 1996 1996

Formal links

2 machine-checked theorem links

Receipt and verification

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

Canonical hash

a057221956b2edba22f6c5e0f59b89bd4c0d84e0822722e7006d135a8acc9790

Aliases

arxiv: 2605.15268 · arxiv_version: 2605.15268v1 · doi: 10.48550/arxiv.2605.15268 · pith_short_12: UBLSEGKWWLW3 · pith_short_16: UBLSEGKWWLW3UIXW · pith_short_8: UBLSEGKW

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/UBLSEGKWWLW3UIXWYXQPLG4JXV \
  | 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: a057221956b2edba22f6c5e0f59b89bd4c0d84e0822722e7006d135a8acc9790

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "b1756f88ccc6468c156654fd3a9f600f15626394d4e0ac08b6b3fc094301672e",
    "cross_cats_sorted": [
      "quant-ph"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "hep-th",
    "submitted_at": "2026-05-14T18:00:01Z",
    "title_canon_sha256": "b21d7a8ea4da54aeecde359898e6d2afee0d5d0969907dd2e3e6efe0bc8a62a8"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15268",
    "kind": "arxiv",
    "version": 1
  }
}