{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DFB62TLORGPP36DAVYJ66A55A5","short_pith_number":"pith:DFB62TLO","schema_version":"1.0","canonical_sha256":"1943ed4d6e899efdf860ae13ef03bd077f5a83e78c5cb12d8769ffc0510008aa","source":{"kind":"arxiv","id":"1511.02839","version":2},"attestation_state":"computed","paper":{"title":"Instantaneous non-local computation of low T-depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Speelman","submitted_at":"2015-11-09T20:47:30Z","abstract_excerpt":"Instantaneous non-local quantum computation requires multiple parties to jointly perform a quantum operation, using pre-shared entanglement and a single round of simultaneous communication. We study this task for its close connection to position-based quantum cryptography, but it also has natural applications in the context of foundations of quantum physics and in distributed computing. The best known general construction for instantaneous non-local quantum computation requires a pre-shared state which is exponentially large in the number of qubits involved in the operation, while efficient co"},"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":"1511.02839","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-09T20:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"344a02c955faf1792223d6e4f86a5dff0f6cb7da9762f17add66584d80a53e2e","abstract_canon_sha256":"98466497ffecf841993e62b5b4ed7659bdbc3649a6f549c8f3e942a4186398fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:04.589899Z","signature_b64":"4P0uvLGUF27Zg4YMuGJ9l2Ok3VX010UmcUiMdhQpvGgADiz3rMY9Dk6ZyuYovW4CUVaEIWvHSgM40dFjlSRcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1943ed4d6e899efdf860ae13ef03bd077f5a83e78c5cb12d8769ffc0510008aa","last_reissued_at":"2026-05-18T00:56:04.589357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:04.589357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instantaneous non-local computation of low T-depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Speelman","submitted_at":"2015-11-09T20:47:30Z","abstract_excerpt":"Instantaneous non-local quantum computation requires multiple parties to jointly perform a quantum operation, using pre-shared entanglement and a single round of simultaneous communication. We study this task for its close connection to position-based quantum cryptography, but it also has natural applications in the context of foundations of quantum physics and in distributed computing. The best known general construction for instantaneous non-local quantum computation requires a pre-shared state which is exponentially large in the number of qubits involved in the operation, while efficient co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02839","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":"1511.02839","created_at":"2026-05-18T00:56:04.589461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02839v2","created_at":"2026-05-18T00:56:04.589461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02839","created_at":"2026-05-18T00:56:04.589461+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFB62TLORGPP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFB62TLORGPP36DA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFB62TLO","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02840","citing_title":"Entanglement cost in non-local quantum computation","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5","json":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5.json","graph_json":"https://pith.science/api/pith-number/DFB62TLORGPP36DAVYJ66A55A5/graph.json","events_json":"https://pith.science/api/pith-number/DFB62TLORGPP36DAVYJ66A55A5/events.json","paper":"https://pith.science/paper/DFB62TLO"},"agent_actions":{"view_html":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5","download_json":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5.json","view_paper":"https://pith.science/paper/DFB62TLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02839&json=true","fetch_graph":"https://pith.science/api/pith-number/DFB62TLORGPP36DAVYJ66A55A5/graph.json","fetch_events":"https://pith.science/api/pith-number/DFB62TLORGPP36DAVYJ66A55A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5/action/storage_attestation","attest_author":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5/action/author_attestation","sign_citation":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5/action/citation_signature","submit_replication":"https://pith.science/pith/DFB62TLORGPP36DAVYJ66A55A5/action/replication_record"}},"created_at":"2026-05-18T00:56:04.589461+00:00","updated_at":"2026-05-18T00:56:04.589461+00:00"}