{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2VUHDA4OENLSWGQROKBI7FDGKN","short_pith_number":"pith:2VUHDA4O","schema_version":"1.0","canonical_sha256":"d56871838e23572b1a1172828f9466537033ee17d10edcc29342cec73886b056","source":{"kind":"arxiv","id":"2402.13754","version":4},"attestation_state":"computed","paper":{"title":"Reinforcement learning-assisted quantum architecture search for variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Akash Kundu","submitted_at":"2024-02-21T12:30:39Z","abstract_excerpt":"A significant hurdle in the noisy intermediate-scale quantum (NISQ) era is identifying functional quantum circuits. These circuits must also adhere to the constraints imposed by current quantum hardware limitations. Variational quantum algorithms (VQAs), a class of quantum-classical optimization algorithms, were developed to address these challenges in the currently available quantum devices. However, the overall performance of VQAs depends on the initialization strategy of the variational circuit, the structure of the circuit (also known as ansatz), and the configuration of the cost function."},"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":"2402.13754","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-21T12:30:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"282e665fb50b916c285657274b0383d8b121a18b3ac3fa1afc04e2656d94f346","abstract_canon_sha256":"656d986dc7d8dc7efd4205bb937801e67d405a0eedaf30882c41fbbb65a46b5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:30.451946Z","signature_b64":"fq9eVMhDi2NARf5NjGp1h4/vosuyBlll3sSC5kIibuLxo7WQ0wq8vEurPS5l6aBzWyZB30AOMqj34N+QiE82CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56871838e23572b1a1172828f9466537033ee17d10edcc29342cec73886b056","last_reissued_at":"2026-07-05T09:14:30.451476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:30.451476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement learning-assisted quantum architecture search for variational quantum algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Akash Kundu","submitted_at":"2024-02-21T12:30:39Z","abstract_excerpt":"A significant hurdle in the noisy intermediate-scale quantum (NISQ) era is identifying functional quantum circuits. These circuits must also adhere to the constraints imposed by current quantum hardware limitations. Variational quantum algorithms (VQAs), a class of quantum-classical optimization algorithms, were developed to address these challenges in the currently available quantum devices. However, the overall performance of VQAs depends on the initialization strategy of the variational circuit, the structure of the circuit (also known as ansatz), and the configuration of the cost function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13754","kind":"arxiv","version":4},"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/2402.13754/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":"2402.13754","created_at":"2026-07-05T09:14:30.451534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13754v4","created_at":"2026-07-05T09:14:30.451534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13754","created_at":"2026-07-05T09:14:30.451534+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VUHDA4OENLS","created_at":"2026-07-05T09:14:30.451534+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VUHDA4OENLSWGQR","created_at":"2026-07-05T09:14:30.451534+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VUHDA4O","created_at":"2026-07-05T09:14:30.451534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24933","citing_title":"Self-Modulating Quantum Fast-Weight Programmers for Efficient Adaptive Sequential Learning","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2502.15375","citing_title":"Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21863","citing_title":"Replay-buffer engineering for noise-robust quantum circuit optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN","json":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN.json","graph_json":"https://pith.science/api/pith-number/2VUHDA4OENLSWGQROKBI7FDGKN/graph.json","events_json":"https://pith.science/api/pith-number/2VUHDA4OENLSWGQROKBI7FDGKN/events.json","paper":"https://pith.science/paper/2VUHDA4O"},"agent_actions":{"view_html":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN","download_json":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN.json","view_paper":"https://pith.science/paper/2VUHDA4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13754&json=true","fetch_graph":"https://pith.science/api/pith-number/2VUHDA4OENLSWGQROKBI7FDGKN/graph.json","fetch_events":"https://pith.science/api/pith-number/2VUHDA4OENLSWGQROKBI7FDGKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN/action/storage_attestation","attest_author":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN/action/author_attestation","sign_citation":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN/action/citation_signature","submit_replication":"https://pith.science/pith/2VUHDA4OENLSWGQROKBI7FDGKN/action/replication_record"}},"created_at":"2026-07-05T09:14:30.451534+00:00","updated_at":"2026-07-05T09:14:30.451534+00:00"}