{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N4Q2Z4BEJ2UPLFUB3NRZTATDOS","short_pith_number":"pith:N4Q2Z4BE","schema_version":"1.0","canonical_sha256":"6f21acf0244ea8f59681db63998263748e9c527d2322aaf3aab2485d656b6214","source":{"kind":"arxiv","id":"2106.13814","version":1},"attestation_state":"computed","paper":{"title":"Training Saturation in Layerwise Quantum Approximate Optimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG"],"primary_cat":"quant-ph","authors_text":"D. Rabinovich, E. Campos, J. Biamonte, V. Akshay","submitted_at":"2021-06-25T18:00:02Z","abstract_excerpt":"Quantum Approximate Optimisation (QAOA) is the most studied gate based variational quantum algorithm today. We train QAOA one layer at a time to maximize overlap with an $n$ qubit target state. Doing so we discovered that such training always saturates -- called \\textit{training saturation} -- at some depth $p^*$, meaning that past a certain depth, overlap can not be improved by adding subsequent layers. We formulate necessary conditions for saturation. Numerically, we find layerwise QAOA reaches its maximum overlap at depth $p^*=n$. The addition of coherent dephasing errors to training remove"},"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":"2106.13814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-25T18:00:02Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG"],"title_canon_sha256":"30515c602878cf010f955afa0b554b8eba9c5c5c53598cedcfe9d9463af133f6","abstract_canon_sha256":"a7ed71965c76e1522a64ca09a03643a745eb5660f2bfc8c430622d631cca2c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:16:19.623698Z","signature_b64":"w/EWo96tfdWBidH/N2Y3OykW6lwXsIafV/YeH9boB+JFr2FKnh2nA29S7c231oT5qoOpB9G4YoitUQIoFCdfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f21acf0244ea8f59681db63998263748e9c527d2322aaf3aab2485d656b6214","last_reissued_at":"2026-07-05T03:16:19.623190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:16:19.623190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training Saturation in Layerwise Quantum Approximate Optimisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG"],"primary_cat":"quant-ph","authors_text":"D. Rabinovich, E. Campos, J. Biamonte, V. Akshay","submitted_at":"2021-06-25T18:00:02Z","abstract_excerpt":"Quantum Approximate Optimisation (QAOA) is the most studied gate based variational quantum algorithm today. We train QAOA one layer at a time to maximize overlap with an $n$ qubit target state. Doing so we discovered that such training always saturates -- called \\textit{training saturation} -- at some depth $p^*$, meaning that past a certain depth, overlap can not be improved by adding subsequent layers. We formulate necessary conditions for saturation. Numerically, we find layerwise QAOA reaches its maximum overlap at depth $p^*=n$. The addition of coherent dephasing errors to training remove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13814","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.13814/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":"2106.13814","created_at":"2026-07-05T03:16:19.623247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13814v1","created_at":"2026-07-05T03:16:19.623247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13814","created_at":"2026-07-05T03:16:19.623247+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4Q2Z4BEJ2UP","created_at":"2026-07-05T03:16:19.623247+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4Q2Z4BEJ2UPLFUB","created_at":"2026-07-05T03:16:19.623247+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4Q2Z4BE","created_at":"2026-07-05T03:16:19.623247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS","json":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS.json","graph_json":"https://pith.science/api/pith-number/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/graph.json","events_json":"https://pith.science/api/pith-number/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/events.json","paper":"https://pith.science/paper/N4Q2Z4BE"},"agent_actions":{"view_html":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS","download_json":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS.json","view_paper":"https://pith.science/paper/N4Q2Z4BE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13814&json=true","fetch_graph":"https://pith.science/api/pith-number/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/graph.json","fetch_events":"https://pith.science/api/pith-number/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/action/storage_attestation","attest_author":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/action/author_attestation","sign_citation":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/action/citation_signature","submit_replication":"https://pith.science/pith/N4Q2Z4BEJ2UPLFUB3NRZTATDOS/action/replication_record"}},"created_at":"2026-07-05T03:16:19.623247+00:00","updated_at":"2026-07-05T03:16:19.623247+00:00"}