{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BZWYJY67QYGHP3MFCJMPXDA6QS","short_pith_number":"pith:BZWYJY67","schema_version":"1.0","canonical_sha256":"0e6d84e3df860c77ed851258fb8c1e848a0442a068528fe1bed9649cb794ebc2","source":{"kind":"arxiv","id":"2101.05742","version":3},"attestation_state":"computed","paper":{"title":"Quantum annealing initialization of the quantum approximate optimization algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Maksym Serbyn, Stefan H. Sack","submitted_at":"2021-01-14T17:45:13Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with sub-optimal performan"},"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":"2101.05742","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-01-14T17:45:13Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","physics.comp-ph"],"title_canon_sha256":"20c69a1eaa11221b09ffbf1f52ccd1b799432eaf7efc3f7590aad51d58d19929","abstract_canon_sha256":"44d24b31a7d5ff74ee12a63454619cd0a2520d2a6376a56fb43ca680538322fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:05.461766Z","signature_b64":"FrV64D8i3YL+YE5tZUMMAgRddzh60WjvCXvAFBWbq8wcCPneeRlP8rDKNj80aqBDi4lBnzA+/eZwU9EDypO+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e6d84e3df860c77ed851258fb8c1e848a0442a068528fe1bed9649cb794ebc2","last_reissued_at":"2026-07-05T03:51:05.461273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:05.461273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum annealing initialization of the quantum approximate optimization algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Maksym Serbyn, Stefan H. Sack","submitted_at":"2021-01-14T17:45:13Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with sub-optimal performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05742","kind":"arxiv","version":3},"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/2101.05742/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":"2101.05742","created_at":"2026-07-05T03:51:05.461340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05742v3","created_at":"2026-07-05T03:51:05.461340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05742","created_at":"2026-07-05T03:51:05.461340+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZWYJY67QYGH","created_at":"2026-07-05T03:51:05.461340+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZWYJY67QYGHP3MF","created_at":"2026-07-05T03:51:05.461340+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZWYJY67","created_at":"2026-07-05T03:51:05.461340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"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":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS","json":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS.json","graph_json":"https://pith.science/api/pith-number/BZWYJY67QYGHP3MFCJMPXDA6QS/graph.json","events_json":"https://pith.science/api/pith-number/BZWYJY67QYGHP3MFCJMPXDA6QS/events.json","paper":"https://pith.science/paper/BZWYJY67"},"agent_actions":{"view_html":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS","download_json":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS.json","view_paper":"https://pith.science/paper/BZWYJY67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05742&json=true","fetch_graph":"https://pith.science/api/pith-number/BZWYJY67QYGHP3MFCJMPXDA6QS/graph.json","fetch_events":"https://pith.science/api/pith-number/BZWYJY67QYGHP3MFCJMPXDA6QS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS/action/storage_attestation","attest_author":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS/action/author_attestation","sign_citation":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS/action/citation_signature","submit_replication":"https://pith.science/pith/BZWYJY67QYGHP3MFCJMPXDA6QS/action/replication_record"}},"created_at":"2026-07-05T03:51:05.461340+00:00","updated_at":"2026-07-05T03:51:05.461340+00:00"}