{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:KCCUPRYHDH565GKENRWEYTY3SD","short_pith_number":"pith:KCCUPRYH","schema_version":"1.0","canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","source":{"kind":"arxiv","id":"quant-ph/0305179","version":3},"attestation_state":"computed","paper":{"title":"Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-05-29T16:20:35Z","abstract_excerpt":"We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\\{1, ..., N\\}\\to\\{1, ..., M\\}$, its polynomial degree is the same for all $M\\geq N$. Therefore, if we have a quantum lower bound for some (possibly, quite large) range $M$ which is shown using polynomials method, we immediately get the same lower bound for all ranges $M\\geq N$. In particular, we get $\\Omega(N^{1/3})$ and $\\Omega(N^{2/3})$ quantum lower bounds for collision and element distinctness with small range."},"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/0305179","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-29T16:20:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6498f8f8adab46b35a2a6985472ed893d4cb011f2da5fdcdb76a9ce7d47f69c6","abstract_canon_sha256":"5592061cdf07103885bb34f4eb0fe7f154c9d18bf53bc8a2b4e515759f5d42f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:29.005310Z","signature_b64":"0wIz/qb5kpDNjERDNo9FExGtCmfMsBcgbN83kCcONHukwr/gyrcKrKb4/QN5DdJ2ND5kofjyRNC4FcDW/5JCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508547c70719fbee99446c6c4c4f1b90f530b79253dd865d6153e93675c1c5b8","last_reissued_at":"2026-07-04T15:11:29.004895Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:29.004895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-05-29T16:20:35Z","abstract_excerpt":"We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\\{1, ..., N\\}\\to\\{1, ..., M\\}$, its polynomial degree is the same for all $M\\geq N$. Therefore, if we have a quantum lower bound for some (possibly, quite large) range $M$ which is shown using polynomials method, we immediately get the same lower bound for all ranges $M\\geq N$. In particular, we get $\\Omega(N^{1/3})$ and $\\Omega(N^{2/3})$ quantum lower bounds for collision and element distinctness with small range."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305179","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/0305179/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/0305179","created_at":"2026-07-04T15:11:29.004958+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305179v3","created_at":"2026-07-04T15:11:29.004958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305179","created_at":"2026-07-04T15:11:29.004958+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCCUPRYHDH56","created_at":"2026-07-04T15:11:29.004958+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCCUPRYHDH565GKE","created_at":"2026-07-04T15:11:29.004958+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCCUPRYH","created_at":"2026-07-04T15:11:29.004958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD","json":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD.json","graph_json":"https://pith.science/api/pith-number/KCCUPRYHDH565GKENRWEYTY3SD/graph.json","events_json":"https://pith.science/api/pith-number/KCCUPRYHDH565GKENRWEYTY3SD/events.json","paper":"https://pith.science/paper/KCCUPRYH"},"agent_actions":{"view_html":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD","download_json":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD.json","view_paper":"https://pith.science/paper/KCCUPRYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0305179&json=true","fetch_graph":"https://pith.science/api/pith-number/KCCUPRYHDH565GKENRWEYTY3SD/graph.json","fetch_events":"https://pith.science/api/pith-number/KCCUPRYHDH565GKENRWEYTY3SD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/action/storage_attestation","attest_author":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/action/author_attestation","sign_citation":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/action/citation_signature","submit_replication":"https://pith.science/pith/KCCUPRYHDH565GKENRWEYTY3SD/action/replication_record"}},"created_at":"2026-07-04T15:11:29.004958+00:00","updated_at":"2026-07-04T15:11:29.004958+00:00"}