{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MOB26VGNG6TECLJPMZ3HY57SP6","short_pith_number":"pith:MOB26VGN","schema_version":"1.0","canonical_sha256":"6383af54cd37a6412d2f66767c77f27fa5701ab09785eda0db309e9c6b58d022","source":{"kind":"arxiv","id":"1710.05084","version":1},"attestation_state":"computed","paper":{"title":"Finding paths in tree graphs with a quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Mark Hillery","submitted_at":"2017-10-13T21:41:55Z","abstract_excerpt":"In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a \"Tree Maze\", we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both exactly through numerical calculations as well as analytically using eigenvectors and eigenvalues of the quantum system."},"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":"1710.05084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-13T21:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"71453c61af8b879621929b8ed8cb9fa724627cae71453b0272492055d60e3aef","abstract_canon_sha256":"8bb30e4f6402b8860b56e2056217b0bb2685beb582480df0d354093aaaf6a008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:52.461084Z","signature_b64":"9QSglzx5wITTIwa+3K0RSreawacdEEL5doyQkw0BnQO0k8Gs29chXCdgGOrjfc78M3ZzPrSYuirso+2Z6t8kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6383af54cd37a6412d2f66767c77f27fa5701ab09785eda0db309e9c6b58d022","last_reissued_at":"2026-05-18T00:25:52.460521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:52.460521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding paths in tree graphs with a quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Mark Hillery","submitted_at":"2017-10-13T21:41:55Z","abstract_excerpt":"In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a \"Tree Maze\", we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both exactly through numerical calculations as well as analytically using eigenvectors and eigenvalues of the quantum system."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05084","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":"1710.05084","created_at":"2026-05-18T00:25:52.460588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05084v1","created_at":"2026-05-18T00:25:52.460588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05084","created_at":"2026-05-18T00:25:52.460588+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOB26VGNG6TE","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOB26VGNG6TECLJP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOB26VGN","created_at":"2026-05-18T12:31:31.346846+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/MOB26VGNG6TECLJPMZ3HY57SP6","json":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6.json","graph_json":"https://pith.science/api/pith-number/MOB26VGNG6TECLJPMZ3HY57SP6/graph.json","events_json":"https://pith.science/api/pith-number/MOB26VGNG6TECLJPMZ3HY57SP6/events.json","paper":"https://pith.science/paper/MOB26VGN"},"agent_actions":{"view_html":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6","download_json":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6.json","view_paper":"https://pith.science/paper/MOB26VGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05084&json=true","fetch_graph":"https://pith.science/api/pith-number/MOB26VGNG6TECLJPMZ3HY57SP6/graph.json","fetch_events":"https://pith.science/api/pith-number/MOB26VGNG6TECLJPMZ3HY57SP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6/action/storage_attestation","attest_author":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6/action/author_attestation","sign_citation":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6/action/citation_signature","submit_replication":"https://pith.science/pith/MOB26VGNG6TECLJPMZ3HY57SP6/action/replication_record"}},"created_at":"2026-05-18T00:25:52.460588+00:00","updated_at":"2026-05-18T00:25:52.460588+00:00"}