{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:ERNTQIUN462QEOCIPBSSJLL6SN","short_pith_number":"pith:ERNTQIUN","schema_version":"1.0","canonical_sha256":"245b38228de7b5023848786524ad7e937e6c6ad75719e8f8d4b77eec40382146","source":{"kind":"arxiv","id":"quant-ph/0311001","version":9},"attestation_state":"computed","paper":{"title":"Quantum walk algorithm for element distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-11-01T02:27:48Z","abstract_excerpt":"We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N^{2/3}) query quantum algorithm. This improves the previous O(N^{3/4}) query quantum algorithm of Buhrman et.al. (quant-ph/0007016) and matches the lower bound by Shi (quant-ph/0112086). The algorithm also solves the generalization of element distinctness in which we have to find k equal items among N items. For this problem, we get an O(N^{k/(k+1)}) query quantum algorithm."},"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/0311001","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2003-11-01T02:27:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"15e718bef5f6edd0cf6744b66081446fa055605221ccb91efa42744e239d8257","abstract_canon_sha256":"8c3a48f1f384cc6e54b2e8900877ed6622cf0404251faf464aaa4d53b9506ad4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.810197Z","signature_b64":"NTY3ukOmwTPaMKe1IS26qBRg2Fz183gkL3/bNA0t0iwCOna9e+VsPVrcW1R36w6ALkMloVKK0OORWLKUUZzSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245b38228de7b5023848786524ad7e937e6c6ad75719e8f8d4b77eec40382146","last_reissued_at":"2026-05-18T02:52:49.809635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.809635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum walk algorithm for element distinctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-11-01T02:27:48Z","abstract_excerpt":"We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N^{2/3}) query quantum algorithm. This improves the previous O(N^{3/4}) query quantum algorithm of Buhrman et.al. (quant-ph/0007016) and matches the lower bound by Shi (quant-ph/0112086). The algorithm also solves the generalization of element distinctness in which we have to find k equal items among N items. For this problem, we get an O(N^{k/(k+1)}) query quantum algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311001","kind":"arxiv","version":9},"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/0311001","created_at":"2026-05-18T02:52:49.809718+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311001v9","created_at":"2026-05-18T02:52:49.809718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311001","created_at":"2026-05-18T02:52:49.809718+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERNTQIUN462Q","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERNTQIUN462QEOCI","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERNTQIUN","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16843","citing_title":"Mobility edges in pseudo-unitary quasiperiodic quantum walks","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN","json":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN.json","graph_json":"https://pith.science/api/pith-number/ERNTQIUN462QEOCIPBSSJLL6SN/graph.json","events_json":"https://pith.science/api/pith-number/ERNTQIUN462QEOCIPBSSJLL6SN/events.json","paper":"https://pith.science/paper/ERNTQIUN"},"agent_actions":{"view_html":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN","download_json":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN.json","view_paper":"https://pith.science/paper/ERNTQIUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0311001&json=true","fetch_graph":"https://pith.science/api/pith-number/ERNTQIUN462QEOCIPBSSJLL6SN/graph.json","fetch_events":"https://pith.science/api/pith-number/ERNTQIUN462QEOCIPBSSJLL6SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN/action/storage_attestation","attest_author":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN/action/author_attestation","sign_citation":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN/action/citation_signature","submit_replication":"https://pith.science/pith/ERNTQIUN462QEOCIPBSSJLL6SN/action/replication_record"}},"created_at":"2026-05-18T02:52:49.809718+00:00","updated_at":"2026-05-18T02:52:49.809718+00:00"}