{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:463KA3ELTOHQBJWOQISBGWMSPS","short_pith_number":"pith:463KA3EL","schema_version":"1.0","canonical_sha256":"e7b6a06c8b9b8f00a6ce82241359927cae3d2a774bd9a6fc391db53c245228b8","source":{"kind":"arxiv","id":"0903.3465","version":3},"attestation_state":"computed","paper":{"title":"Efficient Circuits for Quantum Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan","submitted_at":"2009-03-20T17:45:17Z","abstract_excerpt":"We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently integrable probability distributions. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measured in terms of how many times we have to apply a step of a quantum walk, compared to the number of necessary classical Markov chain steps. We consider a finer notion of complexity including the number of el"},"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":"0903.3465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-03-20T17:45:17Z","cross_cats_sorted":[],"title_canon_sha256":"f8f760032d5e06d380f2ec7274f68d96ce24b1e7f28088ae423c171c68d96ef2","abstract_canon_sha256":"99a1a39e166ce4cea82c209386d3e40efc288923666b4107e7db7ed190e52a7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:21.813517Z","signature_b64":"wAMDWHuP9lC+5OUIKEgiZl/K3zs0dKWU6r1iYK8JoCxfFflF/aOpzthTm5tDyPLNhFPUFCey9zseurfA5tyKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b6a06c8b9b8f00a6ce82241359927cae3d2a774bd9a6fc391db53c245228b8","last_reissued_at":"2026-05-18T03:21:21.812998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:21.812998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Circuits for Quantum Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan","submitted_at":"2009-03-20T17:45:17Z","abstract_excerpt":"We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently integrable probability distributions. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measured in terms of how many times we have to apply a step of a quantum walk, compared to the number of necessary classical Markov chain steps. We consider a finer notion of complexity including the number of el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3465","kind":"arxiv","version":3},"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":"0903.3465","created_at":"2026-05-18T03:21:21.813071+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.3465v3","created_at":"2026-05-18T03:21:21.813071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3465","created_at":"2026-05-18T03:21:21.813071+00:00"},{"alias_kind":"pith_short_12","alias_value":"463KA3ELTOHQ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"463KA3ELTOHQBJWO","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"463KA3EL","created_at":"2026-05-18T12:25:58.018023+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/463KA3ELTOHQBJWOQISBGWMSPS","json":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS.json","graph_json":"https://pith.science/api/pith-number/463KA3ELTOHQBJWOQISBGWMSPS/graph.json","events_json":"https://pith.science/api/pith-number/463KA3ELTOHQBJWOQISBGWMSPS/events.json","paper":"https://pith.science/paper/463KA3EL"},"agent_actions":{"view_html":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS","download_json":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS.json","view_paper":"https://pith.science/paper/463KA3EL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.3465&json=true","fetch_graph":"https://pith.science/api/pith-number/463KA3ELTOHQBJWOQISBGWMSPS/graph.json","fetch_events":"https://pith.science/api/pith-number/463KA3ELTOHQBJWOQISBGWMSPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS/action/storage_attestation","attest_author":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS/action/author_attestation","sign_citation":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS/action/citation_signature","submit_replication":"https://pith.science/pith/463KA3ELTOHQBJWOQISBGWMSPS/action/replication_record"}},"created_at":"2026-05-18T03:21:21.813071+00:00","updated_at":"2026-05-18T03:21:21.813071+00:00"}