{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PHERIUUIMBQMPSGSUHL2HNIYQJ","short_pith_number":"pith:PHERIUUI","schema_version":"1.0","canonical_sha256":"79c91452886060c7c8d2a1d7a3b518826bab0220d970d1bc68d208de71a30724","source":{"kind":"arxiv","id":"2404.03167","version":2},"attestation_state":"computed","paper":{"title":"Non-variational Quantum Combinatorial Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Jingbo Wang, Lyle Noakes, Tavis Bennett","submitted_at":"2024-04-04T02:36:24Z","abstract_excerpt":"This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process achieved through repeated application of two unitaries; one inducing phase-shifts dependent on objective function values, and the other mixing phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific graph. The algorithm's versatility is demonstrated through its application to various problems, namely those for which so"},"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":"2404.03167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-04T02:36:24Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"2d52b0b8b523ba1b47b852120d9ded4fe1e4e64057cf164982d2499014ed066e","abstract_canon_sha256":"5c4e48718fb73eef00e5b7a8281eb0a46947967dfddbd6ab9fdd5e5182aa4817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:55.373446Z","signature_b64":"pBqUzeZ1/y7yT+84wvl2yfLI1f1VFvLaSksOJfpdbbhm4qykaodqUT+GzNXKqpLsK7dX2fgYjWLFaSjmp9YHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c91452886060c7c8d2a1d7a3b518826bab0220d970d1bc68d208de71a30724","last_reissued_at":"2026-07-05T08:50:55.372974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:55.372974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-variational Quantum Combinatorial Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Jingbo Wang, Lyle Noakes, Tavis Bennett","submitted_at":"2024-04-04T02:36:24Z","abstract_excerpt":"This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process achieved through repeated application of two unitaries; one inducing phase-shifts dependent on objective function values, and the other mixing phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific graph. The algorithm's versatility is demonstrated through its application to various problems, namely those for which so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03167","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/2404.03167/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":"2404.03167","created_at":"2026-07-05T08:50:55.373027+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03167v2","created_at":"2026-07-05T08:50:55.373027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03167","created_at":"2026-07-05T08:50:55.373027+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHERIUUIMBQM","created_at":"2026-07-05T08:50:55.373027+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHERIUUIMBQMPSGS","created_at":"2026-07-05T08:50:55.373027+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHERIUUI","created_at":"2026-07-05T08:50:55.373027+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24191","citing_title":"Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ","json":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ.json","graph_json":"https://pith.science/api/pith-number/PHERIUUIMBQMPSGSUHL2HNIYQJ/graph.json","events_json":"https://pith.science/api/pith-number/PHERIUUIMBQMPSGSUHL2HNIYQJ/events.json","paper":"https://pith.science/paper/PHERIUUI"},"agent_actions":{"view_html":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ","download_json":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ.json","view_paper":"https://pith.science/paper/PHERIUUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03167&json=true","fetch_graph":"https://pith.science/api/pith-number/PHERIUUIMBQMPSGSUHL2HNIYQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PHERIUUIMBQMPSGSUHL2HNIYQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ/action/storage_attestation","attest_author":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ/action/author_attestation","sign_citation":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ/action/citation_signature","submit_replication":"https://pith.science/pith/PHERIUUIMBQMPSGSUHL2HNIYQJ/action/replication_record"}},"created_at":"2026-07-05T08:50:55.373027+00:00","updated_at":"2026-07-05T08:50:55.373027+00:00"}