{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKHTRJG7JI5L3SVRITVB377MNR","short_pith_number":"pith:VKHTRJG7","schema_version":"1.0","canonical_sha256":"aa8f38a4df4a3abdcab144ea1dffec6c448bfd4976dd1ec32faa391bbdfcc9c9","source":{"kind":"arxiv","id":"2605.22758","version":1},"attestation_state":"computed","paper":{"title":"A sharp interaction-degree threshold for simulating QAOA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Ralfs \\=Aboli\\c{n}\\v{s}","submitted_at":"2026-05-21T17:24:00Z","abstract_excerpt":"We identify a sharp interaction-degree threshold for the classical simulation of QAOA with $2$-local cost functions. At degree $3$, classical sampling from depth-$1$ QAOA with small multiplicative error would collapse the polynomial hierarchy to its third level. At degree $2$, exact classical sampling from depth-$p$ QAOA on $n$ qubits runs in time $n^{O(1)}$ whenever $p = O(\\log n)$. The hard degree-$3$ instances have trivially optimizable cost functions, so sampling hardness does not by itself imply a quantum optimization advantage."},"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":"2605.22758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-21T17:24:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2363850f7248626227560a6b11f6a4e9b607b40b966a53411a65352337b5d778","abstract_canon_sha256":"36cad0cf346a3a274531f7e34e901a7f85bab04311db4ae7c5e60ccea3e14f86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T02:04:53.604986Z","signature_b64":"bvpo/D8wZICFYUQIKWWs1KpXcIMcqXEC1VrE6goMCsT61zXTOtsWjzWWmUIC12Apo2YWOueqhbIlbDJCQO/RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa8f38a4df4a3abdcab144ea1dffec6c448bfd4976dd1ec32faa391bbdfcc9c9","last_reissued_at":"2026-05-22T02:04:53.604537Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T02:04:53.604537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp interaction-degree threshold for simulating QAOA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Ralfs \\=Aboli\\c{n}\\v{s}","submitted_at":"2026-05-21T17:24:00Z","abstract_excerpt":"We identify a sharp interaction-degree threshold for the classical simulation of QAOA with $2$-local cost functions. At degree $3$, classical sampling from depth-$1$ QAOA with small multiplicative error would collapse the polynomial hierarchy to its third level. At degree $2$, exact classical sampling from depth-$p$ QAOA on $n$ qubits runs in time $n^{O(1)}$ whenever $p = O(\\log n)$. The hard degree-$3$ instances have trivially optimizable cost functions, so sampling hardness does not by itself imply a quantum optimization advantage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22758","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/2605.22758/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":"2605.22758","created_at":"2026-05-22T02:04:53.604609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22758v1","created_at":"2026-05-22T02:04:53.604609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22758","created_at":"2026-05-22T02:04:53.604609+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKHTRJG7JI5L","created_at":"2026-05-22T02:04:53.604609+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKHTRJG7JI5L3SVR","created_at":"2026-05-22T02:04:53.604609+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKHTRJG7","created_at":"2026-05-22T02:04:53.604609+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/VKHTRJG7JI5L3SVRITVB377MNR","json":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR.json","graph_json":"https://pith.science/api/pith-number/VKHTRJG7JI5L3SVRITVB377MNR/graph.json","events_json":"https://pith.science/api/pith-number/VKHTRJG7JI5L3SVRITVB377MNR/events.json","paper":"https://pith.science/paper/VKHTRJG7"},"agent_actions":{"view_html":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR","download_json":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR.json","view_paper":"https://pith.science/paper/VKHTRJG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22758&json=true","fetch_graph":"https://pith.science/api/pith-number/VKHTRJG7JI5L3SVRITVB377MNR/graph.json","fetch_events":"https://pith.science/api/pith-number/VKHTRJG7JI5L3SVRITVB377MNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR/action/storage_attestation","attest_author":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR/action/author_attestation","sign_citation":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR/action/citation_signature","submit_replication":"https://pith.science/pith/VKHTRJG7JI5L3SVRITVB377MNR/action/replication_record"}},"created_at":"2026-05-22T02:04:53.604609+00:00","updated_at":"2026-05-22T02:04:53.604609+00:00"}