{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:H64TFSRKOG4R53S7NK3CDA4QTO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7dbf45b89ec095a8577dd02ddbee91d4219a49634d9b16b88207f7fcbccc7aa4","cross_cats_sorted":["cs.CC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-09T02:48:43Z","title_canon_sha256":"8c6e87b27fd4684931b86d2538dd5b310abeba6f95403b0afdae473ccc570fa7"},"schema_version":"1.0","source":{"id":"2001.02818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.02818","created_at":"2026-07-05T00:32:23Z"},{"alias_kind":"arxiv_version","alias_value":"2001.02818v1","created_at":"2026-07-05T00:32:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02818","created_at":"2026-07-05T00:32:23Z"},{"alias_kind":"pith_short_12","alias_value":"H64TFSRKOG4R","created_at":"2026-07-05T00:32:23Z"},{"alias_kind":"pith_short_16","alias_value":"H64TFSRKOG4R53S7","created_at":"2026-07-05T00:32:23Z"},{"alias_kind":"pith_short_8","alias_value":"H64TFSRK","created_at":"2026-07-05T00:32:23Z"}],"graph_snapshots":[{"event_id":"sha256:fc33782151ebb8a35e33423f6914463e1799ab26603e6c8a66ea16b82242c499","target":"graph","created_at":"2026-07-05T00:32:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.02818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages, designed for a noiseless qudit channel over a $\\mathrm{poly}(n)$ size alphabet, our main result is a simulation method that fails with probability less than $2^{-\\Theta(n\\epsilon)}$ and uses a qudit channel over the same alphabet $n\\left(1+\\Theta \\left(\\sqrt{\\epsilon}\\right)\\right)$ times, of which an $\\epsilon$ fraction can be corrupted adversarially. The simulat","authors_text":"Ala Shayeghi, Ashwin Nayak, Dave Touchette, Debbie Leung, Nengkun Yu, Penghui Yao","cross_cats":["cs.CC","cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-09T02:48:43Z","title":"Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02818","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b5fa2d578b5fa5424ca838c3b26641fd1e2cc9f3799e8ad5436b144476d84b0","target":"record","created_at":"2026-07-05T00:32:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7dbf45b89ec095a8577dd02ddbee91d4219a49634d9b16b88207f7fcbccc7aa4","cross_cats_sorted":["cs.CC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-09T02:48:43Z","title_canon_sha256":"8c6e87b27fd4684931b86d2538dd5b310abeba6f95403b0afdae473ccc570fa7"},"schema_version":"1.0","source":{"id":"2001.02818","kind":"arxiv","version":1}},"canonical_sha256":"3fb932ca2a71b91eee5f6ab62183909b80de146faf1640c033a03bed3ea68ab0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb932ca2a71b91eee5f6ab62183909b80de146faf1640c033a03bed3ea68ab0","first_computed_at":"2026-07-05T00:32:23.940777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:23.940777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+FZCpOf/L7I1J7kM7SbDlTDuYdKcWJ4aMKg5lPBokgbuprS8bI1YPgVqymHWaQRBhrnTzYr92/IdmnDjXm6uAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:23.941234Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.02818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b5fa2d578b5fa5424ca838c3b26641fd1e2cc9f3799e8ad5436b144476d84b0","sha256:fc33782151ebb8a35e33423f6914463e1799ab26603e6c8a66ea16b82242c499"],"state_sha256":"06bce255c682a81aa4978ffd2496845d0c24414791bad4aa328fc1440ef21cda"}