{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:15:44Z","timestamp":1776784544658,"version":"3.51.2"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T00:00:00Z","timestamp":1677196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Google Faculty Research Awards"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"<jats:p>The quantum circuit layout (QCL) problem involves mapping out a quantum circuit such that the constraints of the device are satisfied. We introduce a quantum circuit mapping heuristic, QXX, and its machine learning version, QXX-MLP. The latter automatically infers the optimal QXX parameter values such that the laid out circuit has a reduced depth. In order to speed up circuit compilation, before laying the circuits out, we use a Gaussian function to estimate the depth of the compiled circuits. This Gaussian also informs the compiler about the circuit region that influences most the resulting circuit\u2019s depth. We present empiric evidence for the feasibility of learning the layout method using approximation. QXX and QXX-MLP open the path to feasible large-scale QCL methods.<\/jats:p>","DOI":"10.1145\/3565271","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T11:49:49Z","timestamp":1664365789000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Machine Learning Optimization of Quantum Circuit Layouts"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1536-8858","authenticated-orcid":false,"given":"Alexandru","family":"Paler","sequence":"first","affiliation":[{"name":"Aalto University, Finland, University of Texas at Dallas, USA and Transilvania University of Bra\u015fov, Romania, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7708-9619","authenticated-orcid":false,"given":"Lucian","family":"Sasu","sequence":"additional","affiliation":[{"name":"Transilvania University of Bra\u015fov, Bra\u015fov, Romania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9222-0163","authenticated-orcid":false,"given":"Adrian-C\u0103t\u0103lin","family":"Florea","sequence":"additional","affiliation":[{"name":"Transilvania University of Bra\u015fov, Bra\u015fov, Romania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6015-3151","authenticated-orcid":false,"given":"R\u0103zvan","family":"Andonie","sequence":"additional","affiliation":[{"name":"Central Washington University, USA and Transilvania University of Bra\u015fov, Romania, Ellensburg, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,24]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41965-019-00023-0"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2020.2.3868"},{"issue":"3","key":"e_1_3_3_4_2","doi-asserted-by":"crossref","first-page":"032308","DOI":"10.1103\/PhysRevA.100.032308","article-title":"Automated distribution of quantum circuits via hypergraph partitioning","volume":"100","author":"Andr\u00e9s-Mart\u00ednez Pablo","year":"2019","unstructured":"Pablo Andr\u00e9s-Mart\u00ednez and Chris Heunen. 2019. Automated distribution of quantum circuits via hypergraph partitioning. Physical Review A 100, 3 (2019), 032308.","journal-title":"Physical Review A"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000006"},{"key":"e_1_3_3_7_2","first-page":"2546","volume-title":"NIPS","author":"Bergstra James","year":"2011","unstructured":"James Bergstra, R\u00e9mi Bardenet, Yoshua Bengio, and Bal\u00e1zs K\u00e9gl. 2011. Algorithms for hyper-parameter optimization.. In NIPS, John Shawe-Taylor, Richard S. Zemel, Peter L. Bartlett, Fernando C. N. Pereira, and Kilian Q. Weinberger (Eds.). 2546\u20132554. http:\/\/dblp.uni-trier.de\/db\/conf\/nips\/nips2011.html."},{"key":"e_1_3_3_8_2","volume-title":"11th Annual Symposium on Combinatorial Search","author":"Botea Adi","year":"2018","unstructured":"Adi Botea, Akihiro Kishimoto, and Radu Marinescu. 2018. On the complexity of quantum circuit compilation. In 11th Annual Symposium on Combinatorial Search."},{"issue":"5","key":"e_1_3_3_9_2","doi-asserted-by":"crossref","first-page":"050502","DOI":"10.1103\/PhysRevLett.121.050502","article-title":"Quantum error correction with only two extra qubits","volume":"121","author":"Chao Rui","year":"2018","unstructured":"Rui Chao and Ben W. Reichardt. 2018. Quantum error correction with only two extra qubits. Physical Review Letters 121, 5 (2018), 050502.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_10_2","volume-title":"14th Conference on the Theory of Quantum Computation, Communication and Cryptography","author":"Childs Andrew M.","year":"2019","unstructured":"Andrew M. Childs, Eddie Schoute, and Cem M. Unsal. 2019. Circuit transformations for quantum architectures. In 14th Conference on the Theory of Quantum Computation, Communication and Cryptography."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-06-04-279"},{"issue":"3","key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"031027","DOI":"10.1103\/PhysRevX.8.031027","article-title":"Practical quantum error mitigation for near-future applications","volume":"8","author":"Endo Suguru","year":"2018","unstructured":"Suguru Endo, Simon C. Benjamin, and Ying Li. 2018. Practical quantum error mitigation for near-future applications. Physical Review X 8, 3 (2018), 031027.","journal-title":"Physical Review X"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2697065"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2019.2.3514"},{"issue":"0402196","key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.26421\/QIC4.4-1","article-title":"Implementation of Shor\u2019s algorithm on a linear nearest neighbour qubit array","volume":"4","author":"Fowler A. G.","year":"2004","unstructured":"A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg. 2004. Implementation of Shor\u2019s algorithm on a linear nearest neighbour qubit array. Quantum Information and Computation. 4, quant-ph\/0402196 (2004), 237\u2013251.","journal-title":"Quantum Information and Computation."},{"key":"e_1_3_3_16_2","series-title":"Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32","first-page":"I-754-I-762","author":"Hutter Frank","year":"2014","unstructured":"Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. 2014. An efficient approach for assessing hyperparameter importance. In Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32 (Beijing, China) (ICML\u201914). JMLR.org, I-754-I-762."},{"key":"e_1_3_3_17_2","article-title":"Classical optimizers for noisy intermediate-scale quantum devices","author":"Lavrijsen Wim","year":"2020","unstructured":"Wim Lavrijsen, Ana Tudor, Juliane M\u00fcller, Costin Iancu, and Wibe de Jong. 2020. Classical optimizers for noisy intermediate-scale quantum devices. arXiv preprint arXiv:2004.03004 (2020).","journal-title":"arXiv preprint arXiv:2004.03004"},{"key":"e_1_3_3_18_2","article-title":"QASMBench: A low-level QASM benchmark suite for NISQ evaluation and simulation","author":"Li Ang","year":"2020","unstructured":"Ang Li and Sriram Krishnamoorthy. 2020. QASMBench: A low-level QASM benchmark suite for NISQ evaluation and simulation. arXiv preprint arXiv:2005.13018 (2020).","journal-title":"arXiv preprint arXiv:2005.13018"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911334"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4"},{"key":"e_1_3_3_22_2","volume-title":"The Need for Biases in Learning Generalizations","author":"Mitchell Tom M.","year":"1980","unstructured":"Tom M. Mitchell. 1980. The Need for Biases in Learning Generalizations. Technical Report. Rutgers University, New Brunswick, NJ. http:\/\/dml.cs.byu.edu\/cgc\/docs\/mldm_tools\/Reading\/Need.%20for%20Bias.pdf."},{"key":"e_1_3_3_23_2","first-page":"1001","volume-title":"Proceedings of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Murali Prakash","year":"2020","unstructured":"Prakash Murali, David C. McKay, Margaret Martonosi, and Ali Javadi-Abhari. 2020. Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In Proceedings of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems. 1001\u20131016."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab79b1"},{"key":"e_1_3_3_25_2","article-title":"Extracting success from IBM\u2019s 20-qubit machines using error-aware compilation","author":"Nishio Shin","year":"2019","unstructured":"Shin Nishio, Yulu Pan, Takahiko Satoh, Hideharu Amano, and Rodney Van Meter. 2019. Extracting success from IBM\u2019s 20-qubit machines using error-aware compilation. arXiv preprint arXiv:1903.10963 (2019).","journal-title":"arXiv preprint arXiv:1903.10963"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-030-14082-3_18","volume-title":"International Workshop on Quantum Technology and Optimization Problems","author":"Paler Alexandru","year":"2019","unstructured":"Alexandru Paler. 2019. On the influence of initial qubit placement during NISQ circuit compilation. In International Workshop on Quantum Technology and Optimization Problems. Springer, 207\u2013217."},{"key":"e_1_3_3_27_2","article-title":"A Jordan-Wigner gadget that reduces T count by more than 6x for quantum chemistry applications","author":"Pallister Sam","year":"2020","unstructured":"Sam Pallister. 2020. A Jordan-Wigner gadget that reduces T count by more than 6x for quantum chemistry applications. arXiv preprint arXiv:2004.05117 (2020).","journal-title":"arXiv preprint arXiv:2004.05117"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_3_29_2","article-title":"Using reinforcement learning to perform qubit routing in quantum compilers","author":"Pozzi Matteo G.","year":"2020","unstructured":"Matteo G. Pozzi, Steven J. Herbert, Akash Sengupta, and Robert D. Mullins. 2020. Using reinforcement learning to perform qubit routing in quantum compilers. arXiv preprint arXiv:2007.15957 (2020).","journal-title":"arXiv preprint arXiv:2007.15957"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431220"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3360546"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3168822"},{"key":"e_1_3_3_34_2","article-title":"t| ket>: A retargetable compiler for NISQ devices","author":"Sivarajah Seyon","year":"2020","unstructured":"Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan. 2020. t| ket>: A retargetable compiler for NISQ devices. Quantum Science and Technology (2020).","journal-title":"Quantum Science and Technology"},{"key":"e_1_3_3_35_2","first-page":"1","volume-title":"2020 IEEE\/ACM International Conference on Computer Aided Design (ICCAD\u201920)","author":"Tan Bochen","year":"2020","unstructured":"Bochen Tan and Jason Cong. 2020. Optimal layout synthesis for quantum computing. In 2020 IEEE\/ACM International Conference on Computer Aided Design (ICCAD\u201920). IEEE, 1\u20139."},{"key":"e_1_3_3_36_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. IEEE Transactions on Computers early access (2020), 1\u20131.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_3_37_2","first-page":"987","volume-title":"Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems","author":"Tannu Swamit S.","year":"2019","unstructured":"Swamit S. Tannu and Moinuddin K. Qureshi. 2019. Not all qubits are created equal: A case for variability-aware policies for NISQ-era quantum computers. In Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems. 987\u2013999."},{"key":"e_1_3_3_38_2","article-title":"Just-in-time quantum circuit transpilation reduces noise","author":"Wilson Ellis","year":"2020","unstructured":"Ellis Wilson, Sudhakar Singh, and Frank Mueller. 2020. Just-in-time quantum circuit transpilation reduces noise. arXiv preprint arXiv:2005.12820 (2020).","journal-title":"arXiv preprint arXiv:2005.12820"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446706"},{"issue":"17","key":"e_1_3_3_41_2","doi-asserted-by":"crossref","first-page":"170501","DOI":"10.1103\/PhysRevLett.125.170501","article-title":"Topological quantum compiling with reinforcement learning","volume":"125","author":"Zhang Yuan-Hang","year":"2020","unstructured":"Yuan-Hang Zhang, Pei-Lin Zheng, Yi Zhang, and Dong-Ling Deng. 2020. Topological quantum compiling with reinforcement learning. Physical Review Letters 125, 17 (2020), 170501.","journal-title":"Physical Review Letters"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,24]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,30]]}},"alternative-id":["10.1145\/3565271"],"URL":"https:\/\/doi.org\/10.1145\/3565271","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,24]]},"assertion":[{"value":"2021-11-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}