{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:L5UW2UGPMEYYTOBF73SX4QUOMS","short_pith_number":"pith:L5UW2UGP","schema_version":"1.0","canonical_sha256":"5f696d50cf613189b825fee57e428e64b981c45f6f14e9006e82c49ca4f621b9","source":{"kind":"arxiv","id":"2212.11734","version":2},"attestation_state":"computed","paper":{"title":"An introduction to variational quantum algorithms for combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Camille Grange, Eric Bourreau, Michael Poss","submitted_at":"2022-12-22T14:27:52Z","abstract_excerpt":"Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among them, the Quantum Approximate Optimization Algorithm (QAOA) is one of the most popular one studied by the combinatorial optimization community. In this tutorial, we provide a mathematical description of the class of Variational Quantum Algorithms, assuming no previous knowledge of quantum physics from the readers. We introduce precisely the key aspects of these hybrid algorithms on the quantum side (parametrized quant"},"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":"2212.11734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-22T14:27:52Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d6b7717e4fa48e13726161a487678592b91ad259ec34c3feb86cf2a69da74a41","abstract_canon_sha256":"fd5afdfe68575e9c462840b9c8b4b748d32a7174d8812937d362bf0dc4485f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:00.890959Z","signature_b64":"WMqFsXiJPjX+6TXFaz0tREuWcliZy1ok41dkTabvVDEVqjBiTWbUp6sGN7HO5T40sYDUma2lL9Bgc2ivjP/2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f696d50cf613189b825fee57e428e64b981c45f6f14e9006e82c49ca4f621b9","last_reissued_at":"2026-07-05T08:54:00.890511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:00.890511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An introduction to variational quantum algorithms for combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.OC","authors_text":"Camille Grange, Eric Bourreau, Michael Poss","submitted_at":"2022-12-22T14:27:52Z","abstract_excerpt":"Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among them, the Quantum Approximate Optimization Algorithm (QAOA) is one of the most popular one studied by the combinatorial optimization community. In this tutorial, we provide a mathematical description of the class of Variational Quantum Algorithms, assuming no previous knowledge of quantum physics from the readers. We introduce precisely the key aspects of these hybrid algorithms on the quantum side (parametrized quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11734","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/2212.11734/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":"2212.11734","created_at":"2026-07-05T08:54:00.890568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.11734v2","created_at":"2026-07-05T08:54:00.890568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11734","created_at":"2026-07-05T08:54:00.890568+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5UW2UGPMEYY","created_at":"2026-07-05T08:54:00.890568+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5UW2UGPMEYYTOBF","created_at":"2026-07-05T08:54:00.890568+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5UW2UGP","created_at":"2026-07-05T08:54:00.890568+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01029","citing_title":"AEQUAM: Accelerating Quantum Algorithm Validation through FPGA-Based Emulation","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS","json":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS.json","graph_json":"https://pith.science/api/pith-number/L5UW2UGPMEYYTOBF73SX4QUOMS/graph.json","events_json":"https://pith.science/api/pith-number/L5UW2UGPMEYYTOBF73SX4QUOMS/events.json","paper":"https://pith.science/paper/L5UW2UGP"},"agent_actions":{"view_html":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS","download_json":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS.json","view_paper":"https://pith.science/paper/L5UW2UGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.11734&json=true","fetch_graph":"https://pith.science/api/pith-number/L5UW2UGPMEYYTOBF73SX4QUOMS/graph.json","fetch_events":"https://pith.science/api/pith-number/L5UW2UGPMEYYTOBF73SX4QUOMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS/action/storage_attestation","attest_author":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS/action/author_attestation","sign_citation":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS/action/citation_signature","submit_replication":"https://pith.science/pith/L5UW2UGPMEYYTOBF73SX4QUOMS/action/replication_record"}},"created_at":"2026-07-05T08:54:00.890568+00:00","updated_at":"2026-07-05T08:54:00.890568+00:00"}