{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TOZRRQVP5YBWWE57QZW6LMUKEP","short_pith_number":"pith:TOZRRQVP","schema_version":"1.0","canonical_sha256":"9bb318c2afee036b13bf866de5b28a23d1af9972696721c83a2ec127df72594e","source":{"kind":"arxiv","id":"2503.11638","version":1},"attestation_state":"computed","paper":{"title":"Scaling the Automated Discovery of Quantum Circuits via Reinforcement Learning with Gadgets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Marquardt, Jan Olle, Oleg M. Yevtushenko","submitted_at":"2025-03-14T17:55:49Z","abstract_excerpt":"Reinforcement Learning (RL) has established itself as a powerful tool for designing quantum circuits, which are essential for processing quantum information. RL applications have typically focused on circuits of small to intermediate complexity, as computation times tend to increase exponentially with growing circuit complexity. This computational explosion severely limits the scalability of RL and casts significant doubt on its broader applicability. In this paper, we propose a principled approach based on the systematic discovery and introduction of composite gates -- {\\it gadgets}, that ena"},"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.11638","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-14T17:55:49Z","cross_cats_sorted":[],"title_canon_sha256":"419eda8478e4e9a69f81a296491add755e03913fe1842a145738a0961222a29f","abstract_canon_sha256":"1e61747a85bbfd9bea004923d45fd34833337b9cf3967aa79c12b1063d7f940d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:36.423832Z","signature_b64":"hmP0KPsof1hjwQnmbnHV5ZjuJvot9nD1twOWfJG9SJYzQe6/bjWeK/+B0nQLiXUmWWCZyn/8EZg1UUNqB7OYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb318c2afee036b13bf866de5b28a23d1af9972696721c83a2ec127df72594e","last_reissued_at":"2026-07-05T10:31:36.423103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:36.423103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling the Automated Discovery of Quantum Circuits via Reinforcement Learning with Gadgets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Marquardt, Jan Olle, Oleg M. Yevtushenko","submitted_at":"2025-03-14T17:55:49Z","abstract_excerpt":"Reinforcement Learning (RL) has established itself as a powerful tool for designing quantum circuits, which are essential for processing quantum information. RL applications have typically focused on circuits of small to intermediate complexity, as computation times tend to increase exponentially with growing circuit complexity. This computational explosion severely limits the scalability of RL and casts significant doubt on its broader applicability. In this paper, we propose a principled approach based on the systematic discovery and introduction of composite gates -- {\\it gadgets}, that ena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.11638","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.11638/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.11638","created_at":"2026-07-05T10:31:36.423185+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.11638v1","created_at":"2026-07-05T10:31:36.423185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.11638","created_at":"2026-07-05T10:31:36.423185+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOZRRQVP5YBW","created_at":"2026-07-05T10:31:36.423185+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOZRRQVP5YBWWE57","created_at":"2026-07-05T10:31:36.423185+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOZRRQVP","created_at":"2026-07-05T10:31:36.423185+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24808","citing_title":"Large-Language-Model Discovery of Quantum LDPC Codes through Structured Concept Evolution","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2506.01666","citing_title":"Synthesis of discrete-continuous quantum circuits with multimodal diffusion models","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14931","citing_title":"Learning to Concatenate Quantum Codes","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP","json":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP.json","graph_json":"https://pith.science/api/pith-number/TOZRRQVP5YBWWE57QZW6LMUKEP/graph.json","events_json":"https://pith.science/api/pith-number/TOZRRQVP5YBWWE57QZW6LMUKEP/events.json","paper":"https://pith.science/paper/TOZRRQVP"},"agent_actions":{"view_html":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP","download_json":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP.json","view_paper":"https://pith.science/paper/TOZRRQVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.11638&json=true","fetch_graph":"https://pith.science/api/pith-number/TOZRRQVP5YBWWE57QZW6LMUKEP/graph.json","fetch_events":"https://pith.science/api/pith-number/TOZRRQVP5YBWWE57QZW6LMUKEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP/action/storage_attestation","attest_author":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP/action/author_attestation","sign_citation":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP/action/citation_signature","submit_replication":"https://pith.science/pith/TOZRRQVP5YBWWE57QZW6LMUKEP/action/replication_record"}},"created_at":"2026-07-05T10:31:36.423185+00:00","updated_at":"2026-07-05T10:31:36.423185+00:00"}