{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MBVVX6G5AALGSZYK6ERD6FIJPY","short_pith_number":"pith:MBVVX6G5","schema_version":"1.0","canonical_sha256":"606b5bf8dd001669670af1223f15097e35a9e6ce01732edce8100cb2f7c1f5f1","source":{"kind":"arxiv","id":"1707.08456","version":1},"attestation_state":"computed","paper":{"title":"Optimal Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marek Mozrzymas, Micha{\\l} Horodecki, Micha{\\l} Studzi\\'nski, Sergii Strelchuk","submitted_at":"2017-07-26T14:15:28Z","abstract_excerpt":"Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of ports and dimension of the teleported state is given by the largest eigenvalue of a particular matrix -- Teleportation Matrix. It encodes the relationship between a certain set of Young diagrams and emerges as the the optimal solution to the "},"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":"1707.08456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-26T14:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"59db14ef52c42e308e34227ed5e445ec3f33b5f1da4dbb2db4df6055040d14b8","abstract_canon_sha256":"8d2a50149465ce49fa63145faeae2597b49e8eb4ced7414d7bf4d69177c06db5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.358547Z","signature_b64":"Vz6ZcBQLQmhI/ln0/oA3YRuZWFLE1kYYA+fwWWhQlIG8nac49dVP+1+sRcn/s4kBANYxcD84IHFN616PXfU8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606b5bf8dd001669670af1223f15097e35a9e6ce01732edce8100cb2f7c1f5f1","last_reissued_at":"2026-05-18T00:01:10.357882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.357882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marek Mozrzymas, Micha{\\l} Horodecki, Micha{\\l} Studzi\\'nski, Sergii Strelchuk","submitted_at":"2017-07-26T14:15:28Z","abstract_excerpt":"Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of ports and dimension of the teleported state is given by the largest eigenvalue of a particular matrix -- Teleportation Matrix. It encodes the relationship between a certain set of Young diagrams and emerges as the the optimal solution to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08456","kind":"arxiv","version":1},"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":"1707.08456","created_at":"2026-05-18T00:01:10.357978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08456v1","created_at":"2026-05-18T00:01:10.357978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08456","created_at":"2026-05-18T00:01:10.357978+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBVVX6G5AALG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBVVX6G5AALGSZYK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBVVX6G5","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2409.10393","citing_title":"Multicopy quantum state teleportation with application to storage and retrieval of quantum programs","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY","json":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY.json","graph_json":"https://pith.science/api/pith-number/MBVVX6G5AALGSZYK6ERD6FIJPY/graph.json","events_json":"https://pith.science/api/pith-number/MBVVX6G5AALGSZYK6ERD6FIJPY/events.json","paper":"https://pith.science/paper/MBVVX6G5"},"agent_actions":{"view_html":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY","download_json":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY.json","view_paper":"https://pith.science/paper/MBVVX6G5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08456&json=true","fetch_graph":"https://pith.science/api/pith-number/MBVVX6G5AALGSZYK6ERD6FIJPY/graph.json","fetch_events":"https://pith.science/api/pith-number/MBVVX6G5AALGSZYK6ERD6FIJPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY/action/storage_attestation","attest_author":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY/action/author_attestation","sign_citation":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY/action/citation_signature","submit_replication":"https://pith.science/pith/MBVVX6G5AALGSZYK6ERD6FIJPY/action/replication_record"}},"created_at":"2026-05-18T00:01:10.357978+00:00","updated_at":"2026-05-18T00:01:10.357978+00:00"}