{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:TNAM24I3XNOVEWMOGTS42IM6VL","short_pith_number":"pith:TNAM24I3","schema_version":"1.0","canonical_sha256":"9b40cd711bbb5d52598e34e5cd219eaaedf8057c508bdfceb3e176a2a7dee640","source":{"kind":"arxiv","id":"quant-ph/0111102","version":1},"attestation_state":"computed","paper":{"title":"Quantum Lower Bound for the Collision Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2001-11-20T00:38:26Z","abstract_excerpt":"The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to solve this problem with bounded error probability. The best known upper bound is O(n^{1/3}), but obtaining any lower bound better than Theta(1) was an open problem since 1997. Our proof uses the polynomial method augmented by some new ideas. We also give a lower bound of Theta(n^{1/7}) for the problem of deciding whether two sets are equal or disjoint on a con"},"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/0111102","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-11-20T00:38:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"664bc0e6c0221724ee7bf41ae3ce3d5977dcbf7fed439b2c5f569a7654cfdae1","abstract_canon_sha256":"fd1e84f88c0bb5c8dbb1aa5ff97e289aa982a98eab0ddaf9ce59568a48c145e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:44.090894Z","signature_b64":"OLhMt9NgrUmXCC9yzVLQZEQIHe7e7BzR8aEstvTaqhbWBRBogreP1btW4CW9MCGs3JStzHRfVd6L1DjO8iDhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b40cd711bbb5d52598e34e5cd219eaaedf8057c508bdfceb3e176a2a7dee640","last_reissued_at":"2026-07-04T14:45:44.090557Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:44.090557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Lower Bound for the Collision Problem","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2001-11-20T00:38:26Z","abstract_excerpt":"The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to solve this problem with bounded error probability. The best known upper bound is O(n^{1/3}), but obtaining any lower bound better than Theta(1) was an open problem since 1997. Our proof uses the polynomial method augmented by some new ideas. We also give a lower bound of Theta(n^{1/7}) for the problem of deciding whether two sets are equal or disjoint on a con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0111102","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/quant-ph/0111102/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/0111102","created_at":"2026-07-04T14:45:44.090612+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0111102v1","created_at":"2026-07-04T14:45:44.090612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0111102","created_at":"2026-07-04T14:45:44.090612+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNAM24I3XNOV","created_at":"2026-07-04T14:45:44.090612+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNAM24I3XNOVEWMO","created_at":"2026-07-04T14:45:44.090612+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNAM24I3","created_at":"2026-07-04T14:45:44.090612+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23442","citing_title":"Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL","json":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL.json","graph_json":"https://pith.science/api/pith-number/TNAM24I3XNOVEWMOGTS42IM6VL/graph.json","events_json":"https://pith.science/api/pith-number/TNAM24I3XNOVEWMOGTS42IM6VL/events.json","paper":"https://pith.science/paper/TNAM24I3"},"agent_actions":{"view_html":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL","download_json":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL.json","view_paper":"https://pith.science/paper/TNAM24I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0111102&json=true","fetch_graph":"https://pith.science/api/pith-number/TNAM24I3XNOVEWMOGTS42IM6VL/graph.json","fetch_events":"https://pith.science/api/pith-number/TNAM24I3XNOVEWMOGTS42IM6VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL/action/storage_attestation","attest_author":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL/action/author_attestation","sign_citation":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL/action/citation_signature","submit_replication":"https://pith.science/pith/TNAM24I3XNOVEWMOGTS42IM6VL/action/replication_record"}},"created_at":"2026-07-04T14:45:44.090612+00:00","updated_at":"2026-07-04T14:45:44.090612+00:00"}