{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:656RMC3OM3C3O5RV2BLGAITMLJ","short_pith_number":"pith:656RMC3O","schema_version":"1.0","canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","source":{"kind":"arxiv","id":"1811.08419","version":1},"attestation_state":"computed","paper":{"title":"Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gavin E. Crooks","submitted_at":"2018-11-20T18:51:07Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implem"},"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":"1811.08419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-20T18:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"1db49e3f04b61f4bbcdb2f148e505b7666ca896c9c015f4cadcdaee6d79aa49b","abstract_canon_sha256":"47132dabfa234b741acbb258ab3070a3433d42e835ccf12d21291b23139bac55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:14.135061Z","signature_b64":"QdfBYyhuwl38eNxSbB3hxNCKT1xszcKsy3gS77fMqP39k2nViRB8jIT73Isu20ohokLENBvMDU0awVG3P/1tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77d160b6e66c5b77635d05660226c5a730ef8b2382b3dcdaf2442b86332422d","last_reissued_at":"2026-05-18T00:00:14.134654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:14.134654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gavin E. Crooks","submitted_at":"2018-11-20T18:51:07Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently know about the capabilities of QAOA, or of the difficulty of the requisite parameters optimization. Here, we study the performance of QAOA on the MaxCut combinatorial optimization problem, optimizing the quantum circuits on a classical computer using automatic differentiation and stochastic gradient descent, using QuantumFlow, a quantum circuit simulator implem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08419","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1811.08419","created_at":"2026-05-18T00:00:14.134722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08419v1","created_at":"2026-05-18T00:00:14.134722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08419","created_at":"2026-05-18T00:00:14.134722+00:00"},{"alias_kind":"pith_short_12","alias_value":"656RMC3OM3C3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"656RMC3OM3C3O5RV","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"656RMC3O","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2605.23377","citing_title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09631","citing_title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02569","citing_title":"RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2505.18396","citing_title":"The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2507.07742","citing_title":"Gate Freezing Method for Gradient-Free Variational Quantum Algorithms in Circuit Optimization","ref_index":15,"is_internal_anchor":true},{"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":245,"is_internal_anchor":true},{"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":81,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02569","citing_title":"RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25760","citing_title":"Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02635","citing_title":"Quantum Hypergraph Partitioning","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12465","citing_title":"Demonstrating Record Fidelity for the Quantum Fourier Transform","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06106","citing_title":"Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly","ref_index":7,"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":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ","json":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ.json","graph_json":"https://pith.science/api/pith-number/656RMC3OM3C3O5RV2BLGAITMLJ/graph.json","events_json":"https://pith.science/api/pith-number/656RMC3OM3C3O5RV2BLGAITMLJ/events.json","paper":"https://pith.science/paper/656RMC3O"},"agent_actions":{"view_html":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ","download_json":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ.json","view_paper":"https://pith.science/paper/656RMC3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08419&json=true","fetch_graph":"https://pith.science/api/pith-number/656RMC3OM3C3O5RV2BLGAITMLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/656RMC3OM3C3O5RV2BLGAITMLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/action/storage_attestation","attest_author":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/action/author_attestation","sign_citation":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/action/citation_signature","submit_replication":"https://pith.science/pith/656RMC3OM3C3O5RV2BLGAITMLJ/action/replication_record"}},"created_at":"2026-05-18T00:00:14.134722+00:00","updated_at":"2026-05-18T00:00:14.134722+00:00"}