{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:22MXFN7GRIQ4T23YDUCT7ZGRMD","short_pith_number":"pith:22MXFN7G","schema_version":"1.0","canonical_sha256":"d69972b7e68a21c9eb781d053fe4d160e7de41eeb55fe17b163a1db805239df7","source":{"kind":"arxiv","id":"quant-ph/0104137","version":1},"attestation_state":"computed","paper":{"title":"Quantum Walks on the Hypercube","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Russell, Cristopher Moore","submitted_at":"2001-04-29T00:28:03Z","abstract_excerpt":"Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (\\pi/4)n steps, faster than the O(n log n) steps required by the classical walk. In the continuous-time case, the probability distribution is {\\em exactly} uniform at this time. More importantly, these walks expose several subtleties "},"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/0104137","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-04-29T00:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"ef5035de46ac858f6870d7a1a0978eb3c2d983e899f399ff1185518a52826dd8","abstract_canon_sha256":"9fcb07867011628019fdd5e667801c32a53df611e11b7cf6219f5fea0617043a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:37.808605Z","signature_b64":"28SHR6SrOZF8gduQQQ8O/GLbdpXi9ZjEgWdsL0pgWGyDacxi5yqVc+JtUG7dZyWODof2fRVvIaNTVXH/TZ2uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69972b7e68a21c9eb781d053fe4d160e7de41eeb55fe17b163a1db805239df7","last_reissued_at":"2026-07-04T14:45:37.808243Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:37.808243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Walks on the Hypercube","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Russell, Cristopher Moore","submitted_at":"2001-04-29T00:28:03Z","abstract_excerpt":"Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (\\pi/4)n steps, faster than the O(n log n) steps required by the classical walk. In the continuous-time case, the probability distribution is {\\em exactly} uniform at this time. More importantly, these walks expose several subtleties "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0104137","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/0104137/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/0104137","created_at":"2026-07-04T14:45:37.808298+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0104137v1","created_at":"2026-07-04T14:45:37.808298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0104137","created_at":"2026-07-04T14:45:37.808298+00:00"},{"alias_kind":"pith_short_12","alias_value":"22MXFN7GRIQ4","created_at":"2026-07-04T14:45:37.808298+00:00"},{"alias_kind":"pith_short_16","alias_value":"22MXFN7GRIQ4T23Y","created_at":"2026-07-04T14:45:37.808298+00:00"},{"alias_kind":"pith_short_8","alias_value":"22MXFN7G","created_at":"2026-07-04T14:45:37.808298+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/22MXFN7GRIQ4T23YDUCT7ZGRMD","json":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD.json","graph_json":"https://pith.science/api/pith-number/22MXFN7GRIQ4T23YDUCT7ZGRMD/graph.json","events_json":"https://pith.science/api/pith-number/22MXFN7GRIQ4T23YDUCT7ZGRMD/events.json","paper":"https://pith.science/paper/22MXFN7G"},"agent_actions":{"view_html":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD","download_json":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD.json","view_paper":"https://pith.science/paper/22MXFN7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0104137&json=true","fetch_graph":"https://pith.science/api/pith-number/22MXFN7GRIQ4T23YDUCT7ZGRMD/graph.json","fetch_events":"https://pith.science/api/pith-number/22MXFN7GRIQ4T23YDUCT7ZGRMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD/action/storage_attestation","attest_author":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD/action/author_attestation","sign_citation":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD/action/citation_signature","submit_replication":"https://pith.science/pith/22MXFN7GRIQ4T23YDUCT7ZGRMD/action/replication_record"}},"created_at":"2026-07-04T14:45:37.808298+00:00","updated_at":"2026-07-04T14:45:37.808298+00:00"}