{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6TWNI5M7YQKWKK7FRD3WBGWGQF","short_pith_number":"pith:6TWNI5M7","schema_version":"1.0","canonical_sha256":"f4ecd4759fc415652be588f7609ac68145bc96675cf6758bf40ab54153931498","source":{"kind":"arxiv","id":"2308.02342","version":2},"attestation_state":"computed","paper":{"title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.ET"],"primary_cat":"quant-ph","authors_text":"Brian Neyenhuis, Chandler V. Horst, Changhao Li, Dan Gresh, Danylo Lykov, Dylan Herman, Jacob Johansen, Jeffrey Larson, Joan M. Dreiling, John P. Gaebler, Justin A. Gerber, Kevin Gilmore, Marco Pistoia, Matthew DeCross, Michael Mills, Mitchell Matheny, Nathan Hewitt, Niraj Kumar, Peter Siegfried, Pierre Minssen, Romina Yalovetzky, Ruslan Shaydulin, Shaohan Hu, Shouvanik Chakrabarti, Steven A. Moses, Tanner Mengle, Thomas M. Gatterman, Yue Sun, Yuri Alexeev","submitted_at":"2023-08-04T14:17:21Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the st"},"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":"2308.02342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-04T14:17:21Z","cross_cats_sorted":["cond-mat.stat-mech","cs.ET"],"title_canon_sha256":"4bf457d67b63e1fdaf611778852b3567b754b35b47fcbdf10d13af25a8cd03f6","abstract_canon_sha256":"75c96141a713ba1d06487cc2eaefe8d183029a49a757995d5a42b2e86003e057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:13.195043Z","signature_b64":"/1Qn62e221V3maaZ6SiwcrYYjP+CsY9MfSu1R9x2M7SA8YwIlDp3gBw5P9GZQ1ZoJSB952XTkZWjwrNf1Q+yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ecd4759fc415652be588f7609ac68145bc96675cf6758bf40ab54153931498","last_reissued_at":"2026-07-05T08:26:13.194549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:13.194549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.ET"],"primary_cat":"quant-ph","authors_text":"Brian Neyenhuis, Chandler V. Horst, Changhao Li, Dan Gresh, Danylo Lykov, Dylan Herman, Jacob Johansen, Jeffrey Larson, Joan M. Dreiling, John P. Gaebler, Justin A. Gerber, Kevin Gilmore, Marco Pistoia, Matthew DeCross, Michael Mills, Mitchell Matheny, Nathan Hewitt, Niraj Kumar, Peter Siegfried, Pierre Minssen, Romina Yalovetzky, Ruslan Shaydulin, Shaohan Hu, Shouvanik Chakrabarti, Steven A. Moses, Tanner Mengle, Thomas M. Gatterman, Yue Sun, Yuri Alexeev","submitted_at":"2023-08-04T14:17:21Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02342","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/2308.02342/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":"2308.02342","created_at":"2026-07-05T08:26:13.194609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.02342v2","created_at":"2026-07-05T08:26:13.194609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02342","created_at":"2026-07-05T08:26:13.194609+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TWNI5M7YQKW","created_at":"2026-07-05T08:26:13.194609+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TWNI5M7YQKWKK7F","created_at":"2026-07-05T08:26:13.194609+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TWNI5M7","created_at":"2026-07-05T08:26:13.194609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.01694","citing_title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":236,"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":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF","json":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF.json","graph_json":"https://pith.science/api/pith-number/6TWNI5M7YQKWKK7FRD3WBGWGQF/graph.json","events_json":"https://pith.science/api/pith-number/6TWNI5M7YQKWKK7FRD3WBGWGQF/events.json","paper":"https://pith.science/paper/6TWNI5M7"},"agent_actions":{"view_html":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF","download_json":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF.json","view_paper":"https://pith.science/paper/6TWNI5M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.02342&json=true","fetch_graph":"https://pith.science/api/pith-number/6TWNI5M7YQKWKK7FRD3WBGWGQF/graph.json","fetch_events":"https://pith.science/api/pith-number/6TWNI5M7YQKWKK7FRD3WBGWGQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF/action/storage_attestation","attest_author":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF/action/author_attestation","sign_citation":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF/action/citation_signature","submit_replication":"https://pith.science/pith/6TWNI5M7YQKWKK7FRD3WBGWGQF/action/replication_record"}},"created_at":"2026-07-05T08:26:13.194609+00:00","updated_at":"2026-07-05T08:26:13.194609+00:00"}