{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B5H36RNVO7PQFTF63PCFVRT363","short_pith_number":"pith:B5H36RNV","schema_version":"1.0","canonical_sha256":"0f4fbf45b577df02ccbedbc45ac67bf6cae27bb1b180285621281f91f9cf1f18","source":{"kind":"arxiv","id":"2505.24191","version":1},"attestation_state":"computed","paper":{"title":"Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Aidan Smith, Edric Matwiejew, Jingbo Wang, Tavis Bennett","submitted_at":"2025-05-30T04:02:46Z","abstract_excerpt":"We present benchmarking results for the non-variational Quantum Walk Optimisation Algorithm (non-variational QWOA) applied to the weighted maxcut problem, using classical simulations for problem sizes up to $n = 31$. The amplified quantum state, prepared using a quadratic number of alternating unitaries, achieves a constant average-case measurement probability for globally optimal solutions across these problem sizes. This behaviour contrasts with that of classical heuristics, which, for NP-hard optimisation problems, typically exhibit solve probabilities that decay as problem size increases. "},"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":"2505.24191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T04:02:46Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"09fc95522894e34cf299396b30d096c5cf83fb1332eb31354a4519e9383f2662","abstract_canon_sha256":"32224fcd9fa817d7ad6d34e249ba3fd5b50e94135195645e0aee09c1f62af5f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:43.809352Z","signature_b64":"zzGZU60Z8dMmzbRb+SfJnfSxFg5PaTlWZ3++Wqknx0P53PUVT9mh/1aO5RyPv9N8L+Dj4OKDyAX9a1LElyaDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4fbf45b577df02ccbedbc45ac67bf6cae27bb1b180285621281f91f9cf1f18","last_reissued_at":"2026-07-05T11:12:43.808781Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:43.808781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Aidan Smith, Edric Matwiejew, Jingbo Wang, Tavis Bennett","submitted_at":"2025-05-30T04:02:46Z","abstract_excerpt":"We present benchmarking results for the non-variational Quantum Walk Optimisation Algorithm (non-variational QWOA) applied to the weighted maxcut problem, using classical simulations for problem sizes up to $n = 31$. The amplified quantum state, prepared using a quadratic number of alternating unitaries, achieves a constant average-case measurement probability for globally optimal solutions across these problem sizes. This behaviour contrasts with that of classical heuristics, which, for NP-hard optimisation problems, typically exhibit solve probabilities that decay as problem size increases. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24191","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/2505.24191/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":"2505.24191","created_at":"2026-07-05T11:12:43.808842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24191v1","created_at":"2026-07-05T11:12:43.808842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24191","created_at":"2026-07-05T11:12:43.808842+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5H36RNVO7PQ","created_at":"2026-07-05T11:12:43.808842+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5H36RNVO7PQFTF6","created_at":"2026-07-05T11:12:43.808842+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5H36RNV","created_at":"2026-07-05T11:12:43.808842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21241","citing_title":"Assessing Cost Hamiltonian Reliability in Quantum Protein Structure Prediction","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363","json":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363.json","graph_json":"https://pith.science/api/pith-number/B5H36RNVO7PQFTF63PCFVRT363/graph.json","events_json":"https://pith.science/api/pith-number/B5H36RNVO7PQFTF63PCFVRT363/events.json","paper":"https://pith.science/paper/B5H36RNV"},"agent_actions":{"view_html":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363","download_json":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363.json","view_paper":"https://pith.science/paper/B5H36RNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24191&json=true","fetch_graph":"https://pith.science/api/pith-number/B5H36RNVO7PQFTF63PCFVRT363/graph.json","fetch_events":"https://pith.science/api/pith-number/B5H36RNVO7PQFTF63PCFVRT363/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363/action/storage_attestation","attest_author":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363/action/author_attestation","sign_citation":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363/action/citation_signature","submit_replication":"https://pith.science/pith/B5H36RNVO7PQFTF63PCFVRT363/action/replication_record"}},"created_at":"2026-07-05T11:12:43.808842+00:00","updated_at":"2026-07-05T11:12:43.808842+00:00"}