{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DIWQG3PFPIHFNED5HVIUVJSFJG","short_pith_number":"pith:DIWQG3PF","schema_version":"1.0","canonical_sha256":"1a2d036de57a0e56907d3d514aa64549ad8a805a399da1b51f8a3860761c45e9","source":{"kind":"arxiv","id":"2108.06049","version":3},"attestation_state":"computed","paper":{"title":"Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chi-Ning Chou, Jonathan Shi, Juspreet Singh Sandhu, Peter J. Love","submitted_at":"2021-08-13T03:55:22Z","abstract_excerpt":"We introduce a notion of \\emph{generic local algorithm} which strictly generalizes existing frameworks of local algorithms such as \\emph{factors of i.i.d.} by capturing local \\emph{quantum} algorithms such as the Quantum Approximate Optimization Algorithm (QAOA).\n  Motivated by a question of Farhi et al. [arXiv:1910.08187, 2019] we then show limitations of generic local algorithms including QAOA on random instances of constraint satisfaction problems (CSPs). Specifically, we show that any generic local algorithm whose assignment to a vertex depends only on a local neighborhood with $o(n)$ othe"},"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":"2108.06049","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-08-13T03:55:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"bf7431f6e3f70b058b57d2dd803688f7433b3bbf04883481c165bc9b45f45d1c","abstract_canon_sha256":"fcc3259f495e583dbaa4696e502e6f076b2c49081f76562f51652a09406f22d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:52.288407Z","signature_b64":"D2n6dveu48jbqrRFaYADzHk5bIxz1qoRjv2+rFPn6PoN3B40ClDWv+vuKJVZbbHPEj+tYmTQpeO9B3UlyCGGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a2d036de57a0e56907d3d514aa64549ad8a805a399da1b51f8a3860761c45e9","last_reissued_at":"2026-07-05T03:58:52.287889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:52.287889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chi-Ning Chou, Jonathan Shi, Juspreet Singh Sandhu, Peter J. Love","submitted_at":"2021-08-13T03:55:22Z","abstract_excerpt":"We introduce a notion of \\emph{generic local algorithm} which strictly generalizes existing frameworks of local algorithms such as \\emph{factors of i.i.d.} by capturing local \\emph{quantum} algorithms such as the Quantum Approximate Optimization Algorithm (QAOA).\n  Motivated by a question of Farhi et al. [arXiv:1910.08187, 2019] we then show limitations of generic local algorithms including QAOA on random instances of constraint satisfaction problems (CSPs). Specifically, we show that any generic local algorithm whose assignment to a vertex depends only on a local neighborhood with $o(n)$ othe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06049","kind":"arxiv","version":3},"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/2108.06049/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":"2108.06049","created_at":"2026-07-05T03:58:52.287956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06049v3","created_at":"2026-07-05T03:58:52.287956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06049","created_at":"2026-07-05T03:58:52.287956+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIWQG3PFPIHF","created_at":"2026-07-05T03:58:52.287956+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIWQG3PFPIHFNED5","created_at":"2026-07-05T03:58:52.287956+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIWQG3PF","created_at":"2026-07-05T03:58:52.287956+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.22372","citing_title":"Quantum-informed surrogate sampling for combinatorial optimization","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG","json":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG.json","graph_json":"https://pith.science/api/pith-number/DIWQG3PFPIHFNED5HVIUVJSFJG/graph.json","events_json":"https://pith.science/api/pith-number/DIWQG3PFPIHFNED5HVIUVJSFJG/events.json","paper":"https://pith.science/paper/DIWQG3PF"},"agent_actions":{"view_html":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG","download_json":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG.json","view_paper":"https://pith.science/paper/DIWQG3PF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06049&json=true","fetch_graph":"https://pith.science/api/pith-number/DIWQG3PFPIHFNED5HVIUVJSFJG/graph.json","fetch_events":"https://pith.science/api/pith-number/DIWQG3PFPIHFNED5HVIUVJSFJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG/action/storage_attestation","attest_author":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG/action/author_attestation","sign_citation":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG/action/citation_signature","submit_replication":"https://pith.science/pith/DIWQG3PFPIHFNED5HVIUVJSFJG/action/replication_record"}},"created_at":"2026-07-05T03:58:52.287956+00:00","updated_at":"2026-07-05T03:58:52.287956+00:00"}