{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GXGYM2HGKZDITO3PPARIV2CN4X","short_pith_number":"pith:GXGYM2HG","schema_version":"1.0","canonical_sha256":"35cd8668e6564689bb6f78228ae84de5f0afb5ab1a80246adf987afa67d8f712","source":{"kind":"arxiv","id":"2111.05499","version":2},"attestation_state":"computed","paper":{"title":"Minimal Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Micha{\\l} Studzi\\'nski, Sergii Strelchuk","submitted_at":"2021-11-10T02:39:56Z","abstract_excerpt":"There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT protocol that satisfies these requirements: it teleports an unknown state of a qubit with success probability $p_{succ}=1-\\frac{N+2}{2^{N+1}}$ and fidelity $1-O(\\frac{1}{N})$ with the resource state consisting of $N$ maximally entangled states. T"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.05499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-11-10T02:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"246b6d8cbe49c27fab53ab90c077935c3011b4690741ba257fe5d085710fa6cb","abstract_canon_sha256":"959a18421632a86376cbbe510c1770af36a56fd60ca7ee5901921a41315fbeda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:02.603541Z","signature_b64":"5NEkQRilw8yGZ3LdaFhhcEBmY1+WF42YuVN9XxWuQBV2iwcRjO8/CVfQnGx5kNmYBPy8ZpvE24VDPEozRekyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35cd8668e6564689bb6f78228ae84de5f0afb5ab1a80246adf987afa67d8f712","last_reissued_at":"2026-07-05T06:31:02.603031Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:02.603031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Micha{\\l} Studzi\\'nski, Sergii Strelchuk","submitted_at":"2021-11-10T02:39:56Z","abstract_excerpt":"There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT protocol that satisfies these requirements: it teleports an unknown state of a qubit with success probability $p_{succ}=1-\\frac{N+2}{2^{N+1}}$ and fidelity $1-O(\\frac{1}{N})$ with the resource state consisting of $N$ maximally entangled states. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.05499","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.05499/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.05499","created_at":"2026-07-05T06:31:02.603097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.05499v2","created_at":"2026-07-05T06:31:02.603097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.05499","created_at":"2026-07-05T06:31:02.603097+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXGYM2HGKZDI","created_at":"2026-07-05T06:31:02.603097+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXGYM2HGKZDITO3P","created_at":"2026-07-05T06:31:02.603097+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXGYM2HG","created_at":"2026-07-05T06:31:02.603097+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X","json":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X.json","graph_json":"https://pith.science/api/pith-number/GXGYM2HGKZDITO3PPARIV2CN4X/graph.json","events_json":"https://pith.science/api/pith-number/GXGYM2HGKZDITO3PPARIV2CN4X/events.json","paper":"https://pith.science/paper/GXGYM2HG"},"agent_actions":{"view_html":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X","download_json":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X.json","view_paper":"https://pith.science/paper/GXGYM2HG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.05499&json=true","fetch_graph":"https://pith.science/api/pith-number/GXGYM2HGKZDITO3PPARIV2CN4X/graph.json","fetch_events":"https://pith.science/api/pith-number/GXGYM2HGKZDITO3PPARIV2CN4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X/action/storage_attestation","attest_author":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X/action/author_attestation","sign_citation":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X/action/citation_signature","submit_replication":"https://pith.science/pith/GXGYM2HGKZDITO3PPARIV2CN4X/action/replication_record"}},"created_at":"2026-07-05T06:31:02.603097+00:00","updated_at":"2026-07-05T06:31:02.603097+00:00"}