{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VBIDXRDB6NTESNRRQXLMLMAZ2V","short_pith_number":"pith:VBIDXRDB","schema_version":"1.0","canonical_sha256":"a8503bc461f36649363185d6c5b019d567911e33e8373b59c6e841a6e91f1567","source":{"kind":"arxiv","id":"2301.09535","version":1},"attestation_state":"computed","paper":{"title":"Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Sturm","submitted_at":"2023-01-23T16:38:06Z","abstract_excerpt":"The present tutorial aims to provide a comprehensible and easily accessible introduction into the theory and implementation of the famous Quantum Approximate Optimization Algorithm (QAOA). We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application based on a real-world use case. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. In this way we provide a thorough understanding of the mathematical modelling and the (quantum) algorithms as well as the equally impor"},"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":"2301.09535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-23T16:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"e620dfd1934b1cbbebabdaa61d2f5695a60bcafe91537fa1634de71c9023c66c","abstract_canon_sha256":"47a057d3dd5838e9ced4f47326aba409ad6257c7d431c760ec666954309a9e1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:01.774331Z","signature_b64":"9I3iXux40byEOcCMMrwqzaaRGweYgHdhjzKb+/qheR+J0gfJC+LPYKbBjV5f8vNi7CmXnW01sSW3guqiZo6XAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8503bc461f36649363185d6c5b019d567911e33e8373b59c6e841a6e91f1567","last_reissued_at":"2026-07-05T05:35:01.773852Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:01.773852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Sturm","submitted_at":"2023-01-23T16:38:06Z","abstract_excerpt":"The present tutorial aims to provide a comprehensible and easily accessible introduction into the theory and implementation of the famous Quantum Approximate Optimization Algorithm (QAOA). We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application based on a real-world use case. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. In this way we provide a thorough understanding of the mathematical modelling and the (quantum) algorithms as well as the equally impor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09535","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/2301.09535/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":"2301.09535","created_at":"2026-07-05T05:35:01.773908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.09535v1","created_at":"2026-07-05T05:35:01.773908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09535","created_at":"2026-07-05T05:35:01.773908+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBIDXRDB6NTE","created_at":"2026-07-05T05:35:01.773908+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBIDXRDB6NTESNRR","created_at":"2026-07-05T05:35:01.773908+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBIDXRDB","created_at":"2026-07-05T05:35:01.773908+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09745","citing_title":"Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V","json":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V.json","graph_json":"https://pith.science/api/pith-number/VBIDXRDB6NTESNRRQXLMLMAZ2V/graph.json","events_json":"https://pith.science/api/pith-number/VBIDXRDB6NTESNRRQXLMLMAZ2V/events.json","paper":"https://pith.science/paper/VBIDXRDB"},"agent_actions":{"view_html":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V","download_json":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V.json","view_paper":"https://pith.science/paper/VBIDXRDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.09535&json=true","fetch_graph":"https://pith.science/api/pith-number/VBIDXRDB6NTESNRRQXLMLMAZ2V/graph.json","fetch_events":"https://pith.science/api/pith-number/VBIDXRDB6NTESNRRQXLMLMAZ2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V/action/storage_attestation","attest_author":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V/action/author_attestation","sign_citation":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V/action/citation_signature","submit_replication":"https://pith.science/pith/VBIDXRDB6NTESNRRQXLMLMAZ2V/action/replication_record"}},"created_at":"2026-07-05T05:35:01.773908+00:00","updated_at":"2026-07-05T05:35:01.773908+00:00"}