{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:V6OYBZLTBMJFSOLNBXBTLBLL2Y","short_pith_number":"pith:V6OYBZLT","schema_version":"1.0","canonical_sha256":"af9d80e5730b1259396d0dc335856bd60910672ba1883705a9b5952a3f6b9845","source":{"kind":"arxiv","id":"1910.08187","version":4},"attestation_state":"computed","paper":{"title":"The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Jeffrey Goldstone, Leo Zhou, Sam Gutmann","submitted_at":"2019-10-17T22:24:55Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$. While QAOA holds promise as an algorithm that can be run on near-term quantum computers, its computational power has not been fully explored. In this work, we study the QAOA applied to the Sherrington-Kirkpatrick (SK) model, which can be understood as energy minimization of $n$ spins with all-to-all random signed couplings. There is a recent classical algorithm by Montanari that, assuming a widely believed"},"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":"1910.08187","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2019-10-17T22:24:55Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"ba7da6f3d2704759e0ec5818045c8c1f82ba4647c68960a5e1effc6ce286e27e","abstract_canon_sha256":"8d14eb3558a2dacae135d371f7bc2ec010a2ba51262f83618776ff7aadd1d96e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:09.159044Z","signature_b64":"LhMPK8WmhsgS8vFDQdngcw9gFnOlTK0ixyXV8Y7lLK6xRl0E3i6lnMms8J2HtVjpfMa3gxpk1g/xQHC1+VFeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af9d80e5730b1259396d0dc335856bd60910672ba1883705a9b5952a3f6b9845","last_reissued_at":"2026-07-05T04:38:09.158596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:09.158596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Jeffrey Goldstone, Leo Zhou, Sam Gutmann","submitted_at":"2019-10-17T22:24:55Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$. While QAOA holds promise as an algorithm that can be run on near-term quantum computers, its computational power has not been fully explored. In this work, we study the QAOA applied to the Sherrington-Kirkpatrick (SK) model, which can be understood as energy minimization of $n$ spins with all-to-all random signed couplings. There is a recent classical algorithm by Montanari that, assuming a widely believed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08187","kind":"arxiv","version":4},"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/1910.08187/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":"1910.08187","created_at":"2026-07-05T04:38:09.158662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08187v4","created_at":"2026-07-05T04:38:09.158662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08187","created_at":"2026-07-05T04:38:09.158662+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6OYBZLTBMJF","created_at":"2026-07-05T04:38:09.158662+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6OYBZLTBMJFSOLN","created_at":"2026-07-05T04:38:09.158662+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6OYBZLT","created_at":"2026-07-05T04:38:09.158662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08160","citing_title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18339","citing_title":"Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23138","citing_title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23377","citing_title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","ref_index":59,"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":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08251","citing_title":"The finite-shot help-harm boundary of zero-noise extrapolation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26040","citing_title":"QAOA Parameter Transfer for Hypergraphs","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03854","citing_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06656","citing_title":"Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML","ref_index":95,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y","json":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y.json","graph_json":"https://pith.science/api/pith-number/V6OYBZLTBMJFSOLNBXBTLBLL2Y/graph.json","events_json":"https://pith.science/api/pith-number/V6OYBZLTBMJFSOLNBXBTLBLL2Y/events.json","paper":"https://pith.science/paper/V6OYBZLT"},"agent_actions":{"view_html":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y","download_json":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y.json","view_paper":"https://pith.science/paper/V6OYBZLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08187&json=true","fetch_graph":"https://pith.science/api/pith-number/V6OYBZLTBMJFSOLNBXBTLBLL2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/V6OYBZLTBMJFSOLNBXBTLBLL2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y/action/storage_attestation","attest_author":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y/action/author_attestation","sign_citation":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y/action/citation_signature","submit_replication":"https://pith.science/pith/V6OYBZLTBMJFSOLNBXBTLBLL2Y/action/replication_record"}},"created_at":"2026-07-05T04:38:09.158662+00:00","updated_at":"2026-07-05T04:38:09.158662+00:00"}