{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T19:47:22Z","timestamp":1793476042066,"version":"4.5.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T00:00:00Z","timestamp":1762041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T00:00:00Z","timestamp":1762041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11,2]]},"DOI":"10.1109\/qai63978.2025.00047","type":"proceedings-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:56:01Z","timestamp":1769201761000},"page":"253-260","source":"Crossref","is-referenced-by-count":1,"title":["CNOT Minimal Circuit Synthesis: A Reinforcement Learning Approach"],"prefix":"10.1109","author":[{"given":"Riccardo","family":"Romanello","sequence":"first","affiliation":[{"name":"Ca&#x0027; Foscari University of Venice,Department of Environmental Sciences, Informatics and Statistics,Venice,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele Lizzio","family":"Bosco","sequence":"additional","affiliation":[{"name":"University of Udine,Department of Mathematics, Computer Science and Physics,Udine,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacopo","family":"Cossio","sequence":"additional","affiliation":[{"name":"University of Udine,Department of Mathematics, Computer Science and Physics,Udine,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dusan","family":"Sutulovic","sequence":"additional","affiliation":[{"name":"University of Udine,Department of Mathematics, Computer Science and Physics,Udine,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Serra","sequence":"additional","affiliation":[{"name":"University of Udine,Department of Mathematics, Computer Science and Physics,Udine,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[{"name":"University of Udine,Department of Mathematics, Computer Science and Physics,Udine,Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Burelli","sequence":"additional","affiliation":[{"name":"IT University of Copenhagen,Play, Culture and AI Section,Copenhagen,Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Synthesis of unitaries with clifford+t circuits","author":"Kliuchnikov","year":"2013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3649813"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac2d3a"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2906374"},{"key":"ref6","volume-title":"An algorithm for the t-count","author":"Gosset","year":"2013"},{"key":"ref7","volume-title":"The solovay-kitaev algorithm","author":"Dawson","year":"2005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref9","volume-title":"Stabilizer codes and quantum error correction","author":"Gottesman","year":"1997"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/mcas.2024.3349668"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.26421\/QIC8.3-4-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032332"},{"key":"ref14","volume-title":"Synthesis of unitaries with clifford+t circuits","author":"Kliuchnikov","year":"2013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.190502"},{"key":"ref16","volume-title":"Highprecision multi-qubit clifford+t synthesis by unitary diagonalization","author":"Weiden","year":"2025"},{"key":"ref17","volume-title":"Practical and efficient quantum circuit synthesis and transpiling with reinforcement learning","author":"Kremer","year":"2025"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03577-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3213210"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-99498-7_12","article-title":"Sat-based {CNOT, T} quantum circuit synthesis","volume-title":"International Workshop on Reversible Computation","author":"Meuli","year":"2018"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.3233\/FAIA240993","volume-title":"Optimal layout-aware cnot circuit synthesis with qubit permutation","author":"Shaik","year":"2024"},{"key":"ref22","article-title":"An asp approach for the synthesis of cnot minimal quantum circuits","volume-title":"CEUR WORKSHOP PROCEEDINGS","volume":"3428","author":"Piazza","year":"2023"},{"key":"ref23","first-page":"37","article-title":"Synthesis of cnot minimal quantum circuits with topological constraints through asp","volume-title":"CEUR WORKSHOP PROCEEDINGS","volume":"3586","author":"Piazza","year":"2023"},{"key":"ref24","volume-title":"High precision fault-tolerant quantum circuit synthesis by diagonalization using reinforcement learning","author":"Weiden","year":"2024"},{"key":"ref25","volume-title":"qgym: A gym for training and benchmarking rl-based quantum compilation","author":"Van der Linde","year":"2023"},{"key":"ref26","volume-title":"Constrained quantum cnot circuit resynthesis using deep reinforcement learning","author":"Aaronson","year":"2019"},{"key":"ref27","volume-title":"The heisenberg representation of quantum computers","author":"Gottesman","year":"1998"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"ref29","volume-title":"Algebra","author":"Artin","year":"2011"},{"key":"ref30","volume-title":"Minimum synthesis cost of cnot circuits","author":"Bu","year":"2024"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3474226"},{"key":"ref32","article-title":"Proximal policy optimization algorithms","volume-title":"arXiv preprint","author":"Schulman","year":"2017"},{"issue":"268","key":"ref33","first-page":"1","article-title":"Stable-baselines3: Reliable reinforcement learning implementations","volume":"22","author":"Raffin","year":"2021","journal-title":"Journal of machine learning research"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2021.102726"}],"event":{"name":"2025 IEEE International Conference on Quantum Artificial Intelligence (QAI)","location":"Naples, Italy","start":{"date-parts":[[2025,11,2]]},"end":{"date-parts":[[2025,11,5]]}},"container-title":["2025 IEEE International Conference on Quantum Artificial Intelligence (QAI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11343987\/11344585\/11344638.pdf?arnumber=11344638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T07:11:25Z","timestamp":1769238685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11344638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,2]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/qai63978.2025.00047","relation":{},"subject":[],"published":{"date-parts":[[2025,11,2]]}}}