{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WUQWEEWSUJFPWMIRMOJ6MZXF7S","short_pith_number":"pith:WUQWEEWS","schema_version":"1.0","canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","source":{"kind":"arxiv","id":"1602.07674","version":2},"attestation_state":"computed","paper":{"title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W Harrow, Edward Farhi","submitted_at":"2016-02-24T20:57:50Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of the maximum number of clauses that can be satisfied. For certain problems the lowest depth version of the QAOA has provable performance guarantees although there exist classical algorithms that have better guarantees. Here we argue that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable comple"},"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":"1602.07674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-24T20:57:50Z","cross_cats_sorted":[],"title_canon_sha256":"d66faaa66781d6ef7a574dba984321fbcd8d4abd963f5450871a96139bebe8fe","abstract_canon_sha256":"c1a3c2d97a488c39be74fc1324cb9f0542385d6b00e731fd37beaf15da1867a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:11.368290Z","signature_b64":"4zjTmUdWPEZ+RmSDU8Ge8gvQqEogDf3iAvvgkmZig8cSRlrPJZMOQ/XUJsx4+1yGGB25x8XrR/qoFRa5mv8RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5216212d2a24afb31116393e666e5fca86107d7bd6ebf12bd4f4edd17564fab","last_reissued_at":"2026-07-05T00:13:11.367818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:11.367818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W Harrow, Edward Farhi","submitted_at":"2016-02-24T20:57:50Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of the maximum number of clauses that can be satisfied. For certain problems the lowest depth version of the QAOA has provable performance guarantees although there exist classical algorithms that have better guarantees. Here we argue that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07674","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/1602.07674/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":"1602.07674","created_at":"2026-07-05T00:13:11.367871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07674v2","created_at":"2026-07-05T00:13:11.367871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07674","created_at":"2026-07-05T00:13:11.367871+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUQWEEWSUJFP","created_at":"2026-07-05T00:13:11.367871+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUQWEEWSUJFPWMIR","created_at":"2026-07-05T00:13:11.367871+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUQWEEWS","created_at":"2026-07-05T00:13:11.367871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":18,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13481","citing_title":"Towards a Control interpretation of Quantum Advantage","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.13481","citing_title":"Towards a Control interpretation of Quantum Advantage","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08707","citing_title":"Simulating quantum circuits with a neural statebank","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07084","citing_title":"Projector Quantum Variational Ansatz","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02721","citing_title":"Simulating Condensed Matter Physics on Quantum Hardware","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":141,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22758","citing_title":"A sharp interaction-degree threshold for simulating QAOA","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2508.21122","citing_title":"Quantum algorithms for equational reasoning","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":7,"is_internal_anchor":false},{"citing_arxiv_id":"2510.02141","citing_title":"Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08153","citing_title":"Going off Pattern? QAOA Parameter Heuristics and Potentials of Parsimony","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":141,"is_internal_anchor":false},{"citing_arxiv_id":"2601.01516","citing_title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11375","citing_title":"TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20088","citing_title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08367","citing_title":"Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16718","citing_title":"Potential Energy Savings from Quantum Computing-Based Route Optimization","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S","json":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S.json","graph_json":"https://pith.science/api/pith-number/WUQWEEWSUJFPWMIRMOJ6MZXF7S/graph.json","events_json":"https://pith.science/api/pith-number/WUQWEEWSUJFPWMIRMOJ6MZXF7S/events.json","paper":"https://pith.science/paper/WUQWEEWS"},"agent_actions":{"view_html":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S","download_json":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S.json","view_paper":"https://pith.science/paper/WUQWEEWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07674&json=true","fetch_graph":"https://pith.science/api/pith-number/WUQWEEWSUJFPWMIRMOJ6MZXF7S/graph.json","fetch_events":"https://pith.science/api/pith-number/WUQWEEWSUJFPWMIRMOJ6MZXF7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/action/storage_attestation","attest_author":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/action/author_attestation","sign_citation":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/action/citation_signature","submit_replication":"https://pith.science/pith/WUQWEEWSUJFPWMIRMOJ6MZXF7S/action/replication_record"}},"created_at":"2026-07-05T00:13:11.367871+00:00","updated_at":"2026-07-05T00:13:11.367871+00:00"}