{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:ZP5SDISXMHFQMDMDW2S2PAYPSH","short_pith_number":"pith:ZP5SDISX","schema_version":"1.0","canonical_sha256":"cbfb21a25761cb060d83b6a5a7830f91fe4af210aa74494bedde419aead1e515","source":{"kind":"arxiv","id":"quant-ph/0010117","version":1},"attestation_state":"computed","paper":{"title":"Quantum Walk on the Line","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashvin Vishwanath, Ashwin Nayak","submitted_at":"2000-10-31T23:10:21Z","abstract_excerpt":"Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the ``Hadamard walk''. We show that after t time steps, the probability distribution on the line induced by the Hadamard walk is almost uniformly distributed over the interval [-t/sqrt(2),t/sqrt(2)]. This implies that the same walk defined on the circle mixes in_linear_ time. This is in direct contrast with the quadratic mixing time for 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/0010117","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-10-31T23:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"a61dfa10e3d6b7264e69007e23938fb63b052c77ba6f6b3d4fbae8c4701fd661","abstract_canon_sha256":"26e8b60fd057ddff5fe8866c7fe7f89af87b761051b10c3f3a52dc024da0d617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:32.848527Z","signature_b64":"h0t/14rAJ7X4+gYtLxL+b76Ni9lJ5eVHeIszLCEtuAnnTjermi98/ORDYZ6btQY1MnZXnmcX3eLb7qVrSFqxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbfb21a25761cb060d83b6a5a7830f91fe4af210aa74494bedde419aead1e515","last_reissued_at":"2026-07-04T14:45:32.848197Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:32.848197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Walk on the Line","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashvin Vishwanath, Ashwin Nayak","submitted_at":"2000-10-31T23:10:21Z","abstract_excerpt":"Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the ``Hadamard walk''. We show that after t time steps, the probability distribution on the line induced by the Hadamard walk is almost uniformly distributed over the interval [-t/sqrt(2),t/sqrt(2)]. This implies that the same walk defined on the circle mixes in_linear_ time. This is in direct contrast with the quadratic mixing time for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0010117","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/0010117/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/0010117","created_at":"2026-07-04T14:45:32.848248+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0010117v1","created_at":"2026-07-04T14:45:32.848248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0010117","created_at":"2026-07-04T14:45:32.848248+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZP5SDISXMHFQ","created_at":"2026-07-04T14:45:32.848248+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZP5SDISXMHFQMDMD","created_at":"2026-07-04T14:45:32.848248+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZP5SDISX","created_at":"2026-07-04T14:45:32.848248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2111.09827","citing_title":"Response to glassy disorder in coin on spread of quantum walker","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20464","citing_title":"One-Dimensional Nonlinear Quantum Walks","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2603.16837","citing_title":"Ergodicity in discrete-time quantum walks","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03593","citing_title":"Moving Detector Quantum Walk with Random Relocation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00772","citing_title":"Entanglement capacity of complex networks from quantum walks","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH","json":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH.json","graph_json":"https://pith.science/api/pith-number/ZP5SDISXMHFQMDMDW2S2PAYPSH/graph.json","events_json":"https://pith.science/api/pith-number/ZP5SDISXMHFQMDMDW2S2PAYPSH/events.json","paper":"https://pith.science/paper/ZP5SDISX"},"agent_actions":{"view_html":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH","download_json":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH.json","view_paper":"https://pith.science/paper/ZP5SDISX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0010117&json=true","fetch_graph":"https://pith.science/api/pith-number/ZP5SDISXMHFQMDMDW2S2PAYPSH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZP5SDISXMHFQMDMDW2S2PAYPSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH/action/storage_attestation","attest_author":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH/action/author_attestation","sign_citation":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH/action/citation_signature","submit_replication":"https://pith.science/pith/ZP5SDISXMHFQMDMDW2S2PAYPSH/action/replication_record"}},"created_at":"2026-07-04T14:45:32.848248+00:00","updated_at":"2026-07-04T14:45:32.848248+00:00"}