{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KNGXKMQLHTODNCGQG3Y5HN6AOU","short_pith_number":"pith:KNGXKMQL","schema_version":"1.0","canonical_sha256":"534d75320b3cdc3688d036f1d3b7c07523c00428b98f7cd4246febe34a998396","source":{"kind":"arxiv","id":"1906.11259","version":2},"attestation_state":"computed","paper":{"title":"Reachability Deficits in Quantum Approximate Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"H. Philathong, J. Biamonte, M.E.S. Morales, V. Akshay","submitted_at":"2019-06-26T18:00:03Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only a few results have been developed towards understanding the algorithms ultimate limitations. Here we report that QAOA exhibits a strong dependence on a problem instances constraint to variable ratio$-$this problem density places a limiting restriction on the algorithms capacity to minimize a corresponding objective function (and hence solve optimization problem instances). Such $reachability~deficits$ persist even in"},"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":"1906.11259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-26T18:00:03Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.AI","cs.LG"],"title_canon_sha256":"8547355baf29bdec8ad2f58c376d683f17e5e2819ba4451213908d4b1a01dc12","abstract_canon_sha256":"635428948149bd260e9be28472b64ada48db4d427978fc8f0b078e977df3c713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:46.600192Z","signature_b64":"tNhjwoqfXf5BYsG5zF7TRF25WE+UpfxApiY9ef4/20Tnos4VAPwXvhR+d64F3aR4HUlYXSDOuK2co3lRDkRFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534d75320b3cdc3688d036f1d3b7c07523c00428b98f7cd4246febe34a998396","last_reissued_at":"2026-07-05T00:46:46.599722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:46.599722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability Deficits in Quantum Approximate Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"H. Philathong, J. Biamonte, M.E.S. Morales, V. Akshay","submitted_at":"2019-06-26T18:00:03Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only a few results have been developed towards understanding the algorithms ultimate limitations. Here we report that QAOA exhibits a strong dependence on a problem instances constraint to variable ratio$-$this problem density places a limiting restriction on the algorithms capacity to minimize a corresponding objective function (and hence solve optimization problem instances). Such $reachability~deficits$ persist even in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11259","kind":"arxiv","version":2},"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/1906.11259/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":"1906.11259","created_at":"2026-07-05T00:46:46.599782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11259v2","created_at":"2026-07-05T00:46:46.599782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11259","created_at":"2026-07-05T00:46:46.599782+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNGXKMQLHTOD","created_at":"2026-07-05T00:46:46.599782+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNGXKMQLHTODNCGQ","created_at":"2026-07-05T00:46:46.599782+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNGXKMQL","created_at":"2026-07-05T00:46:46.599782+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01745","citing_title":"A quantum algorithm to count weighted ground states of classical spin Hamiltonians","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU","json":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU.json","graph_json":"https://pith.science/api/pith-number/KNGXKMQLHTODNCGQG3Y5HN6AOU/graph.json","events_json":"https://pith.science/api/pith-number/KNGXKMQLHTODNCGQG3Y5HN6AOU/events.json","paper":"https://pith.science/paper/KNGXKMQL"},"agent_actions":{"view_html":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU","download_json":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU.json","view_paper":"https://pith.science/paper/KNGXKMQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11259&json=true","fetch_graph":"https://pith.science/api/pith-number/KNGXKMQLHTODNCGQG3Y5HN6AOU/graph.json","fetch_events":"https://pith.science/api/pith-number/KNGXKMQLHTODNCGQG3Y5HN6AOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU/action/storage_attestation","attest_author":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU/action/author_attestation","sign_citation":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU/action/citation_signature","submit_replication":"https://pith.science/pith/KNGXKMQLHTODNCGQG3Y5HN6AOU/action/replication_record"}},"created_at":"2026-07-05T00:46:46.599782+00:00","updated_at":"2026-07-05T00:46:46.599782+00:00"}