{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7UGDDPJQD6LI6RCFDXLFQLESTK","short_pith_number":"pith:7UGDDPJQ","schema_version":"1.0","canonical_sha256":"fd0c31bd301f968f44451dd6582c929a9f3329263364d7cdaa9a3fe0ca6817a1","source":{"kind":"arxiv","id":"2511.01312","version":2},"attestation_state":"computed","paper":{"title":"Heuristics for multi-stage quantum walks to find Ising ground states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asa Hopkins, Viv Kendon","submitted_at":"2025-11-03T07:54:58Z","abstract_excerpt":"One way to approximate a quantum annealing schedule is to use multiple quantum walks chained together, without intermediate measurements, to produce a multi-stage quantum walk (MSQW). Previous work has shown that a MSQW is better than QAOA (quantum alternating operator ansatz) for solving optimization tasks using multiple stages [Gerblich et al, arXiv:2407.06663]. In this work, we develop an efficient heuristic for choosing the free parameters in MSQW, and use it to obtain improved scaling compared to single stage quantum walks. We show numerically that the heuristic works well for problems wi"},"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":"2511.01312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-11-03T07:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"198b54043de2950a1de090eeb14d082b2c865067813fbcdcf42327175f9f3761","abstract_canon_sha256":"3e5278acace3d374de6e75b203febe0846fa52f36d52328099a381a40ceb1c0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:39.502415Z","signature_b64":"pcpkG+STxY8MCp7BiNRc9sVsiqlmzqbYGjLZFr2G+O98R5ZzUzrj9dO82X0Fq7G996OnkgJNSj3qCx1kqM5NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0c31bd301f968f44451dd6582c929a9f3329263364d7cdaa9a3fe0ca6817a1","last_reissued_at":"2026-05-27T01:05:39.501897Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:39.501897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristics for multi-stage quantum walks to find Ising ground states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asa Hopkins, Viv Kendon","submitted_at":"2025-11-03T07:54:58Z","abstract_excerpt":"One way to approximate a quantum annealing schedule is to use multiple quantum walks chained together, without intermediate measurements, to produce a multi-stage quantum walk (MSQW). Previous work has shown that a MSQW is better than QAOA (quantum alternating operator ansatz) for solving optimization tasks using multiple stages [Gerblich et al, arXiv:2407.06663]. In this work, we develop an efficient heuristic for choosing the free parameters in MSQW, and use it to obtain improved scaling compared to single stage quantum walks. We show numerically that the heuristic works well for problems wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.01312","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.01312/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":"2511.01312","created_at":"2026-05-27T01:05:39.501958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.01312v2","created_at":"2026-05-27T01:05:39.501958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.01312","created_at":"2026-05-27T01:05:39.501958+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UGDDPJQD6LI","created_at":"2026-05-27T01:05:39.501958+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UGDDPJQD6LI6RCF","created_at":"2026-05-27T01:05:39.501958+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UGDDPJQ","created_at":"2026-05-27T01:05:39.501958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.13032","citing_title":"Zeno Blockade Enabling Photonic Quantum Optimization","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK","json":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK.json","graph_json":"https://pith.science/api/pith-number/7UGDDPJQD6LI6RCFDXLFQLESTK/graph.json","events_json":"https://pith.science/api/pith-number/7UGDDPJQD6LI6RCFDXLFQLESTK/events.json","paper":"https://pith.science/paper/7UGDDPJQ"},"agent_actions":{"view_html":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK","download_json":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK.json","view_paper":"https://pith.science/paper/7UGDDPJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.01312&json=true","fetch_graph":"https://pith.science/api/pith-number/7UGDDPJQD6LI6RCFDXLFQLESTK/graph.json","fetch_events":"https://pith.science/api/pith-number/7UGDDPJQD6LI6RCFDXLFQLESTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK/action/storage_attestation","attest_author":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK/action/author_attestation","sign_citation":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK/action/citation_signature","submit_replication":"https://pith.science/pith/7UGDDPJQD6LI6RCFDXLFQLESTK/action/replication_record"}},"created_at":"2026-05-27T01:05:39.501958+00:00","updated_at":"2026-05-27T01:05:39.501958+00:00"}