{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NOZ67NEQXIIPBWMOSW2W7GGKGU","short_pith_number":"pith:NOZ67NEQ","schema_version":"1.0","canonical_sha256":"6bb3efb490ba10f0d98e95b56f98ca350fe5ae0c51127b41ca132fbf6cedefcf","source":{"kind":"arxiv","id":"2504.16350","version":1},"attestation_state":"computed","paper":{"title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Ilya Safro, Ilya Tyagin, Karunya Shirali, Kyle Sherbert, Marwa H. Farag, Yuri Alexeev","submitted_at":"2025-04-23T02:00:36Z","abstract_excerpt":"Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific conditions. In this work, we introduce QAOA-GPT, a generative framework that leverages Generative Pretrained Transformers (GPT) to directly synthesize quantum circuits for solving quadratic unconstrained binary optimization problems, and demonstrate it on the MaxCut problem on graphs. To diversify the training circuits and ensure their quality, we have generat"},"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":"2504.16350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-23T02:00:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"01dc2fd5b361f752a6ec38d37c6a2f1b0402eecfaec1db29773d1157499ab87a","abstract_canon_sha256":"b49a31a38e9b5bd14dd34a847968a479e266c5f85a2d29aabf1f157471f1912b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:45.300917Z","signature_b64":"nzz8JXeyprUcI6SHjlY39rMxc+crqPRReeO1pQL45N/L5acZhW82FJJg8FF2bHEDjr3oMSbdMDGsWTKcWienAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb3efb490ba10f0d98e95b56f98ca350fe5ae0c51127b41ca132fbf6cedefcf","last_reissued_at":"2026-07-05T10:52:45.300437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:45.300437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Ilya Safro, Ilya Tyagin, Karunya Shirali, Kyle Sherbert, Marwa H. Farag, Yuri Alexeev","submitted_at":"2025-04-23T02:00:36Z","abstract_excerpt":"Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific conditions. In this work, we introduce QAOA-GPT, a generative framework that leverages Generative Pretrained Transformers (GPT) to directly synthesize quantum circuits for solving quadratic unconstrained binary optimization problems, and demonstrate it on the MaxCut problem on graphs. To diversify the training circuits and ensure their quality, we have generat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16350","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/2504.16350/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":"2504.16350","created_at":"2026-07-05T10:52:45.300494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16350v1","created_at":"2026-07-05T10:52:45.300494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16350","created_at":"2026-07-05T10:52:45.300494+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOZ67NEQXIIP","created_at":"2026-07-05T10:52:45.300494+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOZ67NEQXIIPBWMO","created_at":"2026-07-05T10:52:45.300494+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOZ67NEQ","created_at":"2026-07-05T10:52:45.300494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":99,"is_internal_anchor":false},{"citing_arxiv_id":"2504.04021","citing_title":"Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17145","citing_title":"Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2509.08351","citing_title":"Generative quantum eigensolver with constrained circuit-cutting overhead","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU","json":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU.json","graph_json":"https://pith.science/api/pith-number/NOZ67NEQXIIPBWMOSW2W7GGKGU/graph.json","events_json":"https://pith.science/api/pith-number/NOZ67NEQXIIPBWMOSW2W7GGKGU/events.json","paper":"https://pith.science/paper/NOZ67NEQ"},"agent_actions":{"view_html":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU","download_json":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU.json","view_paper":"https://pith.science/paper/NOZ67NEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16350&json=true","fetch_graph":"https://pith.science/api/pith-number/NOZ67NEQXIIPBWMOSW2W7GGKGU/graph.json","fetch_events":"https://pith.science/api/pith-number/NOZ67NEQXIIPBWMOSW2W7GGKGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU/action/storage_attestation","attest_author":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU/action/author_attestation","sign_citation":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU/action/citation_signature","submit_replication":"https://pith.science/pith/NOZ67NEQXIIPBWMOSW2W7GGKGU/action/replication_record"}},"created_at":"2026-07-05T10:52:45.300494+00:00","updated_at":"2026-07-05T10:52:45.300494+00:00"}