{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EK7OYOYWV5MBPMWFCNU5P5KVOP","short_pith_number":"pith:EK7OYOYW","schema_version":"1.0","canonical_sha256":"22beec3b16af5817b2c51369d7f55573ece1449751abd961992c8cc0cb820a96","source":{"kind":"arxiv","id":"2608.11385","version":1},"attestation_state":"computed","paper":{"title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Stuart Hadfield","submitted_at":"2026-08-11T19:47:04Z","abstract_excerpt":"Evaluating expectation values is a critical task for variational quantum eigensolvers, and for parameterized quantum circuits and other quantum algorithms more generally. We consider the well-studied case of the Quantum Approximate Optimization Algorithm (QAOA) for the MaxCut problem. Recent work of Wang et al. [arXiv:2511.20212] showed this task to be NP-hard in general for any QAOA depth $p\\geq 2$, complementing past results showing efficiently computable formulas for $p=1$ with arbitrary problem graphs. We sharpen this dichotomy showing that for $p\\geq 2$ exact or exponentially precise cost"},"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":"2608.11385","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-11T19:47:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"29bcf26cd9b45b58ee0bf447f38b2101d428a5ab2f97733a754fa21f69c63a6c","abstract_canon_sha256":"e13a08dd71a9c38b3ef1ffa9b59b6c7be31dbb829c6d5bbb2cddd9b9632de1d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T00:21:43.997176Z","signature_b64":"Cv1ICz7bad47nezhFQwyQSpbJIIPYdPe67GacI71XbUbB9ykDACDnHImimUWbspJE11VohScsAENmiV7zI3pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22beec3b16af5817b2c51369d7f55573ece1449751abd961992c8cc0cb820a96","last_reissued_at":"2026-08-13T00:21:43.995631Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T00:21:43.995631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Stuart Hadfield","submitted_at":"2026-08-11T19:47:04Z","abstract_excerpt":"Evaluating expectation values is a critical task for variational quantum eigensolvers, and for parameterized quantum circuits and other quantum algorithms more generally. We consider the well-studied case of the Quantum Approximate Optimization Algorithm (QAOA) for the MaxCut problem. Recent work of Wang et al. [arXiv:2511.20212] showed this task to be NP-hard in general for any QAOA depth $p\\geq 2$, complementing past results showing efficiently computable formulas for $p=1$ with arbitrary problem graphs. We sharpen this dichotomy showing that for $p\\geq 2$ exact or exponentially precise cost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11385","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/2608.11385/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":"2608.11385","created_at":"2026-08-13T00:21:43.995957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11385v1","created_at":"2026-08-13T00:21:43.995957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11385","created_at":"2026-08-13T00:21:43.995957+00:00"},{"alias_kind":"pith_short_12","alias_value":"EK7OYOYWV5MB","created_at":"2026-08-13T00:21:43.995957+00:00"},{"alias_kind":"pith_short_16","alias_value":"EK7OYOYWV5MBPMWF","created_at":"2026-08-13T00:21:43.995957+00:00"},{"alias_kind":"pith_short_8","alias_value":"EK7OYOYW","created_at":"2026-08-13T00:21:43.995957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP","json":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP.json","graph_json":"https://pith.science/api/pith-number/EK7OYOYWV5MBPMWFCNU5P5KVOP/graph.json","events_json":"https://pith.science/api/pith-number/EK7OYOYWV5MBPMWFCNU5P5KVOP/events.json","paper":"https://pith.science/paper/EK7OYOYW"},"agent_actions":{"view_html":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP","download_json":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP.json","view_paper":"https://pith.science/paper/EK7OYOYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11385&json=true","fetch_graph":"https://pith.science/api/pith-number/EK7OYOYWV5MBPMWFCNU5P5KVOP/graph.json","fetch_events":"https://pith.science/api/pith-number/EK7OYOYWV5MBPMWFCNU5P5KVOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP/action/storage_attestation","attest_author":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP/action/author_attestation","sign_citation":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP/action/citation_signature","submit_replication":"https://pith.science/pith/EK7OYOYWV5MBPMWFCNU5P5KVOP/action/replication_record"}},"created_at":"2026-08-13T00:21:43.995957+00:00","updated_at":"2026-08-13T00:21:43.995957+00:00"}