{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:NO7Q3T6J2RENQF26R7OUYVNS2V","short_pith_number":"pith:NO7Q3T6J","schema_version":"1.0","canonical_sha256":"6bbf0dcfc9d448d8175e8fdd4c55b2d54a01cf8f8152dea8c9a127bf59fd002f","source":{"kind":"arxiv","id":"quant-ph/0106160","version":3},"attestation_state":"computed","paper":{"title":"Lower bounds for quantum communication complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Klauck","submitted_at":"2001-06-28T19:07:19Z","abstract_excerpt":"We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity and nondeterministic quantum communication complexity. We develop several other lower bound methods based on the Fourier transform, notably showing that \\sqrt{\\bar{s}(f)/\\log n}, for the average sensitivity \\b"},"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/0106160","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-06-28T19:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"961bb0dfe034e614068494759b3fb8426751751e0975e33e29cebb282e426b05","abstract_canon_sha256":"c313b05fdea76a8fcf24416d39ae2fd6657b2cd2c015aa00b7de67218ce3fa16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:39.724290Z","signature_b64":"zlW5tSAUU9SQckgWq8CF8VidCs9hB+CpBY2o3xpbn3ep0J2zVsJwzxOg7BTwEivFPia44z4cgaG0+wqvkGuACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bbf0dcfc9d448d8175e8fdd4c55b2d54a01cf8f8152dea8c9a127bf59fd002f","last_reissued_at":"2026-07-04T14:45:39.723951Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:39.723951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for quantum communication complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Klauck","submitted_at":"2001-06-28T19:07:19Z","abstract_excerpt":"We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity and nondeterministic quantum communication complexity. We develop several other lower bound methods based on the Fourier transform, notably showing that \\sqrt{\\bar{s}(f)/\\log n}, for the average sensitivity \\b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0106160","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/0106160/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/0106160","created_at":"2026-07-04T14:45:39.724005+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0106160v3","created_at":"2026-07-04T14:45:39.724005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0106160","created_at":"2026-07-04T14:45:39.724005+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO7Q3T6J2REN","created_at":"2026-07-04T14:45:39.724005+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO7Q3T6J2RENQF26","created_at":"2026-07-04T14:45:39.724005+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO7Q3T6J","created_at":"2026-07-04T14:45:39.724005+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":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V","json":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V.json","graph_json":"https://pith.science/api/pith-number/NO7Q3T6J2RENQF26R7OUYVNS2V/graph.json","events_json":"https://pith.science/api/pith-number/NO7Q3T6J2RENQF26R7OUYVNS2V/events.json","paper":"https://pith.science/paper/NO7Q3T6J"},"agent_actions":{"view_html":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V","download_json":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V.json","view_paper":"https://pith.science/paper/NO7Q3T6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0106160&json=true","fetch_graph":"https://pith.science/api/pith-number/NO7Q3T6J2RENQF26R7OUYVNS2V/graph.json","fetch_events":"https://pith.science/api/pith-number/NO7Q3T6J2RENQF26R7OUYVNS2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V/action/storage_attestation","attest_author":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V/action/author_attestation","sign_citation":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V/action/citation_signature","submit_replication":"https://pith.science/pith/NO7Q3T6J2RENQF26R7OUYVNS2V/action/replication_record"}},"created_at":"2026-07-04T14:45:39.724005+00:00","updated_at":"2026-07-04T14:45:39.724005+00:00"}