{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AG2QKDOOK2LCVSGKEB35PLQDL4","short_pith_number":"pith:AG2QKDOO","schema_version":"1.0","canonical_sha256":"01b5050dce56962ac8ca2077d7ae035f28cf1319d5a65f37c937108426ad2fdd","source":{"kind":"arxiv","id":"2408.09538","version":1},"attestation_state":"computed","paper":{"title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Changhao Li, Dylan Herman, Marco Pistoia, Rudy Raymond, Ruslan Shaydulin, Shree Hari Sureshbabu, Zichang He","submitted_at":"2024-08-18T16:48:14Z","abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum heuristics for combinatorial optimization. While QAOA has been shown to perform well on small-scale instances and to provide an asymptotic speedup over state-of-the-art classical algorithms for some problems, fault-tolerance is understood to be required to realize this speedup in practice. The low resource requirements of QAOA make it particularly suitable to benchmark on early fault-tolerant quantum computing (EFTQC) hardware. However, the performance of QAOA depends crucially on the choice of the free para"},"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":"2408.09538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-18T16:48:14Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"4bedf806907c9ccb1fec68987069abc2f09bf867062f9f9bf01d63ab4d9bc870","abstract_canon_sha256":"a20597966c3bd077e42618bbedb2002f5d2afb5dff843d641bf882c8a08c5614"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:24.379630Z","signature_b64":"HE6xB4kbz+g9bUTJjriCQ/An13rK+4UgJ+29Kq+Ne6k7SsbpnWBHywi3tcQ+PyuQhGNTP/IR6y7jM0z/gpeiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b5050dce56962ac8ca2077d7ae035f28cf1319d5a65f37c937108426ad2fdd","last_reissued_at":"2026-07-05T11:14:24.379157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:24.379157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Changhao Li, Dylan Herman, Marco Pistoia, Rudy Raymond, Ruslan Shaydulin, Shree Hari Sureshbabu, Zichang He","submitted_at":"2024-08-18T16:48:14Z","abstract_excerpt":"Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum heuristics for combinatorial optimization. While QAOA has been shown to perform well on small-scale instances and to provide an asymptotic speedup over state-of-the-art classical algorithms for some problems, fault-tolerance is understood to be required to realize this speedup in practice. The low resource requirements of QAOA make it particularly suitable to benchmark on early fault-tolerant quantum computing (EFTQC) hardware. However, the performance of QAOA depends crucially on the choice of the free para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09538","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/2408.09538/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":"2408.09538","created_at":"2026-07-05T11:14:24.379212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.09538v1","created_at":"2026-07-05T11:14:24.379212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09538","created_at":"2026-07-05T11:14:24.379212+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG2QKDOOK2LC","created_at":"2026-07-05T11:14:24.379212+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG2QKDOOK2LCVSGK","created_at":"2026-07-05T11:14:24.379212+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG2QKDOO","created_at":"2026-07-05T11:14:24.379212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19502","citing_title":"Entanglement Scaling and Problem Structure in Quantum Approximate and Adiabatic Optimization Algorithms","ref_index":76,"is_internal_anchor":false},{"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":61,"is_internal_anchor":false},{"citing_arxiv_id":"2504.01694","citing_title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":249,"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":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4","json":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4.json","graph_json":"https://pith.science/api/pith-number/AG2QKDOOK2LCVSGKEB35PLQDL4/graph.json","events_json":"https://pith.science/api/pith-number/AG2QKDOOK2LCVSGKEB35PLQDL4/events.json","paper":"https://pith.science/paper/AG2QKDOO"},"agent_actions":{"view_html":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4","download_json":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4.json","view_paper":"https://pith.science/paper/AG2QKDOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.09538&json=true","fetch_graph":"https://pith.science/api/pith-number/AG2QKDOOK2LCVSGKEB35PLQDL4/graph.json","fetch_events":"https://pith.science/api/pith-number/AG2QKDOOK2LCVSGKEB35PLQDL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4/action/storage_attestation","attest_author":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4/action/author_attestation","sign_citation":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4/action/citation_signature","submit_replication":"https://pith.science/pith/AG2QKDOOK2LCVSGKEB35PLQDL4/action/replication_record"}},"created_at":"2026-07-05T11:14:24.379212+00:00","updated_at":"2026-07-05T11:14:24.379212+00:00"}