{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:WV54UOFT5ATRGV65SYPFYCDOXQ","short_pith_number":"pith:WV54UOFT","schema_version":"1.0","canonical_sha256":"b57bca38b3e8271357dd961e5c086ebc3555974958edad03e9d8b760ca9bf1f9","source":{"kind":"arxiv","id":"quant-ph/0306054","version":2},"attestation_state":"computed","paper":{"title":"Spatial search by quantum walk","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Jeffrey Goldstone","submitted_at":"2003-06-06T18:47:55Z","abstract_excerpt":"Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show th"},"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/0306054","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-06-06T18:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"c03be8fbbdd1ec0054415966851212b992e51021dd80481c30a785f009fabd27","abstract_canon_sha256":"49f6349f9abca266bb42b24216959377a3d9ddf52a66180514b74f9e233ba396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:19.683833Z","signature_b64":"rpmea/yAZpQ6n+H6ChKpmW0D4LygoBLyn+xG9Y/Cg6HKmuY/2vjYvL85/lXElyY15q9V8ytJ5cXEG6+GFPmLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57bca38b3e8271357dd961e5c086ebc3555974958edad03e9d8b760ca9bf1f9","last_reissued_at":"2026-07-04T14:46:19.683455Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:19.683455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial search by quantum walk","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Jeffrey Goldstone","submitted_at":"2003-06-06T18:47:55Z","abstract_excerpt":"Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0306054","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0306054/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/0306054","created_at":"2026-07-04T14:46:19.683518+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0306054v2","created_at":"2026-07-04T14:46:19.683518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0306054","created_at":"2026-07-04T14:46:19.683518+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV54UOFT5ATR","created_at":"2026-07-04T14:46:19.683518+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV54UOFT5ATRGV65","created_at":"2026-07-04T14:46:19.683518+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV54UOFT","created_at":"2026-07-04T14:46:19.683518+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.04584","citing_title":"Quantum random walks on d-regular graphs with Haar-random coin operators","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ","json":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ.json","graph_json":"https://pith.science/api/pith-number/WV54UOFT5ATRGV65SYPFYCDOXQ/graph.json","events_json":"https://pith.science/api/pith-number/WV54UOFT5ATRGV65SYPFYCDOXQ/events.json","paper":"https://pith.science/paper/WV54UOFT"},"agent_actions":{"view_html":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ","download_json":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ.json","view_paper":"https://pith.science/paper/WV54UOFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0306054&json=true","fetch_graph":"https://pith.science/api/pith-number/WV54UOFT5ATRGV65SYPFYCDOXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WV54UOFT5ATRGV65SYPFYCDOXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ/action/storage_attestation","attest_author":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ/action/author_attestation","sign_citation":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ/action/citation_signature","submit_replication":"https://pith.science/pith/WV54UOFT5ATRGV65SYPFYCDOXQ/action/replication_record"}},"created_at":"2026-07-04T14:46:19.683518+00:00","updated_at":"2026-07-04T14:46:19.683518+00:00"}