{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O3MRPG44U5AJHE7S7AXZ47LEQT","short_pith_number":"pith:O3MRPG44","schema_version":"1.0","canonical_sha256":"76d9179b9ca7409393f2f82f9e7d6484c009f8fc76cb3d6e40936b0b97b08d7e","source":{"kind":"arxiv","id":"2402.05549","version":2},"attestation_state":"computed","paper":{"title":"Transfer learning of optimal QAOA parameters in combinatorial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Dennis Willsch, J. A. Montanez-Barrera, Kristel Michielsen","submitted_at":"2024-02-08T10:35:23Z","abstract_excerpt":"Solving combinatorial optimization problems (COPs) is a promising application of quantum computation, with the Quantum Approximate Optimization Algorithm (QAOA) being one of the most studied quantum algorithms for solving them. However, multiple factors make the parameter search of the QAOA a hard optimization problem. In this work, we study transfer learning (TL), a methodology to reuse pre-trained QAOA parameters of one problem instance into different COP instances. This methodology can be used to alleviate the necessity of classical optimization to find good parameters for individual proble"},"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":"2402.05549","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-08T10:35:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"46847d30429efb03111ea451b07535292a2d3a142ebb280a07d1786e914ff95c","abstract_canon_sha256":"6fb813be9693ee1efb630e7a2500db86dfa5c51f4481fd87e84f11efd679039d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:32.106394Z","signature_b64":"633oL122HeR8tO8iNHEQNuQKmbooKQTkncEqg74dAZNBvn9onhl52EZZOaHPZKGxea47HEdGpp9TptywHLhLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76d9179b9ca7409393f2f82f9e7d6484c009f8fc76cb3d6e40936b0b97b08d7e","last_reissued_at":"2026-07-05T11:05:32.105933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:32.105933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transfer learning of optimal QAOA parameters in combinatorial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Dennis Willsch, J. A. Montanez-Barrera, Kristel Michielsen","submitted_at":"2024-02-08T10:35:23Z","abstract_excerpt":"Solving combinatorial optimization problems (COPs) is a promising application of quantum computation, with the Quantum Approximate Optimization Algorithm (QAOA) being one of the most studied quantum algorithms for solving them. However, multiple factors make the parameter search of the QAOA a hard optimization problem. In this work, we study transfer learning (TL), a methodology to reuse pre-trained QAOA parameters of one problem instance into different COP instances. This methodology can be used to alleviate the necessity of classical optimization to find good parameters for individual proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05549","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/2402.05549/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":"2402.05549","created_at":"2026-07-05T11:05:32.105990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05549v2","created_at":"2026-07-05T11:05:32.105990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05549","created_at":"2026-07-05T11:05:32.105990+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3MRPG44U5AJ","created_at":"2026-07-05T11:05:32.105990+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3MRPG44U5AJHE7S","created_at":"2026-07-05T11:05:32.105990+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3MRPG44","created_at":"2026-07-05T11:05:32.105990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.15375","citing_title":"Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25275","citing_title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT","json":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT.json","graph_json":"https://pith.science/api/pith-number/O3MRPG44U5AJHE7S7AXZ47LEQT/graph.json","events_json":"https://pith.science/api/pith-number/O3MRPG44U5AJHE7S7AXZ47LEQT/events.json","paper":"https://pith.science/paper/O3MRPG44"},"agent_actions":{"view_html":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT","download_json":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT.json","view_paper":"https://pith.science/paper/O3MRPG44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05549&json=true","fetch_graph":"https://pith.science/api/pith-number/O3MRPG44U5AJHE7S7AXZ47LEQT/graph.json","fetch_events":"https://pith.science/api/pith-number/O3MRPG44U5AJHE7S7AXZ47LEQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT/action/storage_attestation","attest_author":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT/action/author_attestation","sign_citation":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT/action/citation_signature","submit_replication":"https://pith.science/pith/O3MRPG44U5AJHE7S7AXZ47LEQT/action/replication_record"}},"created_at":"2026-07-05T11:05:32.105990+00:00","updated_at":"2026-07-05T11:05:32.105990+00:00"}