{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NNJRPAUA2T6BX53C2KIH4OC4JH","short_pith_number":"pith:NNJRPAUA","schema_version":"1.0","canonical_sha256":"6b53178280d4fc1bf762d2907e385c49ea16373c0b85f6227e83966a1bb28c6e","source":{"kind":"arxiv","id":"1512.07550","version":2},"attestation_state":"computed","paper":{"title":"Optimizing the Number of Gates in Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ronald de Wolf (CWI, Srinivasan Arunachalam (CWI), University of Amsterdam)","submitted_at":"2015-12-23T17:23:26Z","abstract_excerpt":"$ $In its usual form, Grover's quantum search algorithm uses $O(\\sqrt{N})$ queries and $O(\\sqrt{N} \\log N)$ other elementary gates to find a solution in an $N$-bit database. Grover in 2002 showed how to reduce the number of other gates to $O(\\sqrt{N}\\log\\log N)$ for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to $O(\\sqrt{N}\\log^{(r)} N)$ gates for any constant $r$, and sufficiently large $N$. This means that, on average, the gates between two queries barely touch more than a constant numbe"},"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":"1512.07550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-23T17:23:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5dda5f0f75ab9f811bb946105d6c2968ca276cbc08de22f38b8fb07e34a7d5ba","abstract_canon_sha256":"c9388162d14ec0f674ec2795fe98b69912c8accde483c1a9ddf95e0e86b8a7a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.149416Z","signature_b64":"D6XKTTRgZsZhaqHmd90X5rM7GSk8+XWtvEy4vVTESrHQz1yii6Fv81TE6MLhlm3CM0GPfHMBjrT2xfEtXNhyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b53178280d4fc1bf762d2907e385c49ea16373c0b85f6227e83966a1bb28c6e","last_reissued_at":"2026-05-18T01:01:42.148754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.148754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the Number of Gates in Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ronald de Wolf (CWI, Srinivasan Arunachalam (CWI), University of Amsterdam)","submitted_at":"2015-12-23T17:23:26Z","abstract_excerpt":"$ $In its usual form, Grover's quantum search algorithm uses $O(\\sqrt{N})$ queries and $O(\\sqrt{N} \\log N)$ other elementary gates to find a solution in an $N$-bit database. Grover in 2002 showed how to reduce the number of other gates to $O(\\sqrt{N}\\log\\log N)$ for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to $O(\\sqrt{N}\\log^{(r)} N)$ gates for any constant $r$, and sufficiently large $N$. This means that, on average, the gates between two queries barely touch more than a constant numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07550","kind":"arxiv","version":2},"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":"1512.07550","created_at":"2026-05-18T01:01:42.148852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07550v2","created_at":"2026-05-18T01:01:42.148852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07550","created_at":"2026-05-18T01:01:42.148852+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNJRPAUA2T6B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNJRPAUA2T6BX53C","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNJRPAUA","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15435","citing_title":"Quantum Search without Global Diffusion","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH","json":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH.json","graph_json":"https://pith.science/api/pith-number/NNJRPAUA2T6BX53C2KIH4OC4JH/graph.json","events_json":"https://pith.science/api/pith-number/NNJRPAUA2T6BX53C2KIH4OC4JH/events.json","paper":"https://pith.science/paper/NNJRPAUA"},"agent_actions":{"view_html":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH","download_json":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH.json","view_paper":"https://pith.science/paper/NNJRPAUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07550&json=true","fetch_graph":"https://pith.science/api/pith-number/NNJRPAUA2T6BX53C2KIH4OC4JH/graph.json","fetch_events":"https://pith.science/api/pith-number/NNJRPAUA2T6BX53C2KIH4OC4JH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH/action/storage_attestation","attest_author":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH/action/author_attestation","sign_citation":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH/action/citation_signature","submit_replication":"https://pith.science/pith/NNJRPAUA2T6BX53C2KIH4OC4JH/action/replication_record"}},"created_at":"2026-05-18T01:01:42.148852+00:00","updated_at":"2026-05-18T01:01:42.148852+00:00"}