{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AH37TN4U7DLXRUGECFWV667WIC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c31bc5e5befb1fbcc70470c70e351bcaa8235a48560fd829b946f1450a5d2d33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T06:54:28Z","title_canon_sha256":"8950dd77b79665ae03ef5d6dec32a9728b2aafebd9123e1e421810bc62fbab91"},"schema_version":"1.0","source":{"id":"2605.13082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13082","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13082v1","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13082","created_at":"2026-05-18T03:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"AH37TN4U7DLX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AH37TN4U7DLXRUGE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AH37TN4U","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:36c89b6648decc0532137890ac21d16743e01093b34e43bd22fb9781e2f2411f","target":"graph","created_at":"2026-05-18T03:08:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and one classical algorithm shows significant scalability for higher-order unconstrained binary optimization problems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the quantum-classical correspondence of spin systems preserves the relative performance ranking between the quantum and classical feedback algorithms on the tested instances."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Classical feedback-based optimization matches or exceeds quantum performance in speed and scalability while quantum retains an edge in final solution quality on tested instances."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Quantum optimization produces higher-quality solutions than classical counterparts but converges more slowly"}],"snapshot_sha256":"c49a9e06b28f494aeb557fdd86df18b1b4458d14e0e6c1aac86649d2e2511b89"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin systems to discuss the possibility of quantum advantage. It also enables us to develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization. First, we compare the feedback-based algorithm for quantum optimization (FALQON) and its variant with their classical counterparts. Then, we perform benchmark tests of vario","authors_text":"Takuya Hatomura, Tomohiro Hattori","cross_cats":[],"headline":"Quantum optimization produces higher-quality solutions than classical counterparts but converges more slowly","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T06:54:28Z","title":"Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms"},"references":{"count":91,"internal_anchors":0,"resolved_work":91,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The single parameterβ X(t) is given by βX(t) = i⟨Ψ(t)| \" ˆHP, NX i=1 ˆXi # |Ψ(t)⟩,(6) which guarantees the reduction of the cost function (4)","work_id":"b03b93a0-cb90-4f88-a791-86efdc91eeda","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"[49], we can introduce multiple parameters","work_id":"2c91279e-84e1-4067-92d2-e86dfc616872","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"CC-FALQON We introduce the classical counterpart of FALQON (CC-FALQON). In CC-FALQON, we consider the fol- lowing Hamiltonian Ht =H P +β X(t) NX i=1 mX i , (12) 4 with the parameter βX(t) =−2 NX i=1 m","work_id":"82c49efb-e23e-4895-8909-8b90e27648a7","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"CC-iFALQON We also introduce the classical counterpart of iFALQON (CC-iFALQON). In CC-iFALQON, we con- sider the following Hamiltonian Ht =H P + NX i=1 βX i (t)mX i , (14) with the parameters βX i (t)","work_id":"aee7dacf-9273-4ea8-8c2b-e69545f1334c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"CACAO In CACAO [63], which was derived from the theory of FALQON, we consider the following Hamiltonian Ht = NX i=1 βY i (t)mY i , (16) with the parameters βY i (t) = 2mX i ∂HP ∂mZ i .(17) In the prev","work_id":"904cb66a-a56b-4491-8ec4-974c790c8f06","year":null}],"snapshot_sha256":"3086a2506f0c3d17eca61ae502f0657435b4650a17d3bc525259b927c7caea86"},"source":{"id":"2605.13082","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:03:14.521273Z","id":"b2b839c9-a9af-4b79-abae-2ad5df99b65f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Classical feedback-based optimization matches or exceeds quantum performance in speed and scalability while quantum retains an edge in final solution quality on tested instances.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Quantum optimization produces higher-quality solutions than classical counterparts but converges more slowly","strongest_claim":"Quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and one classical algorithm shows significant scalability for higher-order unconstrained binary optimization problems.","weakest_assumption":"That the quantum-classical correspondence of spin systems preserves the relative performance ranking between the quantum and classical feedback algorithms on the tested instances."}},"verdict_id":"b2b839c9-a9af-4b79-abae-2ad5df99b65f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a6779cf48289508ba41344e5a45ee2428346cc796d64ec3101f468cb3c7e37dc","target":"record","created_at":"2026-05-18T03:08:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c31bc5e5befb1fbcc70470c70e351bcaa8235a48560fd829b946f1450a5d2d33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T06:54:28Z","title_canon_sha256":"8950dd77b79665ae03ef5d6dec32a9728b2aafebd9123e1e421810bc62fbab91"},"schema_version":"1.0","source":{"id":"2605.13082","kind":"arxiv","version":1}},"canonical_sha256":"01f7f9b794f8d778d0c4116d5f7bf640872cf33e183030b6f48ca0869592267c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01f7f9b794f8d778d0c4116d5f7bf640872cf33e183030b6f48ca0869592267c","first_computed_at":"2026-05-18T03:08:58.656334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:58.656334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4I90axsVB1dQ0AlmTjRlwvSCH2T63eMYGKUTmcFyW/ZNoOCBXja7IKkWI13ndA1jvQSbhcQGJZNhY1blMA2pDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:58.656908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6779cf48289508ba41344e5a45ee2428346cc796d64ec3101f468cb3c7e37dc","sha256:36c89b6648decc0532137890ac21d16743e01093b34e43bd22fb9781e2f2411f"],"state_sha256":"c1f1a33ba483ae6d5cbb3b0b8a155e7326fb1d9f2fb400919a7394636844bf9a"}