Pith Number

pith:OJOQMM6Z

pith:2026:OJOQMM6Z3EYLQ6C7FIOI7YX7SE

not attested not anchored not stored refs resolved

The Physical and Contextual Limits of Quantum Speedup

Karl Svozil

Quantum speedups come from reversible algebraic embeddings accessed by interference, not from running many classical computations simultaneously.

arxiv:2605.12675 v1 · 2026-05-12 · 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{OJOQMM6Z3EYLQ6C7FIOI7YX7SE}

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

Quantum speedups arise instead from reversible embeddings of algebraic structure made accessible through engineered interference patterns.

C2weakest assumption

The premise that components of a quantum superposition cannot be treated as independently readable classical branches, which rests on the standard no-cloning and measurement postulates of quantum mechanics without additional hidden-variable assumptions.

C3one line summary

Quantum speedups arise from engineered interference in high-dimensional Hilbert spaces rather than classical branchwise parallelism, constrained by no unitary garbage erasure, contextuality, and absence of absorbing halting states in closed unitary dynamics.

References

46 extracted · 46 resolved · 6 Pith anchors

[1] D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proceedings of the Royal So- ciety: Mathematical and Physical Sciences (1990-1995) 439, 553 (1992) 1990

[2] D. R. Simon, On the power of quantum computation, SIAM Journal on Computing26, 1474 (1997) 1997

[3] Polynomial-time algorithms for prime fa ctorization and discrete logarithms on a quantum computer 1994 · arXiv:quant-ph/9508027

[4] A fast quantum mechanical algorithm for database search 1996 · arXiv:quant-ph/9605043

[5] R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Rapid solution of problems by quantum computation, Proceedings of the Royal Society A: Mathematical, Phys- ical and Engineering Sciences454, 339 (199 1998

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-18T03:09:50.078252Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

725d0633d9d930b8785f2a1c8fe2ff913da3bee4a7c338a000d974b9a6e95705

Aliases

arxiv: 2605.12675 · arxiv_version: 2605.12675v1 · doi: 10.48550/arxiv.2605.12675 · pith_short_12: OJOQMM6Z3EYL · pith_short_16: OJOQMM6Z3EYLQ6C7 · pith_short_8: OJOQMM6Z

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/OJOQMM6Z3EYLQ6C7FIOI7YX7SE \
  | 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: 725d0633d9d930b8785f2a1c8fe2ff913da3bee4a7c338a000d974b9a6e95705

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "31ffb122d3a9c01431e9444a06fef4e6551af9d0d36024b78b4b84c542c45aaf",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-05-12T19:25:47Z",
    "title_canon_sha256": "4fd91fe39e3ee8bf82364c5f39aeacb5749df3aab8d3d9fd693535c92bd45c1a"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12675",
    "kind": "arxiv",
    "version": 1
  }
}