{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KOFWSPOH4242DCLIUXDMO24QG5","short_pith_number":"pith:KOFWSPOH","schema_version":"1.0","canonical_sha256":"538b693dc7e6b9a18968a5c6c76b90376d31a09034a6fae6b979ad3bb4440073","source":{"kind":"arxiv","id":"2410.03015","version":1},"attestation_state":"computed","paper":{"title":"Strategies for running the QAOA at hundreds of qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brandon Augustino, Daniel Ranard, Edward Farhi, Eugene Tang, Katherine Van Kirk, Madelyn Cain, Sam Gutmann, Swati Gupta","submitted_at":"2024-10-03T21:53:43Z","abstract_excerpt":"We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, following Wurtz et al. [Phys.Rev A 104:052419], we consider the standard QAOA with instance-independent \"tree\" parameters chosen in advance. These tree parameters are chosen to optimize the MaxCut expectation for large girth graphs. We provide extensive numerical evidence supporting the performance guarantee for tree parameters conjectured in [Phys.Rev A 103:042612] and see that the approximation ratios obtained with tree p"},"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":"2410.03015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-03T21:53:43Z","cross_cats_sorted":[],"title_canon_sha256":"e1eb28f5342ace8b82ea62153b45145614bd6e19e75a2828cbedd15ee92e71ca","abstract_canon_sha256":"117c7c8d1ccbbabdc53db650d3c073232934751ca0620d3d4b4892069d4eb4a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:43.137397Z","signature_b64":"mHJ6CVntxbOjrxTQrr3OfpV4f/B5CRtsXgVb9pFbUS07tHfsBf5oXyvOy+ERfIRS1OKMTnnZ4k/A+f0VLz8UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538b693dc7e6b9a18968a5c6c76b90376d31a09034a6fae6b979ad3bb4440073","last_reissued_at":"2026-07-05T09:15:43.136873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:43.136873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategies for running the QAOA at hundreds of qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Brandon Augustino, Daniel Ranard, Edward Farhi, Eugene Tang, Katherine Van Kirk, Madelyn Cain, Sam Gutmann, Swati Gupta","submitted_at":"2024-10-03T21:53:43Z","abstract_excerpt":"We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, following Wurtz et al. [Phys.Rev A 104:052419], we consider the standard QAOA with instance-independent \"tree\" parameters chosen in advance. These tree parameters are chosen to optimize the MaxCut expectation for large girth graphs. We provide extensive numerical evidence supporting the performance guarantee for tree parameters conjectured in [Phys.Rev A 103:042612] and see that the approximation ratios obtained with tree p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03015","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/2410.03015/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":"2410.03015","created_at":"2026-07-05T09:15:43.136941+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03015v1","created_at":"2026-07-05T09:15:43.136941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03015","created_at":"2026-07-05T09:15:43.136941+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOFWSPOH4242","created_at":"2026-07-05T09:15:43.136941+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOFWSPOH4242DCLI","created_at":"2026-07-05T09:15:43.136941+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOFWSPOH","created_at":"2026-07-05T09:15:43.136941+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"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":64,"is_internal_anchor":false},{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":131,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":131,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5","json":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5.json","graph_json":"https://pith.science/api/pith-number/KOFWSPOH4242DCLIUXDMO24QG5/graph.json","events_json":"https://pith.science/api/pith-number/KOFWSPOH4242DCLIUXDMO24QG5/events.json","paper":"https://pith.science/paper/KOFWSPOH"},"agent_actions":{"view_html":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5","download_json":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5.json","view_paper":"https://pith.science/paper/KOFWSPOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03015&json=true","fetch_graph":"https://pith.science/api/pith-number/KOFWSPOH4242DCLIUXDMO24QG5/graph.json","fetch_events":"https://pith.science/api/pith-number/KOFWSPOH4242DCLIUXDMO24QG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5/action/storage_attestation","attest_author":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5/action/author_attestation","sign_citation":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5/action/citation_signature","submit_replication":"https://pith.science/pith/KOFWSPOH4242DCLIUXDMO24QG5/action/replication_record"}},"created_at":"2026-07-05T09:15:43.136941+00:00","updated_at":"2026-07-05T09:15:43.136941+00:00"}