{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T15:48:04Z","timestamp":1785858484846,"version":"3.56.0"},"reference-count":70,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T00:00:00Z","timestamp":1736812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council (ERC) under the European Union\u2019s Horizon 2020 research and innovation program","award":["101001318"],"award-info":[{"award-number":["101001318"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>\n            Fueled by recent accomplishments in quantum computing hardware and software, an increasing number of problems from various application domains are being explored as potential use cases for this new technology. Similarly to classical computing, realizing an application on a particular quantum device requires the corresponding (quantum) circuit to be\n            <jats:italic>compiled<\/jats:italic>\n            so that it can be executed on the device. With a steadily growing number of available devices\u2014each with their own advantages and disadvantages\u2014and a wide variety of different compilation tools, the number of choices to consider when trying to realize an application is quickly exploding. Due to missing tool support and automation, especially end-users who are not quantum computing experts are easily left unsupported and overwhelmed.\n          <\/jats:p>\n          <jats:p>\n            In this work, we propose a methodology that allows one to\n            <jats:italic>automatically select<\/jats:italic>\n            a suitable quantum device for a particular application\n            <jats:italic>and<\/jats:italic>\n            provides an\n            <jats:italic>optimized compiler<\/jats:italic>\n            for the selected device. The resulting framework\u2014called the\n            <jats:italic>MQT\u00a0Predictor<\/jats:italic>\n            \u2014not only supports end-users in navigating the vast landscape of choices, it also allows\n            <jats:italic>mixing and matching<\/jats:italic>\n            compiler passes from various tools to create optimized compilers that transcend the individual tools. Evaluations of an exemplary framework instantiation based on more than 500 quantum circuits and seven devices have shown that\u2014compared with both Qiskit\u2019s and TKET\u2019s most optimized compilation flows for all devices\u2014the MQT\u00a0Predictor produces circuits within the top-3 out of 14 baselines in more than 98% of cases while frequently outperforming any tested combination by up to 53% when optimizing for\n            <jats:italic>expected fidelity<\/jats:italic>\n            . Additionally, the framework is trained and evaluated for\n            <jats:italic>critical depth<\/jats:italic>\n            as another\n            <jats:italic>figure of merit<\/jats:italic>\n            to showcase its flexibility and generalizability\u2014producing circuits within the top-3 in 89% of cases while frequently outperforming any tested combination by up to 400%. MQT\u00a0Predictor is part of the\n            <jats:italic>Munich Quantum Toolkit<\/jats:italic>\n            \u00a0(MQT) and publicly available as open-source on GitHub (\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/cda-tum\/mqt-predictor\">https:\/\/github.com\/cda-tum\/mqt-predictor<\/jats:ext-link>\n            ) and as an easy-to-use\n            <jats:italic>Python<\/jats:italic>\n            package (\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/pypi.org\/p\/mqt.predictor\">https:\/\/pypi.org\/p\/mqt.predictor<\/jats:ext-link>\n            ).\n          <\/jats:p>\n          <jats:p\/>","DOI":"10.1145\/3673241","type":"journal-article","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T10:17:06Z","timestamp":1718619426000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4369-5207","authenticated-orcid":false,"given":"Nils","family":"Quetschlich","sequence":"first","affiliation":[{"name":"Chair for Design Automation, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4699-1316","authenticated-orcid":false,"given":"Lukas","family":"Burgholzer","sequence":"additional","affiliation":[{"name":"Chair for Design Automation, Technical University of Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-7860","authenticated-orcid":false,"given":"Robert","family":"Wille","sequence":"additional","affiliation":[{"name":"Chair for Design Automation, Technical University of Munich, Munich, Germany and Software Competence Center Hagenberg GmbH, Hagenberg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,1,14]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","unstructured":"A. Javadi-Abhari M. Treinish K. Krsulich C. J. Wood J. Lishman J. Gacon S. Martiel P. D. Nation L. S. Bishop A. W. Cross B. R. Johnson and J. M. Gambetta. 2024. Quantum computing with Qiskit. (2024). DOI:10.48550\/arXiv.2405.08810","DOI":"10.48550\/arXiv.2405.08810"},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","unstructured":"S. Sivarajah S. Dilkes A. Cowtan W. Simmons A. Edgington and R. Duncan. 2020. T|ket \\(\\gt\\) : A retargetable compiler for NISQ devices. Quantum Science and Technology (2020).","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","unstructured":"C. Developers. 2021. Cirq. (Aug.2021). DOI:10.5281\/zenodo.5182845See full list of authors on Github: Retrieved from https:\/\/github.com\/quantumlib\/Cirq\/graphs\/contributors.","DOI":"10.5281\/zenodo.5182845"},{"key":"e_1_3_3_5_2","unstructured":"V. Bergholm J. Izaac M. Schuld C. Gogolin M. S. Alam S. Ahmed J. M. Arrazola C. Blank A. Delgado S. Jahangiri K. McKiernan J. J. Meyer Z. Niu A. Sz\u00e1va and N. Killoran. 2020. PennyLane: Automatic Differentiation of Hybrid Quantum-Classical Computations. (2020). arXiv:1811.04968. Retrieved from https:\/\/arxiv.org\/abs\/1811.04968"},{"key":"e_1_3_3_6_2","unstructured":"R. S. Smith M. J. Curtis and W. J. Zeng. 2016. A Practical Quantum Instruction Set Architecture. (2016). arXiv:1608.03355. Retrieved from https:\/\/arxiv.org\/abs\/1608.03355"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-07-06-291"},{"key":"e_1_3_3_8_2","doi-asserted-by":"crossref","unstructured":"N. Quetschlich V. Koch L. Burgholzer and R. Wille. 2023. A hybrid classical quantum computing approach to the satellite mission planning problem. In Int\u2019l Conf. on Quantum Computing and Engineering (2023).","DOI":"10.1109\/QCE57702.2023.00079"},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","unstructured":"C. Zoufal A. Lucchi and S. Woerner. 2019. Quantum generative adversarial networks for learning and loading random distributions. npj Quantum Information (2019).","DOI":"10.1038\/s41534-019-0223-2"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"A. Peruzzo J. McClean P. Shadbolt M.-H. Yung X.-Q. Zhou P. J. Love A. Aspuru-Guzik and J. L. O\u2019Brien. 2014. A variational eigenvalue solver on a photonic quantum processor. Nature Communications 5 1 (2014) 4213. DOI:10.1038\/ncomms5213","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","unstructured":"N. Quetschlich L. Burgholzer and R. Wille. 2023. Towards an automated framework for realizing quantum computing solutions. DOI:10.1109\/ISMVL57333.2023.00035","DOI":"10.1109\/ISMVL57333.2023.00035"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3168822"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"N. Quetschlich L. Burgholzer and R. Wille. 2023. Predicting good quantum circuit compilation options. In Int\u2019l Conf. on Quantum Software (2023).","DOI":"10.1109\/QSW59989.2023.00015"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","unstructured":"N. Quetschlich L. Burgholzer and R. Wille. 2023. Compiler optimization for quantum computing using reinforcement learning. In Design Automation Conf. (2023).","DOI":"10.1109\/DAC56929.2023.10248002"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"R. Wille L. Berent T. Forster J. Kunasaikaran K. Mato T. Peham N. Quetschlich D. Rovara A. Sander L. Schmid D. Schoenberger Y. Stade and L. Burgholzer. 2024. The MQT Handbook: A summary of design automation tools and software for quantum computing. arXiv:2405.17543. Retrieved from https:\/\/arxiv.org\/abs\/2405.17543","DOI":"10.1109\/QSW62656.2024.00013"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","unstructured":"T. Peham N. Brandl R. Kueng R. Wille and L. Burgholzer. 2023. Depth-optimal synthesis of Clifford circuits with SAT solvers. DOI:10.48550\/arXiv.2305.01674","DOI":"10.48550\/arXiv.2305.01674"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","unstructured":"B. Giles and P. Selinger. 2013. Exact synthesis of multiqubit Clifford+T circuits. Physical Review A 87 3 (2013) 032332. DOI:10.1103\/PhysRevA.87.032332","DOI":"10.1103\/PhysRevA.87.032332"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","unstructured":"M. Amy D. Maslov M. Mosca and M. Roetteler. 2013. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 32 6 (2013) 818\u2013830. DOI:10.1109\/TCAD.2013.2244643","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","unstructured":"D. M. Miller R. Wille and Z. Sasanian. 2011. Elementary quantum gate realizations for multiple-control Toffoli gates. In Int\u2019l Symp. on Multi-Valued Logic. DOI:10.1109\/ISMVL.2011.54","DOI":"10.1109\/ISMVL.2011.54"},{"key":"e_1_3_3_20_2","unstructured":"A. Zulehner and R. Wille. 2018. One-pass design of reversible circuits: Combining embedding and synthesis for reversible logic. IEEE Trans. on CAD of Integrated Circuits and Systems 37 5 (2018) 996\u20131008."},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"P. Niemann R. Wille and R. Drechsler. 2020. Advanced exact synthesis of clifford+T circuits. Quantum Information Processing (2020).","DOI":"10.1007\/s11128-020-02816-0"},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"A. Zulehner A. Paler and R. Wille. 2019. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. on CAD of Integrated Circuits and Systems (2019).","DOI":"10.23919\/DATE.2018.8342181"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"A. Matsuo and S. Yamashita. 2019. An efficient method for quantum circuit placement problem on a 2-D grid. In Int\u2019l Conf. of Reversible Computation (2019) 162\u2013168.","DOI":"10.1007\/978-3-030-21500-2_10"},{"key":"e_1_3_3_24_2","doi-asserted-by":"crossref","unstructured":"R. Wille L. Burgholzer and A. Zulehner. 2019. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In Design Automation Conf. (2019).","DOI":"10.1145\/3316781.3317859"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","unstructured":"G. Li Y. Ding and Y. Xie. 2019. Tackling the qubit mapping problem for NISQ-era quantum devices. In Int\u2019l Conf. on Architectural Support for Programming Languages and Operating Systems (2019).","DOI":"10.1145\/3297858.3304023"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","unstructured":"T. Peham L. Burgholzer and R. Wille. 2023. On optimal subarchitectures for quantum circuit mapping. ACM Transactions on Quantum Computing (2023).","DOI":"10.1145\/3593594"},{"key":"e_1_3_3_27_2","doi-asserted-by":"crossref","unstructured":"S. Hillmich A. Zulehner and R. Wille. 2021. Exploiting quantum teleportation in quantum circuit mapping. In Asia and South Pacific Design Automation Conf. (2021).","DOI":"10.1145\/3394885.3431604"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","unstructured":"A. Zulehner and R. Wille. 2019. Compiling SU(4) quantum circuits to IBM QX architectures. In Asia and South Pacific Design Automation Conf. (2019) 185\u2013190. DOI:10.1145\/3287624.3287704","DOI":"10.1145\/3287624.3287704"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","unstructured":"R. Wille and L. Burgholzer. 2023. MQT QMAP: Efficient quantum circuit mapping. In Int\u2019l Symp. on Physical Design (2023). DOI:10.1145\/3569052.3578928","DOI":"10.1145\/3569052.3578928"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","unstructured":"L. Schmid S. Park and R. Wille. 2024. Hybrid circuit mapping: Leveraging the full spectrum of computational capabilities of neutral atom quantum computers. In Design Automation Conf. (2024).","DOI":"10.1145\/3649329.3655959"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","unstructured":"W. Hattori and S. Yamashita. 2018. Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures. In Int\u2019l Conf. of Reversible Computation (2018). 228\u2013243.","DOI":"10.1007\/978-3-319-99498-7_16"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","unstructured":"G. Vidal and C. M. Dawson. 2004. Universal quantum circuit for two-qubit transformations with three controlled-NOT gates. Physical Review A 69 1 (2004) 010301. DOI:10.1103\/PhysRevA.69.010301","DOI":"10.1103\/PhysRevA.69.010301"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","unstructured":"T. Itoko R. Raymond T. Imamichi A. Matsuo and A. W. Cross. 2019. Quantum circuit compilers using gate commutation rules. In Asia and South Pacific Design Automation Conf. (2019) 191\u2013196. DOI:10.1145\/3287624.3287701","DOI":"10.1145\/3287624.3287701"},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","unstructured":"D. Maslov G. W. Dueck D. M. Miller and C. Negrevergne. 2008. Quantum circuit simplification and level compaction. IEEE Trans. on CAD of Integrated Circuits and Systems 27 3 (2008) 436\u2013444.","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-87568-8_4"},{"key":"e_1_3_3_36_2","unstructured":"Y. Kharkov A. Ivanova E. Mikhantiev and A. Kotelnikov. 2022. Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers. (2022). arXiv:2202.14025. Retrieved from https:\/\/arxiv.org\/abs\/2202.14025"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","unstructured":"D. Mills S. Sivarajah T. L. Scholten and R. Duncan. 2021. Application-motivated holistic benchmarking of a full quantum computing stack. Quantum 5 (2021) 415. DOI:10.22331\/q-2021-03-22-415arxiv:2006.01273","DOI":"10.22331\/q-2021-03-22-415"},{"key":"e_1_3_3_38_2","unstructured":"T. Lubinski S. Johri P. Varosy J. Coleman L. Zhao J. Necaise C. H. Baldwin K. Mayer and T. Proctor. 2021. Application-Oriented Performance Benchmarks for Quantum Computing. (2021). arXiv:2110.03137. Retrieved from https:\/\/arxiv.org\/abs\/2110.03137"},{"key":"e_1_3_3_39_2","unstructured":"S. Dangwal G. S. Ravi L. M. Seifert and F. T. Chong. 2023. Clifford Assisted Optimal Pass Selection for Quantum Transpilation. (2023). arXiv:2306.15020. Retrieved from https:\/\/arxiv.org\/abs\/2306.15020"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64846-6_5"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18304-1_9"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.5220\/0011775300003488"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565271"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCS56647.2022.00013"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","unstructured":"T. F\u00f6sel M. Y. Niu F. Marquardt and L. Li. 2021. Quantum circuit optimization with deep reinforcement learning. (2021). DOI:10.48550\/ARXIV.2103.07585","DOI":"10.48550\/ARXIV.2103.07585"},{"key":"e_1_3_3_46_2","unstructured":"H. Wang P. Liu J. Cheng Z. Liang J. Gu Z. Li Y. Ding W. Jiang Y. Shi X. Qian D. Z. Pan F. T. Chong and S. Han. 2022. QuEest: Graph transformer for quantum circuit reliability estimation. (2022). arXiv:2210.16724. Retrieved from https:\/\/arxiv.org\/abs\/2210.16724"},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","unstructured":"S. van der Linde W. de Kok T. Bontekoe and S. Feld. 2023. qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation. (2023). arXiv:2308.02536. Retrieved from https:\/\/arxiv.org\/abs\/2308.02536","DOI":"10.1109\/QCE57702.2023.10179"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/FDL50818.2020.9232934"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3197978"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.37"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","unstructured":"M. Trofin Y. Qian E. Brevdo Z. Lin K. Choromanski and D. Li. 2021. MLGO: a Machine Learning Guided Compiler Optimizations Framework. (2021). DOI:10.48550\/ARXIV.2101.04808","DOI":"10.48550\/ARXIV.2101.04808"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","unstructured":"Q. Huang A. Haj-Ali W. Moses J. Xiang I. Stoica K. Asanovic and J. Wawrzynek. 2020. AutoPhase: Juggling HLS Phase Orderings in Random Forests with Deep Reinforcement Learning. (2020). DOI:10.48550\/ARXIV.2003.00671","DOI":"10.48550\/ARXIV.2003.00671"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","unstructured":"A. Haj-Ali N. K. Ahmed T. Willke S. Shao K. Asanovic and I. Stoica. 2019. NeuroVectorizer: End-to-End Vectorization with Deep Reinforcement Learning. (2019). DOI:10.48550\/ARXIV.1909.13639","DOI":"10.48550\/ARXIV.1909.13639"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","unstructured":"T. Tomesh P. Gokhale V. Omole G. S. Ravi K. N. Smith J. Viszlai X.-C. Wu N. Hardavellas M. R. Martonosi and F. T. Chong. 2022. SupermarQ: A Scalable Quantum Benchmark Suite. (2022). DOI:10.48550\/ARXIV.2202.11045","DOI":"10.48550\/ARXIV.2202.11045"},{"issue":"5","key":"e_1_3_3_56_2","first-page":"679","article-title":"A markovian decision process","volume":"6","author":"Bellman R.","year":"1957","unstructured":"R. Bellman. 1957. A markovian decision process. Journal of Mathematics and Mechanics 6, 5 (1957), 679\u2013684.","journal-title":"Journal of Mathematics and Mechanics"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","unstructured":"I. H. Sarker. 2021. Machine learning: Algorithms real-world applications and research directions. SN Computer Science 2 3 (2021) 160. DOI:10.1007\/s42979-021-00592-x","DOI":"10.1007\/s42979-021-00592-x"},{"key":"e_1_3_3_58_2","unstructured":"G. Brockman V. Cheung L. Pettersson J. Schneider J. Schulman J. Tang and W. Zaremba. 2016. OpenAI Gym. (2016). arXiv:1606.01540. Retrieved from https:\/\/arxiv.org\/abs\/1606.01540"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-07-20-1062"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","unstructured":"J. Schulman F. Wolski P. Dhariwal A. Radford and O. Klimov. 2017. Proximal Policy Optimization Algorithms. (2017). DOI:10.48550\/ARXIV.1707.06347","DOI":"10.48550\/ARXIV.1707.06347"},{"issue":"268","key":"e_1_3_3_61_2","first-page":"1","article-title":"Stable-baselines3: Reliable reinforcement learning implementations","volume":"22","author":"Raffin A.","year":"2021","unstructured":"A. Raffin, A. Hill, A. Gleave, A. Kanervisto, M. Ernestus, and N. Dormann. 2021. Stable-baselines3: Reliable reinforcement learning implementations. Journal of Machine Learning Research 22, 268 (2021), 1\u20138.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_3_65_2","volume-title":"Classification and Regression Trees","author":"Breiman L.","year":"1984","unstructured":"L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen. 1984. Classification and Regression Trees. Chapman and Hall\/CRC."},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_3_67_2","volume-title":"Neural networks: A comprehensive foundation","author":"Haykin S.","year":"1994","unstructured":"S. Haykin. 1994. Neural networks: A comprehensive foundation. Prentice Hall PTR."},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"issue":"1","key":"e_1_3_3_70_2","first-page":"3","article-title":"Supervised machine learning: A review of classification techniques","volume":"160","author":"Kotsiantis S. B.","year":"2007","unstructured":"S. B. Kotsiantis, I. Zaharakis, P. Pintelas, et\u00a0al. 2007. Supervised machine learning: A review of classification techniques. Emerging artificial Intelligence Applications in Computer Engineering 160, 1 (2007), 3\u201324.","journal-title":"Emerging artificial Intelligence Applications in Computer Engineering"},{"key":"e_1_3_3_71_2","unstructured":"A. W. Cross L. S. Bishop J. A. Smolin and J. M. Gambetta. 2017. Open Quantum Assembly Language. (2017). arXiv:1707.03429. Retrieved from https:\/\/arxiv.org\/abs\/1707.03429"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673241","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3673241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:40Z","timestamp":1750291420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,14]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3673241"],"URL":"https:\/\/doi.org\/10.1145\/3673241","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,14]]},"assertion":[{"value":"2023-10-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}