{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F2HG7JQ7NVIXNPY4FVXYWR7D5T","short_pith_number":"pith:F2HG7JQ7","schema_version":"1.0","canonical_sha256":"2e8e6fa61f6d5176bf1c2d6f8b47e3ecd864a331823d8eb5b998a23c2e662b8b","source":{"kind":"arxiv","id":"1003.0065","version":2},"attestation_state":"computed","paper":{"title":"Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Apoorva Patel, Md. Aminoor Rahaman","submitted_at":"2010-02-27T06:58:34Z","abstract_excerpt":"Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, i.e. finding a marked vertex on a $d$-dimensional hypercubic lattice. The restriction on movement hardly matters for $d>2$, and scaling behaviour close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimise"},"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":"1003.0065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-27T06:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"3ff5bac48cccd03cfbb1405f45e88adab722a87c5b479f4160fb5a3e6b066248","abstract_canon_sha256":"e5c07be77ae9161486ff0b8144b8490c872bf5240122584f72c7e3fd0e8400ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:38.446014Z","signature_b64":"dnsQJ4UmFh3DAy+EjvY/FbQ+W7XfXCgcowX+dvmaem0YpnrreOLTgYGNU6emQ9oEcgn1HR7nKHlcjnLqA2f1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e8e6fa61f6d5176bf1c2d6f8b47e3ecd864a331823d8eb5b998a23c2e662b8b","last_reissued_at":"2026-05-18T02:24:38.445336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:38.445336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Apoorva Patel, Md. Aminoor Rahaman","submitted_at":"2010-02-27T06:58:34Z","abstract_excerpt":"Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, i.e. finding a marked vertex on a $d$-dimensional hypercubic lattice. The restriction on movement hardly matters for $d>2$, and scaling behaviour close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimise"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0065","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":"1003.0065","created_at":"2026-05-18T02:24:38.445446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.0065v2","created_at":"2026-05-18T02:24:38.445446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0065","created_at":"2026-05-18T02:24:38.445446+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2HG7JQ7NVIX","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2HG7JQ7NVIXNPY4","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2HG7JQ7","created_at":"2026-05-18T12:26:06.534383+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/F2HG7JQ7NVIXNPY4FVXYWR7D5T","json":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T.json","graph_json":"https://pith.science/api/pith-number/F2HG7JQ7NVIXNPY4FVXYWR7D5T/graph.json","events_json":"https://pith.science/api/pith-number/F2HG7JQ7NVIXNPY4FVXYWR7D5T/events.json","paper":"https://pith.science/paper/F2HG7JQ7"},"agent_actions":{"view_html":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T","download_json":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T.json","view_paper":"https://pith.science/paper/F2HG7JQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.0065&json=true","fetch_graph":"https://pith.science/api/pith-number/F2HG7JQ7NVIXNPY4FVXYWR7D5T/graph.json","fetch_events":"https://pith.science/api/pith-number/F2HG7JQ7NVIXNPY4FVXYWR7D5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T/action/storage_attestation","attest_author":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T/action/author_attestation","sign_citation":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T/action/citation_signature","submit_replication":"https://pith.science/pith/F2HG7JQ7NVIXNPY4FVXYWR7D5T/action/replication_record"}},"created_at":"2026-05-18T02:24:38.445446+00:00","updated_at":"2026-05-18T02:24:38.445446+00:00"}