{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6A2RSFOSLHMQNH7Z2RKLPYPOFC","short_pith_number":"pith:6A2RSFOS","schema_version":"1.0","canonical_sha256":"f0351915d259d9069ff9d454b7e1ee288d3bdd363b9948d0a2c6a1b36801e932","source":{"kind":"arxiv","id":"1206.4836","version":2},"attestation_state":"computed","paper":{"title":"Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dami\\'an Pital\\'ua-Garc\\'ia","submitted_at":"2012-06-21T11:15:47Z","abstract_excerpt":"In port-based teleportation, Alice teleports an unknown quantum state to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain the state. We present a theorem in the spirit of the no-cloning theorem, which says that it is impossible to extract any information from an unknown quantum state if only a single copy of it is provided and if the state remains unchanged. We use this theorem and the no-signaling principle to prove an upper bound on the success probability of port-based teleportation."},"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":"1206.4836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-21T11:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"033721fd0fdc60ea2f3de78e60cd210c7a36290ecfaaa1dfc64200500498dfd1","abstract_canon_sha256":"521015f94620570f3f5728114d64188a5821dc7d89f8d9ba59a98f5cda76cca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.800580Z","signature_b64":"jt/h/QAjP+YHXPtVrN1rjZXte0OX34lFciiS4OjoVlWYV18mbvZDfXFEKfrUJDsiljpZ1g4SfcEKEOR4alkkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0351915d259d9069ff9d454b7e1ee288d3bdd363b9948d0a2c6a1b36801e932","last_reissued_at":"2026-05-18T03:26:33.800016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.800016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dami\\'an Pital\\'ua-Garc\\'ia","submitted_at":"2012-06-21T11:15:47Z","abstract_excerpt":"In port-based teleportation, Alice teleports an unknown quantum state to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain the state. We present a theorem in the spirit of the no-cloning theorem, which says that it is impossible to extract any information from an unknown quantum state if only a single copy of it is provided and if the state remains unchanged. We use this theorem and the no-signaling principle to prove an upper bound on the success probability of port-based teleportation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4836","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":""},"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":"1206.4836","created_at":"2026-05-18T03:26:33.800092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4836v2","created_at":"2026-05-18T03:26:33.800092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4836","created_at":"2026-05-18T03:26:33.800092+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A2RSFOSLHMQ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A2RSFOSLHMQNH7Z","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A2RSFOS","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC","json":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC.json","graph_json":"https://pith.science/api/pith-number/6A2RSFOSLHMQNH7Z2RKLPYPOFC/graph.json","events_json":"https://pith.science/api/pith-number/6A2RSFOSLHMQNH7Z2RKLPYPOFC/events.json","paper":"https://pith.science/paper/6A2RSFOS"},"agent_actions":{"view_html":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC","download_json":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC.json","view_paper":"https://pith.science/paper/6A2RSFOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4836&json=true","fetch_graph":"https://pith.science/api/pith-number/6A2RSFOSLHMQNH7Z2RKLPYPOFC/graph.json","fetch_events":"https://pith.science/api/pith-number/6A2RSFOSLHMQNH7Z2RKLPYPOFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC/action/storage_attestation","attest_author":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC/action/author_attestation","sign_citation":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC/action/citation_signature","submit_replication":"https://pith.science/pith/6A2RSFOSLHMQNH7Z2RKLPYPOFC/action/replication_record"}},"created_at":"2026-05-18T03:26:33.800092+00:00","updated_at":"2026-05-18T03:26:33.800092+00:00"}