{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZWFLCRIS7JP4ZIZ7MGN7TLN4TX","short_pith_number":"pith:ZWFLCRIS","schema_version":"1.0","canonical_sha256":"cd8ab14512fa5fcca33f619bf9adbc9deb31a98220b69afdb0350705ee7efe70","source":{"kind":"arxiv","id":"2302.01858","version":3},"attestation_state":"computed","paper":{"title":"A Computational Separation Between Quantum No-cloning and No-telegraphing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Barak Nehoran, Mark Zhandry","submitted_at":"2023-02-03T17:05:38Z","abstract_excerpt":"Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable.\n  Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative "},"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":"2302.01858","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-03T17:05:38Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"9f4808720161b87701c091177f7b575e66ec9a47fcbe0e863acaf4f0de87bd8f","abstract_canon_sha256":"f3905962b0fefaf15d09b3f79f1622d04c5c96aaf590f4aa4d4c78b492567435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:36.356140Z","signature_b64":"juQcNlm2z7vy7jfCTRUTTefel0E3kGsXwcExmFmvkgPadcFVrqykvgstLUYLiIHQZR1L8X3ecMmngfkaeTr8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd8ab14512fa5fcca33f619bf9adbc9deb31a98220b69afdb0350705ee7efe70","last_reissued_at":"2026-07-05T09:22:36.355626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:36.355626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computational Separation Between Quantum No-cloning and No-telegraphing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Barak Nehoran, Mark Zhandry","submitted_at":"2023-02-03T17:05:38Z","abstract_excerpt":"Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum states over classical channels without pre-shared entanglement). They are known to be equivalent, in the sense that a collection of quantum states is telegraphable if and only if it is clonable.\n  Our main result suggests that this is not the case when computational efficiency is considered. We give a collection of quantum states and quantum oracles relative "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01858","kind":"arxiv","version":3},"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/2302.01858/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":"2302.01858","created_at":"2026-07-05T09:22:36.355689+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.01858v3","created_at":"2026-07-05T09:22:36.355689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01858","created_at":"2026-07-05T09:22:36.355689+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWFLCRIS7JP4","created_at":"2026-07-05T09:22:36.355689+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWFLCRIS7JP4ZIZ7","created_at":"2026-07-05T09:22:36.355689+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWFLCRIS","created_at":"2026-07-05T09:22:36.355689+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09538","citing_title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","ref_index":216,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX","json":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX.json","graph_json":"https://pith.science/api/pith-number/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/graph.json","events_json":"https://pith.science/api/pith-number/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/events.json","paper":"https://pith.science/paper/ZWFLCRIS"},"agent_actions":{"view_html":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX","download_json":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX.json","view_paper":"https://pith.science/paper/ZWFLCRIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.01858&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/action/storage_attestation","attest_author":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/action/author_attestation","sign_citation":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/action/citation_signature","submit_replication":"https://pith.science/pith/ZWFLCRIS7JP4ZIZ7MGN7TLN4TX/action/replication_record"}},"created_at":"2026-07-05T09:22:36.355689+00:00","updated_at":"2026-07-05T09:22:36.355689+00:00"}