{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WVXWFSE6HFCW2ELMLCZERI2W6J","short_pith_number":"pith:WVXWFSE6","schema_version":"1.0","canonical_sha256":"b56f62c89e39456d116c58b248a356f254f64a454cff7313f7b87ca4eb6172fb","source":{"kind":"arxiv","id":"2010.14021","version":3},"attestation_state":"computed","paper":{"title":"Bridging Classical and Quantum with SDP initialized warm-starts for QAOA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Creston Herold, Greg Mohler, Majid Farhadi, Reuben Tate, Swati Gupta","submitted_at":"2020-10-27T02:57:22Z","abstract_excerpt":"We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem. Near-term (noisy) quantum devices are only able to (accurately) execute QAOA at low circuit depths while QAOA requires a relatively high circuit-depth in order to \"see\" the whole graph. We introduce a classical pre-processing step that initializes QAOA with a biased superposition of all possible cuts in the graph, referred to as a warm-start. In particular, our initialization informs QAOA by a solution to a low-rank semidefinite programming relaxation of the Max-Cut problem. Our experimental r"},"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":"2010.14021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-10-27T02:57:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"57b0b33ae179c1499a98d94ff89fa0634c747bb503b95d1a09aefbf2c0f9a7e7","abstract_canon_sha256":"d03fa48bc9e3b3e9e69e9e1c78d3b033e27d062ffc13c9642e33cb9661401934"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:42.966522Z","signature_b64":"XvnsHpVzVU4kCUg/odnVdJ8314+O9h1WExuKjoLhU0veIXKVL5I4EwDuVyEyTqd6CFGtMsoaSaxwoc6k2l7kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b56f62c89e39456d116c58b248a356f254f64a454cff7313f7b87ca4eb6172fb","last_reissued_at":"2026-07-05T06:43:42.966104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:42.966104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging Classical and Quantum with SDP initialized warm-starts for QAOA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Creston Herold, Greg Mohler, Majid Farhadi, Reuben Tate, Swati Gupta","submitted_at":"2020-10-27T02:57:22Z","abstract_excerpt":"We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem. Near-term (noisy) quantum devices are only able to (accurately) execute QAOA at low circuit depths while QAOA requires a relatively high circuit-depth in order to \"see\" the whole graph. We introduce a classical pre-processing step that initializes QAOA with a biased superposition of all possible cuts in the graph, referred to as a warm-start. In particular, our initialization informs QAOA by a solution to a low-rank semidefinite programming relaxation of the Max-Cut problem. Our experimental r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14021","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/2010.14021/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":"2010.14021","created_at":"2026-07-05T06:43:42.966167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.14021v3","created_at":"2026-07-05T06:43:42.966167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14021","created_at":"2026-07-05T06:43:42.966167+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVXWFSE6HFCW","created_at":"2026-07-05T06:43:42.966167+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVXWFSE6HFCW2ELM","created_at":"2026-07-05T06:43:42.966167+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVXWFSE6","created_at":"2026-07-05T06:43:42.966167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.02590","citing_title":"Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J","json":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J.json","graph_json":"https://pith.science/api/pith-number/WVXWFSE6HFCW2ELMLCZERI2W6J/graph.json","events_json":"https://pith.science/api/pith-number/WVXWFSE6HFCW2ELMLCZERI2W6J/events.json","paper":"https://pith.science/paper/WVXWFSE6"},"agent_actions":{"view_html":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J","download_json":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J.json","view_paper":"https://pith.science/paper/WVXWFSE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.14021&json=true","fetch_graph":"https://pith.science/api/pith-number/WVXWFSE6HFCW2ELMLCZERI2W6J/graph.json","fetch_events":"https://pith.science/api/pith-number/WVXWFSE6HFCW2ELMLCZERI2W6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J/action/storage_attestation","attest_author":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J/action/author_attestation","sign_citation":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J/action/citation_signature","submit_replication":"https://pith.science/pith/WVXWFSE6HFCW2ELMLCZERI2W6J/action/replication_record"}},"created_at":"2026-07-05T06:43:42.966167+00:00","updated_at":"2026-07-05T06:43:42.966167+00:00"}