{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:H64TFSRKOG4R53S7NK3CDA4QTO","short_pith_number":"pith:H64TFSRK","schema_version":"1.0","canonical_sha256":"3fb932ca2a71b91eee5f6ab62183909b80de146faf1640c033a03bed3ea68ab0","source":{"kind":"arxiv","id":"2001.02818","version":1},"attestation_state":"computed","paper":{"title":"Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Ashwin Nayak, Dave Touchette, Debbie Leung, Nengkun Yu, Penghui Yao","submitted_at":"2020-01-09T02:48:43Z","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"},"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":"2001.02818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-09T02:48:43Z","cross_cats_sorted":["cs.CC","cs.DS","cs.IT","math.IT"],"title_canon_sha256":"8c6e87b27fd4684931b86d2538dd5b310abeba6f95403b0afdae473ccc570fa7","abstract_canon_sha256":"7dbf45b89ec095a8577dd02ddbee91d4219a49634d9b16b88207f7fcbccc7aa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:23.941234Z","signature_b64":"+FZCpOf/L7I1J7kM7SbDlTDuYdKcWJ4aMKg5lPBokgbuprS8bI1YPgVqymHWaQRBhrnTzYr92/IdmnDjXm6uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb932ca2a71b91eee5f6ab62183909b80de146faf1640c033a03bed3ea68ab0","last_reissued_at":"2026-07-05T00:32:23.940777Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:23.940777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ala Shayeghi, Ashwin Nayak, Dave Touchette, Debbie Leung, Nengkun Yu, Penghui Yao","submitted_at":"2020-01-09T02:48:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02818","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/2001.02818/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":"2001.02818","created_at":"2026-07-05T00:32:23.940839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.02818v1","created_at":"2026-07-05T00:32:23.940839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02818","created_at":"2026-07-05T00:32:23.940839+00:00"},{"alias_kind":"pith_short_12","alias_value":"H64TFSRKOG4R","created_at":"2026-07-05T00:32:23.940839+00:00"},{"alias_kind":"pith_short_16","alias_value":"H64TFSRKOG4R53S7","created_at":"2026-07-05T00:32:23.940839+00:00"},{"alias_kind":"pith_short_8","alias_value":"H64TFSRK","created_at":"2026-07-05T00:32:23.940839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO","json":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO.json","graph_json":"https://pith.science/api/pith-number/H64TFSRKOG4R53S7NK3CDA4QTO/graph.json","events_json":"https://pith.science/api/pith-number/H64TFSRKOG4R53S7NK3CDA4QTO/events.json","paper":"https://pith.science/paper/H64TFSRK"},"agent_actions":{"view_html":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO","download_json":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO.json","view_paper":"https://pith.science/paper/H64TFSRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.02818&json=true","fetch_graph":"https://pith.science/api/pith-number/H64TFSRKOG4R53S7NK3CDA4QTO/graph.json","fetch_events":"https://pith.science/api/pith-number/H64TFSRKOG4R53S7NK3CDA4QTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO/action/storage_attestation","attest_author":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO/action/author_attestation","sign_citation":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO/action/citation_signature","submit_replication":"https://pith.science/pith/H64TFSRKOG4R53S7NK3CDA4QTO/action/replication_record"}},"created_at":"2026-07-05T00:32:23.940839+00:00","updated_at":"2026-07-05T00:32:23.940839+00:00"}