{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SZGIPXKXVP3YADFTKBLCXXZNYQ","short_pith_number":"pith:SZGIPXKX","schema_version":"1.0","canonical_sha256":"964c87dd57abf7800cb350562bdf2dc419cc7cd6b11464846655b45fce21c922","source":{"kind":"arxiv","id":"1712.01119","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds of Success Probabilities for High-Fidelity Approach in KLM Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kazuto Oshima","submitted_at":"2017-12-01T08:26:15Z","abstract_excerpt":"In the Knill-Laflamme-Milburn (KLM) scheme, the success probability of quantum teleportation is given by ${n \\over n+1}$, wehre $2n$ is the number of the ancilla qubits. For the high-fidelity approach in the KLM scheme, the success probability is approximately given by $1-{1 \\over n^{2}}$ for large $n$. We give an explicit prescription to prepare an optimal ancilla state and give an exact lower bound of the success probability for the high-fidelity approach for arbitrary $n$."},"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":"1712.01119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-01T08:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"294a826d107b8d34890da5522e0e5a702e42cb4f4e562e848d924020b15943a5","abstract_canon_sha256":"da73d06bfc854e3578434e16916843c8b6d370254af9774ae7fbd9ee958f4a96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:07.869956Z","signature_b64":"/1xvvtrrtuFJDis8NkiWwwNB/+8OVfFw5MXnIRnAbpjoUVFvvk7utRp5LRr/9WXNN2eHTSI27A3iUTFFV1lPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"964c87dd57abf7800cb350562bdf2dc419cc7cd6b11464846655b45fce21c922","last_reissued_at":"2026-05-18T00:28:07.869263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:07.869263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds of Success Probabilities for High-Fidelity Approach in KLM Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kazuto Oshima","submitted_at":"2017-12-01T08:26:15Z","abstract_excerpt":"In the Knill-Laflamme-Milburn (KLM) scheme, the success probability of quantum teleportation is given by ${n \\over n+1}$, wehre $2n$ is the number of the ancilla qubits. For the high-fidelity approach in the KLM scheme, the success probability is approximately given by $1-{1 \\over n^{2}}$ for large $n$. We give an explicit prescription to prepare an optimal ancilla state and give an exact lower bound of the success probability for the high-fidelity approach for arbitrary $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01119","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":"1712.01119","created_at":"2026-05-18T00:28:07.869399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01119v2","created_at":"2026-05-18T00:28:07.869399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01119","created_at":"2026-05-18T00:28:07.869399+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZGIPXKXVP3Y","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZGIPXKXVP3YADFT","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZGIPXKX","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ","json":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ.json","graph_json":"https://pith.science/api/pith-number/SZGIPXKXVP3YADFTKBLCXXZNYQ/graph.json","events_json":"https://pith.science/api/pith-number/SZGIPXKXVP3YADFTKBLCXXZNYQ/events.json","paper":"https://pith.science/paper/SZGIPXKX"},"agent_actions":{"view_html":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ","download_json":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ.json","view_paper":"https://pith.science/paper/SZGIPXKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01119&json=true","fetch_graph":"https://pith.science/api/pith-number/SZGIPXKXVP3YADFTKBLCXXZNYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SZGIPXKXVP3YADFTKBLCXXZNYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ/action/storage_attestation","attest_author":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ/action/author_attestation","sign_citation":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ/action/citation_signature","submit_replication":"https://pith.science/pith/SZGIPXKXVP3YADFTKBLCXXZNYQ/action/replication_record"}},"created_at":"2026-05-18T00:28:07.869399+00:00","updated_at":"2026-05-18T00:28:07.869399+00:00"}