{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HKG76CPD32SEISWIMNKOTJVFZH","short_pith_number":"pith:HKG76CPD","schema_version":"1.0","canonical_sha256":"3a8dff09e3dea4444ac86354e9a6a5c9f3855df33f7726a73a1bbdb1e767512b","source":{"kind":"arxiv","id":"2405.13196","version":2},"attestation_state":"computed","paper":{"title":"Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"David Kremer, Hanhee Paik, Ismael Faro, Ivan Duran, Juan Cruz-Benito, Victor Villar","submitted_at":"2024-05-21T20:59:12Z","abstract_excerpt":"This paper demonstrates the integration of Reinforcement Learning (RL) into quantum transpiling workflows, significantly enhancing the synthesis and routing of quantum circuits. By employing RL, we achieve near-optimal synthesis of Linear Function, Clifford, and Permutation circuits, up to 9, 11 and 65 qubits respectively, while being compatible with native device instruction sets and connectivity constraints, and orders of magnitude faster than optimization methods such as SAT solvers. We also achieve significant reductions in two-qubit gate depth and count for circuit routing up to 133 qubit"},"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":"2405.13196","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-21T20:59:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f4bd2d4d85fdbf85136ce92fdf11ab7ea5a406c75fd49aaddf9a873175ec4827","abstract_canon_sha256":"dc7397f975e9cd2d9fb43701267c52873dcd631c430fd2702b8f56250dceeb14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:12.003480Z","signature_b64":"kklRL04bgjFSOhrDxVRGu71nVg4RBFnZT5/NWkVggxv+8zFUf1GshDQGrUwj9t7tXuLSsrv/fNhhJwfSiWiBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a8dff09e3dea4444ac86354e9a6a5c9f3855df33f7726a73a1bbdb1e767512b","last_reissued_at":"2026-07-05T10:20:12.002989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:12.002989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"David Kremer, Hanhee Paik, Ismael Faro, Ivan Duran, Juan Cruz-Benito, Victor Villar","submitted_at":"2024-05-21T20:59:12Z","abstract_excerpt":"This paper demonstrates the integration of Reinforcement Learning (RL) into quantum transpiling workflows, significantly enhancing the synthesis and routing of quantum circuits. By employing RL, we achieve near-optimal synthesis of Linear Function, Clifford, and Permutation circuits, up to 9, 11 and 65 qubits respectively, while being compatible with native device instruction sets and connectivity constraints, and orders of magnitude faster than optimization methods such as SAT solvers. We also achieve significant reductions in two-qubit gate depth and count for circuit routing up to 133 qubit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13196","kind":"arxiv","version":2},"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/2405.13196/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":"2405.13196","created_at":"2026-07-05T10:20:12.003041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.13196v2","created_at":"2026-07-05T10:20:12.003041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13196","created_at":"2026-07-05T10:20:12.003041+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKG76CPD32SE","created_at":"2026-07-05T10:20:12.003041+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKG76CPD32SEISWI","created_at":"2026-07-05T10:20:12.003041+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKG76CPD","created_at":"2026-07-05T10:20:12.003041+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07554","citing_title":"RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04070","citing_title":"Quantum circuit partition as a maze: emerging percolation transition via path finding","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2505.08928","citing_title":"TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14042","citing_title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12866","citing_title":"Simulation of vibrational dynamics using qubits and qudits","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13638","citing_title":"CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12365","citing_title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10910","citing_title":"Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21863","citing_title":"Replay-buffer engineering for noise-robust quantum circuit optimization","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2405.08810","citing_title":"Quantum computing with Qiskit","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13812","citing_title":"AlphaCNOT: Learning CNOT Minimization with Model-Based Planning","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH","json":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH.json","graph_json":"https://pith.science/api/pith-number/HKG76CPD32SEISWIMNKOTJVFZH/graph.json","events_json":"https://pith.science/api/pith-number/HKG76CPD32SEISWIMNKOTJVFZH/events.json","paper":"https://pith.science/paper/HKG76CPD"},"agent_actions":{"view_html":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH","download_json":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH.json","view_paper":"https://pith.science/paper/HKG76CPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.13196&json=true","fetch_graph":"https://pith.science/api/pith-number/HKG76CPD32SEISWIMNKOTJVFZH/graph.json","fetch_events":"https://pith.science/api/pith-number/HKG76CPD32SEISWIMNKOTJVFZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH/action/storage_attestation","attest_author":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH/action/author_attestation","sign_citation":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH/action/citation_signature","submit_replication":"https://pith.science/pith/HKG76CPD32SEISWIMNKOTJVFZH/action/replication_record"}},"created_at":"2026-07-05T10:20:12.003041+00:00","updated_at":"2026-07-05T10:20:12.003041+00:00"}