{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:DAJ5GPAUJI4IA7EP3IVLYWSFIJ","short_pith_number":"pith:DAJ5GPAU","schema_version":"1.0","canonical_sha256":"1813d33c144a38807c8fda2abc5a454248f50e41f3616f2b45c840243a444e10","source":{"kind":"arxiv","id":"quant-ph/0109068","version":1},"attestation_state":"computed","paper":{"title":"Improved Quantum Communication Complexity Bounds for Disjointness and Equality","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Amsterdam), Peter Hoyer (U Calgary), Ronald de Wolf (CWI","submitted_at":"2001-09-14T09:31:31Z","abstract_excerpt":"We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^* n})-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an Omega(sqrt{n}) lower bound for a large class of protocols that includ"},"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/0109068","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-09-14T09:31:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b51624aa20ceef8322e767b5b827f605d0b5ebbb10de2e445faae84e9b0bc56f","abstract_canon_sha256":"eaf62b0767f6fbb2cd4dee2d1c73d6d58ae99a5884c235ff95fcb0119b5d429c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.449814Z","signature_b64":"hnFUlwYw8l6IbgilO4uCx6yFcat9JX4NXhW4dNyZmR+Fkp9BWgMmUjthSvU27rIBatEoZTIfZIrkjDoVnktKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1813d33c144a38807c8fda2abc5a454248f50e41f3616f2b45c840243a444e10","last_reissued_at":"2026-05-18T00:53:35.449212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.449212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Communication Complexity Bounds for Disjointness and Equality","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Amsterdam), Peter Hoyer (U Calgary), Ronald de Wolf (CWI","submitted_at":"2001-09-14T09:31:31Z","abstract_excerpt":"We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound being n/2. We show this by improving a general bound for non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^* n})-qubit bounded-error protocol for disjointness, modifying and improving the earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an Omega(sqrt{n}) lower bound for a large class of protocols that includ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0109068","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":""},"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/0109068","created_at":"2026-05-18T00:53:35.449300+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0109068v1","created_at":"2026-05-18T00:53:35.449300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0109068","created_at":"2026-05-18T00:53:35.449300+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAJ5GPAUJI4I","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAJ5GPAUJI4IA7EP","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAJ5GPAU","created_at":"2026-05-18T12:25:50.254431+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/DAJ5GPAUJI4IA7EP3IVLYWSFIJ","json":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ.json","graph_json":"https://pith.science/api/pith-number/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/graph.json","events_json":"https://pith.science/api/pith-number/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/events.json","paper":"https://pith.science/paper/DAJ5GPAU"},"agent_actions":{"view_html":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ","download_json":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ.json","view_paper":"https://pith.science/paper/DAJ5GPAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0109068&json=true","fetch_graph":"https://pith.science/api/pith-number/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/action/storage_attestation","attest_author":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/action/author_attestation","sign_citation":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/action/citation_signature","submit_replication":"https://pith.science/pith/DAJ5GPAUJI4IA7EP3IVLYWSFIJ/action/replication_record"}},"created_at":"2026-05-18T00:53:35.449300+00:00","updated_at":"2026-05-18T00:53:35.449300+00:00"}