Pith Number

pith:MFSPDTKR

pith:2025:MFSPDTKR7Y52M7OOG6VQAWRJAW

not attested not anchored not stored refs resolved

Practical and Efficient Verification of Entanglement with Incomplete Measurement Settings

Anindita Bera, Dariusz Chru\'sci\'nski, Heonoh Kim, Jiheon Seong, Jin-Woo Kim, Joonwoo Bae, June-Koo Kevin Rhee, Seungchan Seo, Seung-Hyun Nam

A small number of measured observables suffices to construct entanglement witnesses that certify quantum states without full tomography.

arxiv:2512.09856 v2 · 2025-12-10 · quant-ph · physics.optics

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{MFSPDTKR7Y52M7OOG6VQAWRJAW}

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 show how the experimental estimation of a small number of observables can be directly exploited to construct a large family of entanglement witnesses, enabling the efficient identification of entangled states.

C2weakest assumption

That the chosen incomplete set of observables is sufficient to produce witnesses that can still detect entanglement for the target states, without the optimization introducing false positives or requiring assumptions about the full state space.

C3one line summary

A semidefinite programming method constructs entanglement witnesses from incomplete measurements to efficiently certify entangled states in experiments with limited observables.

References

48 extracted · 48 resolved · 0 Pith anchors

[1] UrZ+BQQnGv8qBfhpyH6KjnbQauM= 2023

[2] R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett.86,5188(2001) 2001

[3] R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Phys. Rev. A68,022312(2003) 2003

[4] H. J. Briegel, D. E. Browne, W. Dür, R. Raussendorf, and M. Van den Nest, Measurement-based quantum computa- tion, Nature Physics5,19(2009) 2009

[5] C. H. Bennett, G. Brassard, and N. D. Mermin, Quantum cryptography without bell’s theorem, Phys. Rev. Lett.68, 557(1992) 1992

Formal links

2 machine-checked theorem links

Receipt and verification

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

Canonical hash

6164f1cd51fe3ba67dce37ab005a2905a8c3286ab17b483b63861b89da2f1ffc

Aliases

arxiv: 2512.09856 · arxiv_version: 2512.09856v2 · doi: 10.48550/arxiv.2512.09856 · pith_short_12: MFSPDTKR7Y52 · pith_short_16: MFSPDTKR7Y52M7OO · pith_short_8: MFSPDTKR

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/MFSPDTKR7Y52M7OOG6VQAWRJAW \
  | 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: 6164f1cd51fe3ba67dce37ab005a2905a8c3286ab17b483b63861b89da2f1ffc

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "7d050d7ad86dd97ae2aa6f095d10ec65ca4a32775a338555a0f30dc16fa0e4c2",
    "cross_cats_sorted": [
      "physics.optics"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2025-12-10T17:39:39Z",
    "title_canon_sha256": "fc8b8479922c42306253e10187a735b049701b1fee99f9358ad0d0698c8e01ec"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2512.09856",
    "kind": "arxiv",
    "version": 2
  }
}