{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:3ZUVLNKH5LZV3Z454Q2BBUJE5I","short_pith_number":"pith:3ZUVLNKH","schema_version":"1.0","canonical_sha256":"de6955b547eaf35de79de43410d124ea3050a0e5f62de73735d5345b6fb0988a","source":{"kind":"arxiv","id":"quant-ph/0609035","version":1},"attestation_state":"computed","paper":{"title":"A random walk approach to quantum algorithms","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Viv Kendon","submitted_at":"2006-09-05T19:09:20Z","abstract_excerpt":"The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e., when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk, due to interference between the different possible paths. The upshot is that quantum walkers find themselve"},"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/0609035","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-09-05T19:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"ee7d4b13ea47b80811a30e7342ba0ef8fafbbba82e47b6ef2ac2516349d85448","abstract_canon_sha256":"1b55874d5eed9339bc9983a5719a3645ed1ef5e92c67a7f9e86cac41c43b95c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:56:46.213903Z","signature_b64":"7dJVKVI/B7YjkajQK1tGvbg9WbUSXPfKgry2GCtW/BWNS/i6ASu3urUcFYjRTCrgSTRReSmp/maPEiD/bh3gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de6955b547eaf35de79de43410d124ea3050a0e5f62de73735d5345b6fb0988a","last_reissued_at":"2026-07-04T14:56:46.213558Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:56:46.213558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A random walk approach to quantum algorithms","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Viv Kendon","submitted_at":"2006-09-05T19:09:20Z","abstract_excerpt":"The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e., when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk, due to interference between the different possible paths. The upshot is that quantum walkers find themselve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0609035","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0609035/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/0609035","created_at":"2026-07-04T14:56:46.213620+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0609035v1","created_at":"2026-07-04T14:56:46.213620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0609035","created_at":"2026-07-04T14:56:46.213620+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZUVLNKH5LZV","created_at":"2026-07-04T14:56:46.213620+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZUVLNKH5LZV3Z45","created_at":"2026-07-04T14:56:46.213620+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZUVLNKH","created_at":"2026-07-04T14:56:46.213620+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/3ZUVLNKH5LZV3Z454Q2BBUJE5I","json":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I.json","graph_json":"https://pith.science/api/pith-number/3ZUVLNKH5LZV3Z454Q2BBUJE5I/graph.json","events_json":"https://pith.science/api/pith-number/3ZUVLNKH5LZV3Z454Q2BBUJE5I/events.json","paper":"https://pith.science/paper/3ZUVLNKH"},"agent_actions":{"view_html":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I","download_json":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I.json","view_paper":"https://pith.science/paper/3ZUVLNKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0609035&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZUVLNKH5LZV3Z454Q2BBUJE5I/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZUVLNKH5LZV3Z454Q2BBUJE5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I/action/storage_attestation","attest_author":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I/action/author_attestation","sign_citation":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I/action/citation_signature","submit_replication":"https://pith.science/pith/3ZUVLNKH5LZV3Z454Q2BBUJE5I/action/replication_record"}},"created_at":"2026-07-04T14:56:46.213620+00:00","updated_at":"2026-07-04T14:56:46.213620+00:00"}