{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4KMQ5CP6JG4ISMNHFE2M3QFUHQ","short_pith_number":"pith:4KMQ5CP6","schema_version":"1.0","canonical_sha256":"e2990e89fe49b88931a72934cdc0b43c1381d300ea1b8c567486d243731eb4c6","source":{"kind":"arxiv","id":"1810.06295","version":1},"attestation_state":"computed","paper":{"title":"Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch","submitted_at":"2018-10-15T12:14:02Z","abstract_excerpt":"The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs, consisting of N$^2$ nodes. We simulate these quantum systems using classical computational methods, and find that the probability distributions that arise are very favorable for a hybrid quantum / classical algorithm. We then examine how this hybrid algorithm handles varying types of randomness in both location of the special vertex and later random obstacles pla"},"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":"1810.06295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-15T12:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"dabc96f0633e29b724883d9e8e9f0ec72bd3bb3f3d43a849d4f3a216cfe7b48a","abstract_canon_sha256":"542add262f11ac94276eebbcc43f607aaed209ef0c07ff32035c6b3b7059f6ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:54.604398Z","signature_b64":"2S3hgWKZ6CuSLysuUkZ/6Op0TYzj0J3mb2UezZwDR5SoddDury6W7EYS/Yq3FIlEOyoUBwQtVNgFvcYteBc2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2990e89fe49b88931a72934cdc0b43c1381d300ea1b8c567486d243731eb4c6","last_reissued_at":"2026-05-17T23:55:54.603669Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:54.603669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch","submitted_at":"2018-10-15T12:14:02Z","abstract_excerpt":"The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs, consisting of N$^2$ nodes. We simulate these quantum systems using classical computational methods, and find that the probability distributions that arise are very favorable for a hybrid quantum / classical algorithm. We then examine how this hybrid algorithm handles varying types of randomness in both location of the special vertex and later random obstacles pla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06295","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":"1810.06295","created_at":"2026-05-17T23:55:54.603790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06295v1","created_at":"2026-05-17T23:55:54.603790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06295","created_at":"2026-05-17T23:55:54.603790+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KMQ5CP6JG4I","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KMQ5CP6JG4ISMNH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KMQ5CP6","created_at":"2026-05-18T12:32:05.422762+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/4KMQ5CP6JG4ISMNHFE2M3QFUHQ","json":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ.json","graph_json":"https://pith.science/api/pith-number/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/graph.json","events_json":"https://pith.science/api/pith-number/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/events.json","paper":"https://pith.science/paper/4KMQ5CP6"},"agent_actions":{"view_html":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ","download_json":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ.json","view_paper":"https://pith.science/paper/4KMQ5CP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06295&json=true","fetch_graph":"https://pith.science/api/pith-number/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/action/storage_attestation","attest_author":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/action/author_attestation","sign_citation":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/action/citation_signature","submit_replication":"https://pith.science/pith/4KMQ5CP6JG4ISMNHFE2M3QFUHQ/action/replication_record"}},"created_at":"2026-05-17T23:55:54.603790+00:00","updated_at":"2026-05-17T23:55:54.603790+00:00"}