{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UDOQDGKFLUFESMYIKMMFA6KF2A","short_pith_number":"pith:UDOQDGKF","schema_version":"1.0","canonical_sha256":"a0dd0199455d0a4933085318507945d01457846371d264ab52341c66f64c177d","source":{"kind":"arxiv","id":"2103.07585","version":1},"attestation_state":"computed","paper":{"title":"Quantum circuit optimization with deep reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Marquardt, Li Li, Murphy Yuezhen Niu, Thomas F\\\"osel","submitted_at":"2021-03-13T00:49:51Z","abstract_excerpt":"A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been developed which focus on optimizing the high-level circuit structure. However, these approaches do not consider and thus cannot optimize for the hardware details of the quantum architecture, which is especially important for near-term devices. To address this point, we present an approach to quantum circuit optimization based on reinforcement learning. We demonstra"},"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":"2103.07585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-13T00:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"57c2b9b698cd13ce25f6ef5272fec4f0ba624818716db9f8d85be6271158b398","abstract_canon_sha256":"3001ae41e9e01a39abe700b800b764be327eb6112f19389db2ec92cd70d02ad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:42.916900Z","signature_b64":"2Dss1VuqedXEbyZR0FMZV3Eiudnb99LSpEvh8fo4tkXw9Gq+b9uJIXf0dykZmGQQ24m8tb/KIn/Bl0fb6w0cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0dd0199455d0a4933085318507945d01457846371d264ab52341c66f64c177d","last_reissued_at":"2026-07-05T02:22:42.916487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:42.916487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit optimization with deep reinforcement learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Florian Marquardt, Li Li, Murphy Yuezhen Niu, Thomas F\\\"osel","submitted_at":"2021-03-13T00:49:51Z","abstract_excerpt":"A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been developed which focus on optimizing the high-level circuit structure. However, these approaches do not consider and thus cannot optimize for the hardware details of the quantum architecture, which is especially important for near-term devices. To address this point, we present an approach to quantum circuit optimization based on reinforcement learning. We demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.07585","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/2103.07585/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":"2103.07585","created_at":"2026-07-05T02:22:42.916543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.07585v1","created_at":"2026-07-05T02:22:42.916543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.07585","created_at":"2026-07-05T02:22:42.916543+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDOQDGKFLUFE","created_at":"2026-07-05T02:22:42.916543+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDOQDGKFLUFESMYI","created_at":"2026-07-05T02:22:42.916543+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDOQDGKF","created_at":"2026-07-05T02:22:42.916543+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25394","citing_title":"FactorLibrary: From Polynomials to Circuits via Recursive Subgoals","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30866","citing_title":"Generative Quantum Data Embeddings for Supervised Learning","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13268","citing_title":"Physics Guided Generative Optimization for Trotter Suzuki Decomposition","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22980","citing_title":"Automatic De-Quantization of Quantum Programs Using Constant Propagation","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2508.21122","citing_title":"Quantum algorithms for equational reasoning","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2506.09323","citing_title":"Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18995","citing_title":"DeepQuantum: A PyTorch-based Software Platform for Quantum Machine Learning and Photonic Quantum Computing","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13268","citing_title":"Physics Guided Generative Optimization for Trotter Suzuki Decomposition","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04137","citing_title":"Noise tolerance via reinforcement in the quantum search problem","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.28009","citing_title":"Learning quantum disentanglement scheduling from reduced states via modular hybrid policies","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27171","citing_title":"Structure-Aware Transformers for Learning Near-Optimal Trotter Orderings with System-Size Generalization in 1D Heisenberg Hamiltonians","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21863","citing_title":"Replay-buffer engineering for noise-robust quantum circuit optimization","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07951","citing_title":"Investigation of Automated Design of Quantum Circuits for Imaginary Time Evolution Methods Using Deep Reinforcement Learning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04604","citing_title":"Generative Quantum-inspired Kolmogorov-Arnold Eigensolver","ref_index":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A","json":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A.json","graph_json":"https://pith.science/api/pith-number/UDOQDGKFLUFESMYIKMMFA6KF2A/graph.json","events_json":"https://pith.science/api/pith-number/UDOQDGKFLUFESMYIKMMFA6KF2A/events.json","paper":"https://pith.science/paper/UDOQDGKF"},"agent_actions":{"view_html":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A","download_json":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A.json","view_paper":"https://pith.science/paper/UDOQDGKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.07585&json=true","fetch_graph":"https://pith.science/api/pith-number/UDOQDGKFLUFESMYIKMMFA6KF2A/graph.json","fetch_events":"https://pith.science/api/pith-number/UDOQDGKFLUFESMYIKMMFA6KF2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A/action/storage_attestation","attest_author":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A/action/author_attestation","sign_citation":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A/action/citation_signature","submit_replication":"https://pith.science/pith/UDOQDGKFLUFESMYIKMMFA6KF2A/action/replication_record"}},"created_at":"2026-07-05T02:22:42.916543+00:00","updated_at":"2026-07-05T02:22:42.916543+00:00"}