{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4T6LHM5C2JZ3EY4SVTUMLL3GEO","short_pith_number":"pith:4T6LHM5C","schema_version":"1.0","canonical_sha256":"e4fcb3b3a2d273b26392ace8c5af66238e7e32e022d5b06f49c2adbb5b4bf54a","source":{"kind":"arxiv","id":"1112.3337","version":1},"attestation_state":"computed","paper":{"title":"Search by quantum walks on two-dimensional grid without amplitude amplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexander Rivosh, Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols","submitted_at":"2011-12-14T20:55:56Z","abstract_excerpt":"We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh (quant-ph/0402107) takes O(\\sqrt{N log N}) steps and finds a marked location with probability O(1/log N) for grid of size \\sqrt{N} * \\sqrt{N}. This probability is small, thus amplitude amplification is needed to achieve \\Theta(1) success probability. The amplitude amplification adds an additional O(\\sqrt{log N}) factor to the number of steps, making it O(\\sqrt{N} log N).\n  In this paper, we show that despite a small probability to find a marked location, the probability to be within an O("},"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":"1112.3337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:55:56Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"dc4b14a11e112d0e7e1109ee978b78b1faaea351a6ee4c31ba6fac7f8e1c4c4b","abstract_canon_sha256":"7215f2b251cc88d0ce8e61cabfcfea61de3ba20c7bab240979dc068823d727a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:19.452125Z","signature_b64":"AQ8rlk1ztrlh+wxztxfMS+LoRS/kFh0X5c9KhUY4IrqokyQFXf53CtFbIl4AMEcFkFN8Mpjrr5gCjUEeN8AiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4fcb3b3a2d273b26392ace8c5af66238e7e32e022d5b06f49c2adbb5b4bf54a","last_reissued_at":"2026-05-18T04:06:19.451418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:19.451418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search by quantum walks on two-dimensional grid without amplitude amplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexander Rivosh, Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols","submitted_at":"2011-12-14T20:55:56Z","abstract_excerpt":"We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh (quant-ph/0402107) takes O(\\sqrt{N log N}) steps and finds a marked location with probability O(1/log N) for grid of size \\sqrt{N} * \\sqrt{N}. This probability is small, thus amplitude amplification is needed to achieve \\Theta(1) success probability. The amplitude amplification adds an additional O(\\sqrt{log N}) factor to the number of steps, making it O(\\sqrt{N} log N).\n  In this paper, we show that despite a small probability to find a marked location, the probability to be within an O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3337","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":"1112.3337","created_at":"2026-05-18T04:06:19.451510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3337v1","created_at":"2026-05-18T04:06:19.451510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3337","created_at":"2026-05-18T04:06:19.451510+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T6LHM5C2JZ3","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T6LHM5C2JZ3EY4S","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T6LHM5C","created_at":"2026-05-18T12:26:20.644004+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/4T6LHM5C2JZ3EY4SVTUMLL3GEO","json":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO.json","graph_json":"https://pith.science/api/pith-number/4T6LHM5C2JZ3EY4SVTUMLL3GEO/graph.json","events_json":"https://pith.science/api/pith-number/4T6LHM5C2JZ3EY4SVTUMLL3GEO/events.json","paper":"https://pith.science/paper/4T6LHM5C"},"agent_actions":{"view_html":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO","download_json":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO.json","view_paper":"https://pith.science/paper/4T6LHM5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3337&json=true","fetch_graph":"https://pith.science/api/pith-number/4T6LHM5C2JZ3EY4SVTUMLL3GEO/graph.json","fetch_events":"https://pith.science/api/pith-number/4T6LHM5C2JZ3EY4SVTUMLL3GEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO/action/storage_attestation","attest_author":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO/action/author_attestation","sign_citation":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO/action/citation_signature","submit_replication":"https://pith.science/pith/4T6LHM5C2JZ3EY4SVTUMLL3GEO/action/replication_record"}},"created_at":"2026-05-18T04:06:19.451510+00:00","updated_at":"2026-05-18T04:06:19.451510+00:00"}