{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UQFLQ3LXYYLQIVKZKLBRZYGAGF","short_pith_number":"pith:UQFLQ3LX","schema_version":"1.0","canonical_sha256":"a40ab86d77c61704555952c31ce0c0317b3664fae2dcae86340b6b91a80b473a","source":{"kind":"arxiv","id":"2305.04455","version":2},"attestation_state":"computed","paper":{"title":"Quantum Alternating Operator Ansatz (QAOA) beyond low depth with gradually changing unitaries","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Norm M. Tubman, Stuart Hadfield, Tad Hogg, Vladimir Kremenetski","submitted_at":"2023-05-08T04:21:42Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm and its generalization to Quantum Alternating Operator Ansatz (QAOA) is a promising approach for applying quantum computers to challenging problems such as combinatorial optimization and computational chemistry. In this paper, we study the underlying mechanisms governing the behavior of QAOA circuits beyond shallow depth in the practically relevant setting of gradually varying unitaries. We use the discrete adiabatic theorem, which complements and generalizes the insights obtained from the continuous-time adiabatic theorem primarily considered in "},"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":"2305.04455","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-08T04:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"5b5efe4907ed5ecca6f45bca72dd6a0f903a5827972d366c6487fba602f18dde","abstract_canon_sha256":"7bfe8e2f3383aa5179af10ef9da9045a708fed40174f00e5d94c67a96db3a364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:33.295235Z","signature_b64":"GbmUHSp1ugg13Y/PyhbNuKQ7JmprE9uksShkwRNgNE+lwGB5olqJB8ZheqYd6tB/mYfsiLj+SlrNfjkigfz5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40ab86d77c61704555952c31ce0c0317b3664fae2dcae86340b6b91a80b473a","last_reissued_at":"2026-07-05T06:33:33.294825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:33.294825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Alternating Operator Ansatz (QAOA) beyond low depth with gradually changing unitaries","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anuj Apte, Norm M. Tubman, Stuart Hadfield, Tad Hogg, Vladimir Kremenetski","submitted_at":"2023-05-08T04:21:42Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm and its generalization to Quantum Alternating Operator Ansatz (QAOA) is a promising approach for applying quantum computers to challenging problems such as combinatorial optimization and computational chemistry. In this paper, we study the underlying mechanisms governing the behavior of QAOA circuits beyond shallow depth in the practically relevant setting of gradually varying unitaries. We use the discrete adiabatic theorem, which complements and generalizes the insights obtained from the continuous-time adiabatic theorem primarily considered in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04455","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/2305.04455/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":"2305.04455","created_at":"2026-07-05T06:33:33.294881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04455v2","created_at":"2026-07-05T06:33:33.294881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04455","created_at":"2026-07-05T06:33:33.294881+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQFLQ3LXYYLQ","created_at":"2026-07-05T06:33:33.294881+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQFLQ3LXYYLQIVKZ","created_at":"2026-07-05T06:33:33.294881+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQFLQ3LX","created_at":"2026-07-05T06:33:33.294881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25117","citing_title":"Feasibility-driven QAOA with penalty scheduling","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2504.01694","citing_title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2603.15515","citing_title":"End-to-end performance of quantum-accelerated large-scale linear algebra workflows","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11758","citing_title":"Hybrid Quantum-Classical Optimization Workflows for the Shipment Selection Problem","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06106","citing_title":"Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF","json":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF.json","graph_json":"https://pith.science/api/pith-number/UQFLQ3LXYYLQIVKZKLBRZYGAGF/graph.json","events_json":"https://pith.science/api/pith-number/UQFLQ3LXYYLQIVKZKLBRZYGAGF/events.json","paper":"https://pith.science/paper/UQFLQ3LX"},"agent_actions":{"view_html":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF","download_json":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF.json","view_paper":"https://pith.science/paper/UQFLQ3LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04455&json=true","fetch_graph":"https://pith.science/api/pith-number/UQFLQ3LXYYLQIVKZKLBRZYGAGF/graph.json","fetch_events":"https://pith.science/api/pith-number/UQFLQ3LXYYLQIVKZKLBRZYGAGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF/action/storage_attestation","attest_author":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF/action/author_attestation","sign_citation":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF/action/citation_signature","submit_replication":"https://pith.science/pith/UQFLQ3LXYYLQIVKZKLBRZYGAGF/action/replication_record"}},"created_at":"2026-07-05T06:33:33.294881+00:00","updated_at":"2026-07-05T06:33:33.294881+00:00"}