{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T04:07:28Z","timestamp":1781150848034,"version":"3.54.1"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:00:00Z","timestamp":1646352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the problem in the CNOT+rotation gate set from a mathematical programming standpoint, offering contributions both in terms of understanding the mathematics of the problem and its efficient solution. Among the results that we present, we are able to derive a 14-CNOT 4-qubit Toffoli decomposition from scratch, and show that the Quantum Shannon Decomposition can be compressed by a factor of two without practical loss of fidelity.<\/jats:p>","DOI":"10.1145\/3505181","type":"journal-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T09:54:52Z","timestamp":1646387692000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Best Approximate Quantum Compiling Problems"],"prefix":"10.1145","volume":"3","author":[{"given":"Liam","family":"Madden","sequence":"first","affiliation":[{"name":"University of Colorado Boulder, Boulder, Colorado"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2923-3361","authenticated-orcid":false,"given":"Andrea","family":"Simonetto","sequence":"additional","affiliation":[{"name":"UMA, ENSTA Paris, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"e_1_3_2_3_2","first-page":"84","volume-title":"Proceedings of the International Conference on Quantum Physics and Logic","author":"Amy Matthew","year":"2017","unstructured":"Matthew Amy, Jianxin Chen, and Neil J. Ross. 2017. A finite presentation of CNOT-dihedral operators. In Proceedings of the International Conference on Quantum Physics and Logic. 84\u201397."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"issue":"1","key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1038\/s41534-019-0157-8","article-title":"A generative modeling approach for benchmarking and training shallow quantum circuits","volume":"5","author":"Benedetti Marcello","year":"2019","unstructured":"Marcello Benedetti, Delfina Garcia-Pintos, Oscar Perdomo, Vicente Leyton-Ortega, Yunseong Nam, and Alejandro Perdomo-Ortiz. 2019. A generative modeling approach for benchmarking and training shallow quantum circuits. npj Quantum Information 5, 1 (2019), 45.","journal-title":"npj Quantum Information"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-44678-8_4","volume-title":"Proceedings of the Quantum Information","author":"Beth Thomas","year":"2001","unstructured":"Thomas Beth and Martin R\u00f6tteler. 2001. Quantum algorithms: Applicable algebra and quantum physics. In Proceedings of the Quantum Information. Springer, 96\u2013150."},{"key":"e_1_3_2_10_2","unstructured":"Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2017. Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540 (2017)."},{"key":"e_1_3_2_11_2","first-page":"1","volume-title":"Proceedings of the 2019 IEEE\/ACM International Conference on Computer-Aided Design","author":"Bhattacharjee D.","year":"2019","unstructured":"D. Bhattacharjee, A. A. Saki, M. Alam, A. Chattopadhyay, and S. Ghosh. 2019. MUQUT: Multi-constraint quantum circuit mapping on NISQ computers: Invited paper. In Proceedings of the 2019 IEEE\/ACM International Conference on Computer-Aided Design. 1\u20137."},{"key":"e_1_3_2_12_2","first-page":"366","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling","author":"Booth Kyle E. C.","year":"2018","unstructured":"Kyle E. C. Booth, Minh Do, J. Christopher Beck, Eleanor Rieffel, Davide Venturelli, and Jeremy Frank. 2018. Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In Proceedings of the International Conference on Automated Planning and Scheduling. 366\u2013374."},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Sergey Bravyi and Dmitri Maslov. 2021. Hadamard-free circuits expose the structure of the Clifford group. IEEE Transactions on Information Theory 67 7 (2021) 4546\u20134563.","DOI":"10.1109\/TIT.2021.3081415"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775916"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"issue":"11","key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"113022","DOI":"10.1088\/1367-2630\/aae94a","article-title":"Learning the quantum algorithm for state overlap","volume":"20","author":"Cincio Lukasz","year":"2018","unstructured":"Lukasz Cincio, Yi\u011fit Suba\u015f\u0131, Andrew T. Sornborger, and Patrick J. Coles. 2018. Learning the quantum algorithm for state overlap. New Journal of Physics 20, 11 (2018), 113022.","journal-title":"New Journal of Physics"},{"key":"e_1_3_2_17_2","first-page":"5:1\u20135:32","volume-title":"Proceedings of the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography","volume":"135","author":"Cowtan Alexander","year":"2019","unstructured":"Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, and Seyon Sivarajah. 2019. On the qubit routing problem. In Proceedings of the 14th Conference on the Theory of Quantum Computation, Communication and Cryptography, Vol. 135. 5:1\u20135:32."},{"key":"e_1_3_2_18_2","unstructured":"Gavin E. Crooks. 2020. Gates states and circuits. (2020)."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032328"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Christopher M. Dawson and Michael A. Nielsen. 2006. The Solovay-Kitaev algorithm. Quantum Information & Computation 6 1 (2006) 81\u201395.","DOI":"10.26421\/QIC6.1-6"},{"key":"e_1_3_2_21_2","article-title":"Architecture-aware synthesis of phase polynomials for NISQ devices","author":"Griend Arianne Meijer-van de","year":"2020","unstructured":"Arianne Meijer-van de Griend and Ross Duncan. 2020. Architecture-aware synthesis of phase polynomials for NISQ devices. arXiv:2004.06052. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2004.06052.","journal-title":"arXiv:2004.06052."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/39\/395305"},{"key":"e_1_3_2_23_2","article-title":"Equivalent quantum circuits","author":"Garcia-Escartin J. C.","year":"2011","unstructured":"J. C. Garcia-Escartin and P. Chamorro-Posada. 2011. Equivalent quantum circuits. arXiv:1110.2998. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/1110.2998.","journal-title":"arXiv:1110.2998."},{"key":"e_1_3_2_24_2","article-title":"On the structure of the CNOT-dihedral group","author":"Garion Shelly","year":"2020","unstructured":"Shelly Garion and Andrew W. Cross. 2020. On the structure of the CNOT-dihedral group. arXiv:2006.12042. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2006.12042.","journal-title":"arXiv:2006.12042."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/3305381.3305509"},{"key":"e_1_3_2_26_2","article-title":"Reducing the CNOT count for Clifford + T circuits on NISQ architectures","author":"Gheorghiu Vlad","year":"2020","unstructured":"Vlad Gheorghiu, Sarah Meng Li, Michele Mosca, and Priyanka Mukhopadhyay. 2020. Reducing the CNOT count for Clifford + T circuits on NISQ architectures. arXiv:2011.12191. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2011.12191.","journal-title":"arXiv:2011.12191."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.5555\/3086952"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis (2nd ed.)","author":"Horn Roger A.","year":"2012","unstructured":"Roger A. Horn and Charles R. Johnson. 2012. Matrix Analysis (2nd ed.), Cambridge University Press, Cambridge ; New York."},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Zhishen Huang and Stephen Becker. 2019. Perturbed proximal descent to escape saddle points for non-convex and non-smooth objective functions. In INNS Big Data and Deep Learning Conference Vol. 1. Springer 58\u201377.","DOI":"10.1007\/978-3-030-16841-4_7"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2019.10.004"},{"key":"e_1_3_2_31_2","first-page":"1724?1732","volume-title":"Proceedings of the 34th International Conference on Machine Learning - Volume 70","author":"Jin Chi","year":"2017","unstructured":"Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M. Kakade, and Michael I. Jordan. 2017. How to escape saddle points efficiently. In Proceedings of the 34th International Conference on Machine Learning - Volume 70. JMLR.org, 1724?1732."},{"key":"e_1_3_2_32_2","first-page":"1042","volume-title":"Proceedings of the Conference On Learning Theory","author":"Jin Chi","year":"2018","unstructured":"Chi Jin, Praneeth Netrapalli, and Michael I Jordan. 2018. Accelerated gradient descent escapes saddle points faster than gradient descent. In Proceedings of the Conference On Learning Theory. 1042\u20131085."},{"key":"e_1_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Petar Jurcevic Ali Javadi-Abhari Lev S Bishop Isaac Lauer Daniela F Bogorin Markus Brink Lauren Capelluto Oktay G\u00fcnl\u00fck Toshinaro Itoko Naoki Kanazawa et\u00a0al. 2021. Demonstration of quantum volume 64 on a superconducting quantum computing system. Quantum Science and Technology 6 2 (2021) 025020.","DOI":"10.1088\/2058-9565\/abe519"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-05-13-140"},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.26421\/QIC20.7-8-4","article-title":"CNOT circuit extraction for topologically-constrained quantum memories","volume":"20","author":"Kissinger A","year":"2020","unstructured":"A Kissinger and A Meijer-van de Griend. 2020. CNOT circuit extraction for topologically-constrained quantum memories. Quantum Information and Computation 20, 7&8 (2020), 581\u2013596.","journal-title":"Quantum Information and Computation"},{"key":"e_1_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Vadym Kliuchnikov Dmitri Maslov and Michele Mosca. 2013. Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates. Quantum Information & Computation 13 7\u20138 (2013) 607\u2013630.","DOI":"10.26421\/QIC13.7-8-4"},{"key":"e_1_3_2_37_2","volume-title":"Lie Groups Beyond an Introduction","author":"Knapp Anthony W.","year":"2013","unstructured":"Anthony W. Knapp. 2013. Lie Groups Beyond an Introduction. Vol. 140. Springer Science & Business Media."},{"key":"e_1_3_2_38_2","unstructured":"Jason D. Lee Max Simchowitz Michael I. Jordan and Benjamin Recht. 2016. Gradient descent only converges to minimizers(Proceedings of Machine Learning Research Vol. 49) Vitaly Feldman Alexander Rakhlin and Ohad Shamir (Eds.) PMLR Columbia University New York New York 1246\u20131257."},{"key":"e_1_3_2_39_2","volume-title":"Introduction to Smooth Manifolds","author":"Lee John M","year":"2013","unstructured":"John M Lee. 2013. Introduction to Smooth Manifolds. Springer."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1618020114"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01931367"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917562"},{"issue":"7","key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"4729","DOI":"10.1109\/TIT.2018.2825602","article-title":"Shorter stabilizer circuits via bruhat decomposition and quantum circuit transformations","volume":"64","author":"Maslov Dmitri","year":"2018","unstructured":"Dmitri Maslov and Martin Roetteler. 2018. Shorter stabilizer circuits via bruhat decomposition and quantum circuit transformations. IEEE Transactions on Information Theory 64, 7 (2018), 4729\u20134738.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/978-3-642-15883-4_27","volume-title":"Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Mosci Sofia","year":"2010","unstructured":"Sofia Mosci, Lorenzo Rosasco, Matteo Santoro, Alessandro Verri, and Silvia Villa. 2010. Solving structured sparsity regularization with proximal methods. In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 418\u2013433."},{"key":"e_1_3_2_47_2","first-page":"527","volume-title":"Proceedings of the 2019 ACM\/IEEE 46th Annual International Symposium on Computer Architecture","author":"Murali Prakash","year":"2019","unstructured":"Prakash Murali, Norbert Matthias Linke, Margaret Martonosi, Ali Javadi Abhari, Nhung Hong Nguyen, and Cinthia Huerta Alderete. 2019. Full-stack, real-system quantum computer studies: Architectural comparisons and design insights. In Proceedings of the 2019 ACM\/IEEE 46th Annual International Symposium on Computer Architecture. IEEE, 527\u2013540."},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Yumi Nakajima Yasuhito Kawano and Hiroshi Sekigawa. 2005. A new algorithm for producing quantum circuits using KAK decompositions. Quantum Information & Computation 6 1 (2006) 67\u201380.","DOI":"10.26421\/QIC6.1-5"},{"issue":"1","key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1038\/s41534-018-0072-4","article-title":"Automated optimization of large quantum circuits with continuous parameters","volume":"4","author":"Nam Yunseong","year":"2018","unstructured":"Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4, 1 (2018), 23.","journal-title":"npj Quantum Information"},{"key":"e_1_3_2_50_2","article-title":"Optimal qubit assignment and routing via integer programming","author":"Nannicini Giacomo","year":"2021","unstructured":"Giacomo Nannicini, Lev S Bishop, Oktay Gunluk, and Petar Jurcevic. 2021. Optimal qubit assignment and routing via integer programming. arXiv:2106.06446. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2106.06446.","journal-title":"arXiv:2106.06446."},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Beatrice Nash Vlad Gheorghiu and Michele Mosca. 2020. Quantum circuit optimizations for NISQ architectures. Quantum Science and Technology 5 2 (2020) 025010.","DOI":"10.1088\/2058-9565\/ab79b1"},{"key":"e_1_3_2_52_2","article-title":"A method for solving the convex programming problem with convergence rate  \\( O(1\/k^2) \\)","author":"Nesterov Y.E.","year":"1983","unstructured":"Y.E. Nesterov. 1983. A method for solving the convex programming problem with convergence rate \\( O(1\/k^2) \\) . Soviet Mathematics Doklady 269, 3 (1983), 543\u2013547.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_53_2","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen Michael A.","year":"2002","unstructured":"Michael A. Nielsen and Isaac Chuang. 2002. Quantum Computation and Quantum Information. American Association of Physics Teachers."},{"key":"e_1_3_2_54_2","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-319-93031-2_32","volume-title":"Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Oddi Angelo","year":"2018","unstructured":"Angelo Oddi and Riccardo Rasconi. 2018. Greedy randomized search for scalable compilation of quantum circuits. In Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer International Publishing, Cham, 446\u2013461."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.5555\/2011763.2011767"},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","unstructured":"Eric C. Peterson Gavin E. Crooks and Robert S. Smith. 2020. Two-qubit circuit depth and the monodromy polytope. In Integration of Constraint Programming Artificial Intelligence and Operations Research . Springer International Publishing Cham 446\u2013461.","DOI":"10.22331\/q-2020-03-26-247"},{"key":"e_1_3_2_57_2","volume-title":"Qiskit: An Open-source Framework for Quantum Computing","author":"Quantum IBM","year":"2019","unstructured":"IBM Quantum. 2019. Qiskit: An Open-source Framework for Quantum Computing."},{"key":"e_1_3_2_58_2","article-title":"Approaching the theoretical limit in quantum gate decomposition","author":"Rakyta P\u00e9ter","year":"2021","unstructured":"P\u00e9ter Rakyta and Zolt\u00e1n Zimbor\u00e1s. 2021. Approaching the theoretical limit in quantum gate decomposition. arXiv:2109.06770. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2109.06770.","journal-title":"arXiv:2109.06770."},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.4508680"},{"key":"e_1_3_2_60_2","volume-title":"The Synthesis of Nearest Neighbour Compliant Quantum Circuits","author":"Rogers Leo","year":"2021","unstructured":"Leo Rogers. 2021. The Synthesis of Nearest Neighbour Compliant Quantum Circuits. Ph.D. Dissertation. Queen\u2019s University Belfast."},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","unstructured":"Neil J. Ross and Peter Selinger. 2016. Optimal ancilla-free Clifford + T approximation of z-rotations. Quantum Information & Computation 16 11\u201312 (2016) 901\u2013953.","DOI":"10.26421\/QIC16.11-12-1"},{"key":"e_1_3_2_62_2","unstructured":"P. Sarnak. 2015. Letter to Scott Aaronson and Andy Pollington on the Solovay-Kitaev Theorem and Golden Gates."},{"key":"e_1_3_2_63_2","doi-asserted-by":"crossref","unstructured":"Peter Selinger. 2015. Generators and relations for n-qubit Clifford operators. Logical Methods in Computer Science 11 (2015).","DOI":"10.2168\/LMCS-11(2:10)2015"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855930"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.5555\/2011791.2011799"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681250"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"e_1_3_2_69_2","first-page":"1","volume-title":"Proceedings of the 2020 IEEE\/ACM International Conference On Computer Aided Design","author":"Tan Bochen","year":"2020","unstructured":"Bochen Tan and Jason Cong. 2020. Optimal layout synthesis for quantum computing. In Proceedings of the 2020 IEEE\/ACM International Conference On Computer Aided Design. IEEE, 1\u20139."},{"key":"e_1_3_2_70_2","first-page":"1","article-title":"Optimality study of existing quantum computing layout synthesis tools","author":"Tan B.","year":"2020","unstructured":"B. Tan and J. Cong. 2020. Optimality study of existing quantum computing layout synthesis tools. In Proceedings of theIEEE\/ACM International Conference On Computer Aided Design. (2020), 1\u20139.","journal-title":"Proceedings of theIEEE\/ACM International Conference On Computer Aided Design."},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.032315"},{"key":"e_1_3_2_72_2","article-title":"Optimization of CNOT circuits on topological superconducting processors","author":"Wu Bujiao","year":"2019","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. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/1910.14478.","journal-title":"arXiv:1910.14478."},{"key":"e_1_3_2_73_2","article-title":"QFAST: Quantum synthesis using a hierarchical continuous circuit space","author":"Younis Ed","year":"2020","unstructured":"Ed Younis, Koushik Sen, Katherine Yelick, and Costin Iancu. 2020. QFAST: Quantum synthesis using a hierarchical continuous circuit space. arXiv:2003.04462. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2003.04462.","journal-title":"arXiv:2003.04462."},{"key":"e_1_3_2_74_2","article-title":"QFAST: Conflating search and numerical optimization for scalable quantum circuit synthesis","author":"Younis Ed","year":"2021","unstructured":"Ed Younis, Koushik Sen, Katherine Yelick, and Costin Iancu. 2021. QFAST: Conflating search and numerical optimization for scalable quantum circuit synthesis. arXiv:2103.07093. Retrieved 11 November 2021 from https:\/\/arxiv.org\/abs\/2103.07093.","journal-title":"arXiv:2103.07093."},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.020502"},{"key":"e_1_3_2_76_2","unstructured":"A. Zulehner A. Paler and R. Wille. 2019. Retrieved 11 November 2021 from https:\/\/github.com\/iic-jku\/ibm_qx_mapping."},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287704"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3505181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3505181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:26Z","timestamp":1750188686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3505181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,4]]},"references-count":77,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3505181"],"URL":"https:\/\/doi.org\/10.1145\/3505181","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,4]]},"assertion":[{"value":"2021-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}