{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KNZEILCIMXZ22SMUNWI5NASGOG","short_pith_number":"pith:KNZEILCI","schema_version":"1.0","canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","source":{"kind":"arxiv","id":"1707.01581","version":2},"attestation_state":"computed","paper":{"title":"Finding paths with quantum walks or quantum walking through a maze","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Daniel Reitzner, Mark Hillery","submitted_at":"2017-07-05T21:09:07Z","abstract_excerpt":"We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we provide an analytical result showing that by starting in a phase-modulated highly superposed initial state we can find the path in $O(M\\sqrt{N}\\log M)$ steps. Next, we improve this efficiency by showing that the recovery of the path can also be performed by a series of successive searches when we start "},"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":"1707.01581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"2bda5cfa3bf57c4b0993bbf0398ecca3aca43fc93a9d083798b9e60ee85b2818","abstract_canon_sha256":"4782c3dc622f59d8967179c3938a4c789294239581a3803caefc12996d55f89b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:03.838892Z","signature_b64":"iBxVATJAyEQqBdz5PhFT5blvuPXcsZOuD6JCdS8YVPh5vlwdcWR5gvl+LVw25W2eeH3Wc8Vc9NYb9Uqqr1nXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","last_reissued_at":"2026-05-18T00:35:03.838162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:03.838162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding paths with quantum walks or quantum walking through a maze","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Daniel Reitzner, Mark Hillery","submitted_at":"2017-07-05T21:09:07Z","abstract_excerpt":"We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we provide an analytical result showing that by starting in a phase-modulated highly superposed initial state we can find the path in $O(M\\sqrt{N}\\log M)$ steps. Next, we improve this efficiency by showing that the recovery of the path can also be performed by a series of successive searches when we start "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01581","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":"1707.01581","created_at":"2026-05-18T00:35:03.838289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01581v2","created_at":"2026-05-18T00:35:03.838289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01581","created_at":"2026-05-18T00:35:03.838289+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNZEILCIMXZ2","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNZEILCIMXZ22SMU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNZEILCI","created_at":"2026-05-18T12:31:24.725408+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/KNZEILCIMXZ22SMUNWI5NASGOG","json":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG.json","graph_json":"https://pith.science/api/pith-number/KNZEILCIMXZ22SMUNWI5NASGOG/graph.json","events_json":"https://pith.science/api/pith-number/KNZEILCIMXZ22SMUNWI5NASGOG/events.json","paper":"https://pith.science/paper/KNZEILCI"},"agent_actions":{"view_html":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG","download_json":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG.json","view_paper":"https://pith.science/paper/KNZEILCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01581&json=true","fetch_graph":"https://pith.science/api/pith-number/KNZEILCIMXZ22SMUNWI5NASGOG/graph.json","fetch_events":"https://pith.science/api/pith-number/KNZEILCIMXZ22SMUNWI5NASGOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/action/storage_attestation","attest_author":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/action/author_attestation","sign_citation":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/action/citation_signature","submit_replication":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/action/replication_record"}},"created_at":"2026-05-18T00:35:03.838289+00:00","updated_at":"2026-05-18T00:35:03.838289+00:00"}