Pith Number

pith:KZHPXHFO

pith:2025:KZHPXHFO7RPFJK7JVTIDYNUSHR

not attested not anchored not stored refs resolved

Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads

Eneet Kaur, Kaushik P. Seshadreesan, Nitish Kumar Chandra

Different architectures for fault-tolerant distributed quantum computing show distinct scaling of Bell pair requirements with code distance.

arxiv:2511.13657 v1 · 2025-11-17 · 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{KZHPXHFO7RPFJK7JVTIDYNUSHR}

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

Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs.

C2weakest assumption

The three-type categorization captures the dominant practical approaches and that the idealized noise and operation models used for scaling remain representative of near-term hardware constraints.

C3one line summary

Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.

References

37 extracted · 37 resolved · 2 Pith anchors

[1] Roads towards fault- tolerant universal quantum computation 2017 · doi:10.1038/nature23460

[2] Awesome quantum computing experiments: Benchmarking experimental progress towards fault-tolerant quantum computation, 2025

[3] Early fault-tolerant quantum computing, 2024

[4] Distributed quantum computing: A survey, 2024

[5] Review of distributed quantum computing: From single qpu to high performance quantum computing, 2025

Formal links

2 machine-checked theorem links

Cited by

1 paper in Pith

Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits

Receipt and verification

First computed	2026-05-26T01:03:18.808436Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18

Aliases

arxiv: 2511.13657 · arxiv_version: 2511.13657v1 · doi: 10.48550/arxiv.2511.13657 · pith_short_12: KZHPXHFO7RPF · pith_short_16: KZHPXHFO7RPFJK7J · pith_short_8: KZHPXHFO

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/KZHPXHFO7RPFJK7JVTIDYNUSHR \
  | 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: 564efb9caefc5e54abe9acd03c36923c5de7f85f345d3598cf75458d899c6a18

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "7c22ea99a9061c3825e4a5664f4a09f943083c8208d148f204396fda1d06a598",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2025-11-17T18:14:38Z",
    "title_canon_sha256": "9daa0dc6f379fcabf3a2a85e6cb23f94e7035a7d680dc43efcab62cac9953f51"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2511.13657",
    "kind": "arxiv",
    "version": 1
  }
}