{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:XARRUKODBV5QTGGYVB42TXREYL","short_pith_number":"pith:XARRUKOD","schema_version":"1.0","canonical_sha256":"b8231a29c30d7b0998d8a879a9de24c2c0604c7d922622ff7a5481cd4e1b06c4","source":{"kind":"arxiv","id":"quant-ph/0611209","version":3},"attestation_state":"computed","paper":{"title":"Exponential separations for one-way quantum communication complexity, with applications to cryptography","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dmytro Gavinsky, Iordanis Kerenidis, Julia Kempe, Ran Raz, Ronald de Wolf","submitted_at":"2006-11-20T17:35:42Z","abstract_excerpt":"We give an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean Hidden Matching Problem of Bar-Yossef et al.) Earlier such an exponential separation was known only for a relational problem. The communication problem corresponds to a \\emph{strong extractor} that fails against a small amount of \\emph{quantum} information about its random source. Our proof uses the Fourier coefficients inequality of Kahn, Kalai, and Linial.\n  We also give a number of applications of this separation. In particular, we show tha"},"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":"quant-ph/0611209","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-20T17:35:42Z","cross_cats_sorted":[],"title_canon_sha256":"06f7517f71128a5eb7feb0cf60e49f0ecad73d95692cb348491445469bd48b29","abstract_canon_sha256":"136bb136b4bf888ce7fe0d6b396506a39ea1a779acd11791d6adbacb91d8814c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:09:11.329730Z","signature_b64":"PiEaBev9thfs0WbRze0LfvgmaOT8PKSRtgXcD5Brz00XEIw+8ZntzgaqqOCxLmcdYjvQJJErdUDbzrUoKOSsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8231a29c30d7b0998d8a879a9de24c2c0604c7d922622ff7a5481cd4e1b06c4","last_reissued_at":"2026-07-05T04:09:11.329345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:09:11.329345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential separations for one-way quantum communication complexity, with applications to cryptography","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dmytro Gavinsky, Iordanis Kerenidis, Julia Kempe, Ran Raz, Ronald de Wolf","submitted_at":"2006-11-20T17:35:42Z","abstract_excerpt":"We give an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean Hidden Matching Problem of Bar-Yossef et al.) Earlier such an exponential separation was known only for a relational problem. The communication problem corresponds to a \\emph{strong extractor} that fails against a small amount of \\emph{quantum} information about its random source. Our proof uses the Fourier coefficients inequality of Kahn, Kalai, and Linial.\n  We also give a number of applications of this separation. In particular, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0611209","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/quant-ph/0611209/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":"quant-ph/0611209","created_at":"2026-07-05T04:09:11.329402+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0611209v3","created_at":"2026-07-05T04:09:11.329402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0611209","created_at":"2026-07-05T04:09:11.329402+00:00"},{"alias_kind":"pith_short_12","alias_value":"XARRUKODBV5Q","created_at":"2026-07-05T04:09:11.329402+00:00"},{"alias_kind":"pith_short_16","alias_value":"XARRUKODBV5QTGGY","created_at":"2026-07-05T04:09:11.329402+00:00"},{"alias_kind":"pith_short_8","alias_value":"XARRUKOD","created_at":"2026-07-05T04:09:11.329402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL","json":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL.json","graph_json":"https://pith.science/api/pith-number/XARRUKODBV5QTGGYVB42TXREYL/graph.json","events_json":"https://pith.science/api/pith-number/XARRUKODBV5QTGGYVB42TXREYL/events.json","paper":"https://pith.science/paper/XARRUKOD"},"agent_actions":{"view_html":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL","download_json":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL.json","view_paper":"https://pith.science/paper/XARRUKOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0611209&json=true","fetch_graph":"https://pith.science/api/pith-number/XARRUKODBV5QTGGYVB42TXREYL/graph.json","fetch_events":"https://pith.science/api/pith-number/XARRUKODBV5QTGGYVB42TXREYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL/action/storage_attestation","attest_author":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL/action/author_attestation","sign_citation":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL/action/citation_signature","submit_replication":"https://pith.science/pith/XARRUKODBV5QTGGYVB42TXREYL/action/replication_record"}},"created_at":"2026-07-05T04:09:11.329402+00:00","updated_at":"2026-07-05T04:09:11.329402+00:00"}