{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NJJJVDUHEOPRHX5QHO3JRHCAQX","short_pith_number":"pith:NJJJVDUH","schema_version":"1.0","canonical_sha256":"6a529a8e87239f13dfb03bb6989c4085f0cf417025ae48075c5a4f8e2a4a8c53","source":{"kind":"arxiv","id":"2503.12884","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Ansatz Design in Quantum Generative Adversarial Networks Using Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Atsushi Matsuo, Kento Ueda","submitted_at":"2025-03-17T07:29:05Z","abstract_excerpt":"We present a novel approach for improving the design of ansatzes in Quantum Generative Adversarial Networks (qGANs) by leveraging Large Language Models (LLMs). By combining the strengths of LLMs with qGANs, our approach iteratively refines ansatz structures to improve accuracy while reducing circuit depth and the number of parameters. This study paves the way for further exploration in AI-driven quantum algorithm design. The flexibility of our proposed workflow extends to other quantum variational algorithms, providing a general framework for optimizing quantum circuits in a variety of quantum"},"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":"2503.12884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T07:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"270229d84758e7a65a776efd81e23c0603b55503f877c7eebdebe4315372e1a4","abstract_canon_sha256":"85184020bedaa920e014ac1734ef6c662c1d128b6cf256e4ee062ccf64e3fba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:48.367890Z","signature_b64":"k+8w0glaYpukE9095g8sgC96khiO4PQ/8YAHjg0Iku3wWHOMnc0dmiFIGYAfoBlP8jucj8p+TBKi36Wwun/VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a529a8e87239f13dfb03bb6989c4085f0cf417025ae48075c5a4f8e2a4a8c53","last_reissued_at":"2026-07-05T10:32:48.366871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:48.366871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Ansatz Design in Quantum Generative Adversarial Networks Using Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Atsushi Matsuo, Kento Ueda","submitted_at":"2025-03-17T07:29:05Z","abstract_excerpt":"We present a novel approach for improving the design of ansatzes in Quantum Generative Adversarial Networks (qGANs) by leveraging Large Language Models (LLMs). By combining the strengths of LLMs with qGANs, our approach iteratively refines ansatz structures to improve accuracy while reducing circuit depth and the number of parameters. This study paves the way for further exploration in AI-driven quantum algorithm design. The flexibility of our proposed workflow extends to other quantum variational algorithms, providing a general framework for optimizing quantum circuits in a variety of quantum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.12884","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/2503.12884/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":"2503.12884","created_at":"2026-07-05T10:32:48.367023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.12884v1","created_at":"2026-07-05T10:32:48.367023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.12884","created_at":"2026-07-05T10:32:48.367023+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJJJVDUHEOPR","created_at":"2026-07-05T10:32:48.367023+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJJJVDUHEOPRHX5Q","created_at":"2026-07-05T10:32:48.367023+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJJJVDUH","created_at":"2026-07-05T10:32:48.367023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21974","citing_title":"Fine-Tuning Large Language Models for Quantum Reasoning","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2509.08351","citing_title":"Generative quantum eigensolver with constrained circuit-cutting overhead","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX","json":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX.json","graph_json":"https://pith.science/api/pith-number/NJJJVDUHEOPRHX5QHO3JRHCAQX/graph.json","events_json":"https://pith.science/api/pith-number/NJJJVDUHEOPRHX5QHO3JRHCAQX/events.json","paper":"https://pith.science/paper/NJJJVDUH"},"agent_actions":{"view_html":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX","download_json":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX.json","view_paper":"https://pith.science/paper/NJJJVDUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.12884&json=true","fetch_graph":"https://pith.science/api/pith-number/NJJJVDUHEOPRHX5QHO3JRHCAQX/graph.json","fetch_events":"https://pith.science/api/pith-number/NJJJVDUHEOPRHX5QHO3JRHCAQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX/action/storage_attestation","attest_author":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX/action/author_attestation","sign_citation":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX/action/citation_signature","submit_replication":"https://pith.science/pith/NJJJVDUHEOPRHX5QHO3JRHCAQX/action/replication_record"}},"created_at":"2026-07-05T10:32:48.367023+00:00","updated_at":"2026-07-05T10:32:48.367023+00:00"}