{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OXO7VZANBCQHDGLN7VXV555Z2M","short_pith_number":"pith:OXO7VZAN","schema_version":"1.0","canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","source":{"kind":"arxiv","id":"2107.00677","version":2},"attestation_state":"computed","paper":{"title":"The fixed angle conjecture for QAOA on regular MaxCut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danylo Lykov, Jonathan Wurtz","submitted_at":"2021-07-01T18:02:36Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for $p>2$. A recent work \\cite{Wurtz_guarantee} computing MaxCut performance guarantees for 3-regular graphs conjectures that any $d$-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for $p<12$. We compute and provide these angles via numerical optimization a"},"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":"2107.00677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-01T18:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"6b02daef33d5e37457acf5b956e4826998872e8a10da77a10b39b6f563cb928d","abstract_canon_sha256":"16557cbca0d2a360e33e23b16d235523da65b44860a81e1ed9a02cfe5bf7564f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:43.466542Z","signature_b64":"SEiyh9Ww3EgwmeftgSsPuqjPMJUgQ2W1AJCmkkV5mrO9Ex9SMiRNPH4cpHtTJFmUk4RiQNfK0WIPt7xWhrAqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75ddfae40d08a071996dfd6f5ef7b9d302524c36ca15d88f1cf375ec5eb2ba5a","last_reissued_at":"2026-07-05T02:58:43.466054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:43.466054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The fixed angle conjecture for QAOA on regular MaxCut graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danylo Lykov, Jonathan Wurtz","submitted_at":"2021-07-01T18:02:36Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for $p>2$. A recent work \\cite{Wurtz_guarantee} computing MaxCut performance guarantees for 3-regular graphs conjectures that any $d$-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for $p<12$. We compute and provide these angles via numerical optimization a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00677","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/2107.00677/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":"2107.00677","created_at":"2026-07-05T02:58:43.466112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.00677v2","created_at":"2026-07-05T02:58:43.466112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00677","created_at":"2026-07-05T02:58:43.466112+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXO7VZANBCQH","created_at":"2026-07-05T02:58:43.466112+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXO7VZANBCQHDGLN","created_at":"2026-07-05T02:58:43.466112+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXO7VZAN","created_at":"2026-07-05T02:58:43.466112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.10908","citing_title":"Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem","ref_index":31,"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":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07611","citing_title":"Compositional Quantum Heuristics for Max-Clique Detection","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M","json":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M.json","graph_json":"https://pith.science/api/pith-number/OXO7VZANBCQHDGLN7VXV555Z2M/graph.json","events_json":"https://pith.science/api/pith-number/OXO7VZANBCQHDGLN7VXV555Z2M/events.json","paper":"https://pith.science/paper/OXO7VZAN"},"agent_actions":{"view_html":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M","download_json":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M.json","view_paper":"https://pith.science/paper/OXO7VZAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.00677&json=true","fetch_graph":"https://pith.science/api/pith-number/OXO7VZANBCQHDGLN7VXV555Z2M/graph.json","fetch_events":"https://pith.science/api/pith-number/OXO7VZANBCQHDGLN7VXV555Z2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/action/storage_attestation","attest_author":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/action/author_attestation","sign_citation":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/action/citation_signature","submit_replication":"https://pith.science/pith/OXO7VZANBCQHDGLN7VXV555Z2M/action/replication_record"}},"created_at":"2026-07-05T02:58:43.466112+00:00","updated_at":"2026-07-05T02:58:43.466112+00:00"}