{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T06:56:04Z","timestamp":1783234564245,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Co-Design Center for Quantum Advantage","award":["DE-SC0012704"],"award-info":[{"award-number":["DE-SC0012704"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530654","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"7-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing quantum circuit synthesis for permutations using recursion"],"prefix":"10.1145","author":[{"given":"Cynthia","family":"Chen","sequence":"first","affiliation":[{"name":"Caltech"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Schmitt","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helena","family":"Zhang","sequence":"additional","affiliation":[{"name":"IBM Quantum"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lev S.","family":"Bishop","sequence":"additional","affiliation":[{"name":"IBM Quantum"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Javadi-Abhar","sequence":"additional","affiliation":[{"name":"IBM Quantum"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"STOC '93","author":"Alon N.","unstructured":"N. Alon, F. R. K. Chung, and R. L. Graham. 1993. Routing permutations on graphs via matchings. In STOC '93."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-08-31-533"},{"key":"e_1_3_2_1_3_1","series-title":"SIAM Journal on computing 26, 5","volume-title":"Quantum complexity theory","author":"Bernstein Ethan","year":"1997","unstructured":"Ethan Bernstein and Umesh Vazirani. 1997. Quantum complexity theory. SIAM Journal on computing 26, 5 (1997), 1411--1473."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3091648"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00175-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.100.032328"},{"key":"e_1_3_2_1_7_1","volume-title":"Michele Mosca, and Priyanka Mukhopadhyay.","author":"Gheorghiu Vlad","year":"2021","unstructured":"Vlad Gheorghiu, Sarah Meng Li, Michele Mosca, and Priyanka Mukhopadhyay. 2021. Reducing the CNOT count for Clifford+T circuits on NISQ architectures. arXiv:2011.12191 [quant-ph]"},{"key":"e_1_3_2_1_8_1","unstructured":"Aleks Kissinger and Arianne Meijer van de Griend. 2019. CNOT circuit extraction for topologically-constrained quantum memories. arXiv:1904.00633 [quant-ph]"},{"key":"e_1_3_2_1_9_1","volume-title":"Computation at a distance. Chicago Journal of Theoretical Computer Science 13 (02","author":"Kutin Samuel","year":"2007","unstructured":"Samuel Kutin, David Moulton, and Lawren Smithline. 2007. Computation at a distance. Chicago Journal of Theoretical Computer Science 13 (02 2007)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011763.2011767"},{"key":"e_1_3_2_1_11_1","unstructured":"Bruno Schmitt. 2021. tweedledum. https:\/\/github.com\/boschmitt\/tweedledum."},{"key":"e_1_3_2_1_12_1","volume-title":"Symbolic Algorithms for Token Swapping. In 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). 28--33","author":"Schmitt Bruno","year":"2020","unstructured":"Bruno Schmitt, Mathias Soeken, and Giovanni De Micheli. 2020. Symbolic Algorithms for Token Swapping. In 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL). 28--33."},{"key":"e_1_3_2_1_13_1","unstructured":"Eddie Schoute. 2019. arct. https:\/\/gitlab.umiacs.umd.edu\/amchilds\/arct."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_15_1","unstructured":"Bujiao Wu Xiaoyu He Shuai Yang Lifu Shou Guojing Tian Jialin Zhang and Xiaoming Sun. 2019. Optimization of CNOT circuits on topological superconducting processors. arXiv:1910.14478 [quant-ph]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.052"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.","author":"Zhang Louxin","year":"1997","unstructured":"Louxin Zhang. 1997. Optimal Bounds for Matching Routing on Trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","location":"San Francisco California","acronym":"DAC '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"]},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530654","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:23Z","timestamp":1750186943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":17,"alternative-id":["10.1145\/3489517.3530654","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530654","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}