{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74BV3TSXH2Z7XNENDSYETWUDQC","short_pith_number":"pith:74BV3TSX","schema_version":"1.0","canonical_sha256":"ff035dce573eb3fbb48d1cb049da8380aa35c4767b10ff4d1fd27453849c4935","source":{"kind":"arxiv","id":"2508.16309","version":1},"attestation_state":"computed","paper":{"title":"Quantum-Enhanced Optimization by Warm Starts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Ieva \\v{C}epait\\.e, Leo Zhou, Niam Vaishnav","submitted_at":"2025-08-22T11:36:19Z","abstract_excerpt":"We present an approach, which we term quantum-enhanced optimization, to accelerate classical optimization algorithms by leveraging quantum sampling. Our method uses quantum-generated samples as warm starts to classical heuristics for solving challenging combinatorial problems like Max-Cut and Maximum Independent Set (MIS). To implement the method efficiently, we introduce novel parameter-setting strategies for the Quantum Approximate Optimization Algorithm (QAOA), qubit mapping and routing techniques to reduce gate counts, and error-mitigation techniques. Experimental results, including on qua"},"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":"2508.16309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-22T11:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"b77e12daacd770ddce6f52b82b1ea6d24ae4f7c9a8edc2c6c13902ff7ecca22c","abstract_canon_sha256":"52225df0216f42621b2a8da469a237d78b4be6b99f984e95efdf81d4acd2ac65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:45.880003Z","signature_b64":"OrLudNngMD9y7spyBczorUWO/X+4+KQIvMcR4o6PqTQhdbGucxUSlnCow3tQtm302Z+w6TxNcTn+HLIpkWsOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff035dce573eb3fbb48d1cb049da8380aa35c4767b10ff4d1fd27453849c4935","last_reissued_at":"2026-07-05T11:57:45.879406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:45.879406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Enhanced Optimization by Warm Starts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Ieva \\v{C}epait\\.e, Leo Zhou, Niam Vaishnav","submitted_at":"2025-08-22T11:36:19Z","abstract_excerpt":"We present an approach, which we term quantum-enhanced optimization, to accelerate classical optimization algorithms by leveraging quantum sampling. Our method uses quantum-generated samples as warm starts to classical heuristics for solving challenging combinatorial problems like Max-Cut and Maximum Independent Set (MIS). To implement the method efficiently, we introduce novel parameter-setting strategies for the Quantum Approximate Optimization Algorithm (QAOA), qubit mapping and routing techniques to reduce gate counts, and error-mitigation techniques. Experimental results, including on qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16309","kind":"arxiv","version":1},"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/2508.16309/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":"2508.16309","created_at":"2026-07-05T11:57:45.879477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16309v1","created_at":"2026-07-05T11:57:45.879477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16309","created_at":"2026-07-05T11:57:45.879477+00:00"},{"alias_kind":"pith_short_12","alias_value":"74BV3TSXH2Z7","created_at":"2026-07-05T11:57:45.879477+00:00"},{"alias_kind":"pith_short_16","alias_value":"74BV3TSXH2Z7XNEN","created_at":"2026-07-05T11:57:45.879477+00:00"},{"alias_kind":"pith_short_8","alias_value":"74BV3TSX","created_at":"2026-07-05T11:57:45.879477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":132,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":132,"is_internal_anchor":false},{"citing_arxiv_id":"2601.01516","citing_title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC","json":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC.json","graph_json":"https://pith.science/api/pith-number/74BV3TSXH2Z7XNENDSYETWUDQC/graph.json","events_json":"https://pith.science/api/pith-number/74BV3TSXH2Z7XNENDSYETWUDQC/events.json","paper":"https://pith.science/paper/74BV3TSX"},"agent_actions":{"view_html":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC","download_json":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC.json","view_paper":"https://pith.science/paper/74BV3TSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16309&json=true","fetch_graph":"https://pith.science/api/pith-number/74BV3TSXH2Z7XNENDSYETWUDQC/graph.json","fetch_events":"https://pith.science/api/pith-number/74BV3TSXH2Z7XNENDSYETWUDQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC/action/storage_attestation","attest_author":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC/action/author_attestation","sign_citation":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC/action/citation_signature","submit_replication":"https://pith.science/pith/74BV3TSXH2Z7XNENDSYETWUDQC/action/replication_record"}},"created_at":"2026-07-05T11:57:45.879477+00:00","updated_at":"2026-07-05T11:57:45.879477+00:00"}