{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RY2GXUELJ6NTWLVUYE747HEXAE","short_pith_number":"pith:RY2GXUEL","schema_version":"1.0","canonical_sha256":"8e346bd08b4f9b3b2eb4c13fcf9c9701139df064814272b04df4e6c23ea5f031","source":{"kind":"arxiv","id":"2310.01637","version":1},"attestation_state":"computed","paper":{"title":"Efficient Quantum Algorithm for Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jiani Fei, Patrick Hayden, Sydney Timmerman","submitted_at":"2023-10-02T21:03:59Z","abstract_excerpt":"In this paper, we provide the first efficient algorithm for port-based teleportation, a unitarily equivariant version of teleportation useful for constructing programmable quantum processors and performing instantaneous nonlocal computation (NLQC). The latter connection is important in AdS/CFT, where bulk computations are realized as boundary NLQC. Our algorithm yields an exponential improvement to the known relationship between the amount of entanglement available and the complexity of the nonlocal part of any unitary that can be implemented using NLQC. Similarly, our algorithm provides the f"},"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":"2310.01637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-02T21:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"0ab5a43ab668b5250fd36505a153e74c4deb70187f20af7e4949b9862914bc6e","abstract_canon_sha256":"98366ebbf97c37bc343d3f60e969a8c3ca1612277eeb05e26a18b3598313cb74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:43.890925Z","signature_b64":"9HLwvUynLhdJ9PhTRGySEKn03VF6gVgsBnEdZl4r3dDV/DKCXMdM9gwOkhHIXiIpQW82OJ0LBWBhtWTV3GNcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e346bd08b4f9b3b2eb4c13fcf9c9701139df064814272b04df4e6c23ea5f031","last_reissued_at":"2026-07-05T06:56:43.890379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:43.890379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Quantum Algorithm for Port-based Teleportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jiani Fei, Patrick Hayden, Sydney Timmerman","submitted_at":"2023-10-02T21:03:59Z","abstract_excerpt":"In this paper, we provide the first efficient algorithm for port-based teleportation, a unitarily equivariant version of teleportation useful for constructing programmable quantum processors and performing instantaneous nonlocal computation (NLQC). The latter connection is important in AdS/CFT, where bulk computations are realized as boundary NLQC. Our algorithm yields an exponential improvement to the known relationship between the amount of entanglement available and the complexity of the nonlocal part of any unitary that can be implemented using NLQC. Similarly, our algorithm provides the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01637","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.01637/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":"2310.01637","created_at":"2026-07-05T06:56:43.890437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.01637v1","created_at":"2026-07-05T06:56:43.890437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01637","created_at":"2026-07-05T06:56:43.890437+00:00"},{"alias_kind":"pith_short_12","alias_value":"RY2GXUELJ6NT","created_at":"2026-07-05T06:56:43.890437+00:00"},{"alias_kind":"pith_short_16","alias_value":"RY2GXUELJ6NTWLVU","created_at":"2026-07-05T06:56:43.890437+00:00"},{"alias_kind":"pith_short_8","alias_value":"RY2GXUEL","created_at":"2026-07-05T06:56:43.890437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.10393","citing_title":"Multicopy quantum state teleportation with application to storage and retrieval of quantum programs","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2504.12945","citing_title":"A resource theory of asynchronous quantum information processing","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2512.21260","citing_title":"Random dilation superchannel","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE","json":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE.json","graph_json":"https://pith.science/api/pith-number/RY2GXUELJ6NTWLVUYE747HEXAE/graph.json","events_json":"https://pith.science/api/pith-number/RY2GXUELJ6NTWLVUYE747HEXAE/events.json","paper":"https://pith.science/paper/RY2GXUEL"},"agent_actions":{"view_html":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE","download_json":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE.json","view_paper":"https://pith.science/paper/RY2GXUEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.01637&json=true","fetch_graph":"https://pith.science/api/pith-number/RY2GXUELJ6NTWLVUYE747HEXAE/graph.json","fetch_events":"https://pith.science/api/pith-number/RY2GXUELJ6NTWLVUYE747HEXAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE/action/storage_attestation","attest_author":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE/action/author_attestation","sign_citation":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE/action/citation_signature","submit_replication":"https://pith.science/pith/RY2GXUELJ6NTWLVUYE747HEXAE/action/replication_record"}},"created_at":"2026-07-05T06:56:43.890437+00:00","updated_at":"2026-07-05T06:56:43.890437+00:00"}