{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T06:29:47Z","timestamp":1773037787738,"version":"3.50.1"},"reference-count":43,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits based on expected performance estimates derived from a training procedure conducted on real hardware. We apply our method to the problem of layout selection, in which abstracted qubits are assigned to physical qubits on a given device. Circuit measurements performed on IBM hardware indicate that the maximum and median fidelities of logically equivalent layouts can differ by an order of magnitude. We introduce a circuit score used for ranking that is parameterized in terms of a physics-based, phenomenological error model whose parameters are fit by training a ranking-loss function over a measured dataset. The dataset consists of quantum circuits exhibiting a diversity of structures and executed on IBM hardware, allowing the model to incorporate the contextual nature of real device noise and errors without the need to perform an exponentially costly tomographic protocol. We perform model training and execution on the 16-qubit i<\/mml:mi>b<\/mml:mi>m<\/mml:mi>q<\/mml:mi>&#x005F;<\/mml:mi>g<\/mml:mi>u<\/mml:mi>a<\/mml:mi>d<\/mml:mi>a<\/mml:mi>l<\/mml:mi>u<\/mml:mi>p<\/mml:mi>e<\/mml:mi><\/mml:math> device and compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our model consistently outperforms both approaches, predicting layouts that exhibit lower noise and higher performance. In particular, we find that our best model leads to a 1.8<\/mml:mn>&#x00D7;<\/mml:mo><\/mml:math> reduction in selection error when compared to the baseline approach and a 3.2<\/mml:mn>&#x00D7;<\/mml:mo><\/mml:math> reduction when compared to random selection. Beyond delivering a new form of predictive quantum characterization, verification, and validation, our results reveal the specific way in which context-dependent and coherent gate errors appear to dominate the divergence from performance estimates extrapolated from simple proxy measures.<\/jats:p>","DOI":"10.22331\/q-2024-11-27-1542","type":"journal-article","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T12:05:37Z","timestamp":1732709137000},"page":"1542","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":4,"title":["Learning to rank quantum circuits for hardware-optimized performance enhancement"],"prefix":"10.22331","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6814-1809","authenticated-orcid":false,"given":"Gavin S.","family":"Hartnett","sequence":"first","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3940-9886","authenticated-orcid":false,"given":"Aaron","family":"Barbosa","sequence":"additional","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3316-0724","authenticated-orcid":false,"given":"Pranav S.","family":"Mundada","sequence":"additional","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6464-9234","authenticated-orcid":false,"given":"Michael","family":"Hush","sequence":"additional","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4371-2580","authenticated-orcid":false,"given":"Michael J.","family":"Biercuk","sequence":"additional","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4631-8551","authenticated-orcid":false,"given":"Yuval","family":"Baum","sequence":"additional","affiliation":[{"name":"Q-CTRL, Sydney, NSW Australia, and Los Angeles, CA USA"}]}],"member":"9598","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"key":"0","unstructured":"IBM. ``Ibm quantum''."},{"key":"1","unstructured":"Rigetti. ``Rigetti computing''."},{"key":"2","unstructured":"Amazon. ``Amazon braket''."},{"key":"3","doi-asserted-by":"publisher","unstructured":"Joseph Emerson, Robert Alicki, and Karol \u017byczkowski. ``Scalable noise estimation with random unitary operators''. Journal of Optics B: Quantum and Semiclassical Optics 7, S347 (2005).","DOI":"10.1088\/1464-4266\/7\/10\/021"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Emanuel Knill, Dietrich Leibfried, Rolf Reichle, Joe Britton, R Brad Blakestad, John D Jost, Chris Langer, Roee Ozeri, Signe Seidelin, and David J Wineland. ``Randomized benchmarking of quantum gates''. Physical Review A 77, 012307 (2008).","DOI":"10.1103\/PhysRevA.77.012307"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven. ``Characterizing quantum supremacy in near-term devices''. Nature Physics 14, 595\u2013600 (2018).","DOI":"10.1038\/s41567-018-0124-x"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Charles Neill, Pedran Roushan, K Kechedzhi, Sergio Boixo, Sergei V Isakov, V Smelyanskiy, A Megrant, B Chiaro, A Dunsworth, K Arya, et al. ``A blueprint for demonstrating quantum supremacy with superconducting qubits''. Science 360, 195\u2013199 (2018).","DOI":"10.1126\/science.aao4309"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Timothy Proctor, Kenneth Rudinger, Kevin Young, Mohan Sarovar, and Robin Blume-Kohout. ``What randomized benchmarking actually measures''. Physical review letters 119, 130502 (2017).","DOI":"10.1103\/PhysRevLett.119.130502"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Timothy Proctor, Kenneth Rudinger, Kevin Young, Erik Nielsen, and Robin Blume-Kohout. ``Measuring the capabilities of quantum computers''. Nature Physics 18, 75\u201379 (2022).","DOI":"10.1038\/s41567-021-01409-7"},{"key":"9","doi-asserted-by":"publisher","unstructured":"S. Mavadia, C. L. Edmunds, C. Hempel, H. Ball, F. Roy, T. M. Stace, and M. J. Biercuk. ``Experimental quantum verification in the presence of temporally correlated noise''. npj Quantum Information 4, 7 (2018).","DOI":"10.1038\/s41534-017-0052-0"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Andre R. R. Carvalho, Harrison Ball, Michael J. Biercuk, Michael R. Hush, and Felix Thomsen. ``Error-robust quantum logic optimization using a cloud quantum computer interface''. Phys. Rev. Appl. 15, 064054 (2021).","DOI":"10.1103\/PhysRevApplied.15.064054"},{"key":"11","doi-asserted-by":"publisher","unstructured":"C. L. Edmunds, C. Hempel, R. J. Harris, V. Frey, T. M. Stace, and M. J. Biercuk. ``Dynamically corrected gates suppressing spatiotemporal error correlations as measured by randomized benchmarking''. Phys. Rev. Res. 2, 013156 (2020).","DOI":"10.1103\/PhysRevResearch.2.013156"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Jaseung Ku, Xuexin Xu, Markus Brink, David C. McKay, Jared B. Hertzberg, Mohammad H. Ansari, and B. L. T. Plourde. ``Suppression of unwanted $zz$ interactions in a hybrid two-qubit system''. Phys. Rev. Lett. 125, 200504 (2020).","DOI":"10.1103\/PhysRevLett.125.200504"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Pranav S Mundada, Aaron Barbosa, Smarak Maity, Yulun Wang, Thomas Merkh, TM Stace, Felicity Nielson, Andre RR Carvalho, Michael Hush, Michael J Biercuk, et al. ``Experimental benchmarking of an automated deterministic error-suppression workflow for quantum algorithms''. Physical Review Applied 20, 024034 (2023).","DOI":"10.1103\/PhysRevApplied.20.024034"},{"key":"14","unstructured":"Siyuan Niu, Aida Todri-Sanial, and Nicholas T. Bronn. ``Multi-qubit dynamical decoupling for enhanced crosstalk suppression'' (2024). arXiv:2403.05391."},{"key":"15","doi-asserted-by":"publisher","unstructured":"Harrison Ball, Thomas M. Stace, Steven T. Flammia, and Michael J. Biercuk. ``Effect of noise correlations on randomized benchmarking''. Phys. Rev. A 93, 022303 (2016).","DOI":"10.1103\/PhysRevA.93.022303"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Timothy Proctor, Stefan Seritan, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young. ``Scalable randomized benchmarking of quantum computers using mirror circuits''. Physical Review Letters 129, 150502 (2022).","DOI":"10.1103\/PhysRevLett.129.150502"},{"key":"17","unstructured":"Victoria Zhang and Paul D Nation. ``Characterizing quantum processors using discrete time crystals'' (2023). arXiv:2301.07625."},{"key":"18","doi-asserted-by":"publisher","unstructured":"Giovanni Acampora and Roberto Schiattarella. ``Deep neural networks for quantum circuit mapping''. Neural Computing and Applications 33, 13723\u201313743 (2021).","DOI":"10.1007\/s00521-021-06009-3"},{"key":"19","unstructured":"Yikai Mao, Shaswot Shresthamali, and Masaaki Kondo. ``Quantum circuit fidelity improvement with long short-term memory networks'' (2023). arXiv:2303.17523."},{"key":"20","doi-asserted-by":"publisher","unstructured":"Daniel Hothem, Kevin Young, Tommie Catanach, and Timothy Proctor. ``Learning a quantum computer's capability''. IEEE Transactions on Quantum Engineering 5, 1\u201326 (2024).","DOI":"10.1109\/TQE.2024.3430215"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Daniel Hothem, Jordan Hines, Karthik Nataraj, Robin Blume-Kohout, and Timothy Proctor. `` Predictive Models from Quantum Computer Benchmarks ''. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE). Pages 709\u2013714. Los Alamitos, CA, USA (2023). IEEE Computer Society.","DOI":"10.1109\/QCE57702.2023.00086"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Evan Peters, Prasanth Shyamsundar, Andy CY Li, and Gabriel Perdue. ``Qubit assignment using time reversal''. PRX Quantum 3, 040333 (2022).","DOI":"10.1103\/PRXQuantum.3.040333"},{"key":"23","unstructured":"Daniel Silver, Tirthak Patel, and Devesh Tiwari. ``Qompose: A technique to select optimal algorithm-specific layout for neutral atom quantum architectures'' (2024). arXiv:2409.19820."},{"key":"24","doi-asserted-by":"publisher","unstructured":"Irfansha Shaik and Jaco van de Pol. ``Optimal layout synthesis for quantum circuits as classical planning''. In 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD). Pages 1\u20139. IEEE (2023).","DOI":"10.48550\/arXiv.2304.12014"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Tie-Yan Liu et al. ``Learning to rank for information retrieval''. Foundations and Trends\u00ae in Information Retrieval 3, 225\u2013331 (2009).","DOI":"10.1561\/1500000016"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Hang Li. ``A short introduction to learning to rank''. IEICE TRANSACTIONS on Information and Systems 94, 1854\u20131862 (2011).","DOI":"10.1587\/transinf.E94.D.1854"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. ``Learning to rank using gradient descent''. In Proceedings of the 22nd international conference on Machine learning. Pages 89\u201396. (2005).","DOI":"10.1145\/1102351.1102363"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. ``Learning to rank: from pairwise approach to listwise approach''. In Proceedings of the 24th international conference on Machine learning. Pages 129\u2013136. (2007).","DOI":"10.1145\/1273496.1273513"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. ``A (sub) graph isomorphism algorithm for matching large graphs''. IEEE transactions on pattern analysis and machine intelligence 26, 1367\u20131372 (2004).","DOI":"10.1109\/TPAMI.2004.75"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Alp\u00e1r J\u00fcttner and P\u00e9ter Madarasi. ``Vf2++\u2014an improved subgraph isomorphism algorithm''. Discrete Applied Mathematics 242, 69\u201381 (2018).","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Ethan Bernstein and Umesh Vazirani. ``Quantum complexity theory''. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. Pages 11\u201320. (1993).","DOI":"10.1137\/S0097539796300921"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Sergey Bravyi and Dmitri Maslov. ``Hadamard-free circuits expose the structure of the clifford group''. IEEE Transactions on Information Theory 67, 4546\u20134563 (2021).","DOI":"10.1109\/TIT.2021.3081415"},{"key":"33","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. ``A quantum approximate optimization algorithm'' (2014). arXiv:1411.4028."},{"key":"34","doi-asserted-by":"publisher","unstructured":"Paul D Nation and Matthew Treinish. ``Suppressing quantum circuit errors due to system variability''. PRX Quantum 4, 010327 (2023).","DOI":"10.1103\/PRXQuantum.4.010327"},{"key":"35","unstructured":"Diederik P Kingma and Jimmy Ba. ``Adam: A method for stochastic optimization'' (2014). arXiv:1412.6980."},{"key":"36","doi-asserted-by":"publisher","unstructured":"Leslie N Smith and Nicholay Topin. ``Super-convergence: Very fast training of neural networks using large learning rates''. In Artificial intelligence and machine learning for multi-domain operations applications. Volume 11006, pages 369\u2013386. SPIE (2019).","DOI":"10.1117\/12.2520589"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Thomas Lubinski, Sonika Johri, Paul Varosy, Jeremiah Coleman, Luning Zhao, Jason Necaise, Charles H Baldwin, Karl Mayer, and Timothy Proctor. ``Application-oriented performance benchmarks for quantum computing''. IEEE Transactions on Quantum Engineering (2023).","DOI":"10.1109\/TQE.2023.3253761"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Teague Tomesh, Pranav Gokhale, Victory Omole, Gokul Subramanian Ravi, Kaitlin N Smith, Joshua Viszlai, Xin-Chuan Wu, Nikos Hardavellas, Margaret R Martonosi, and Frederic T Chong. ``Supermarq: A scalable quantum benchmark suite''. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). Pages 587\u2013603. IEEE (2022).","DOI":"10.48550\/arXiv.2202.11045"},{"key":"39","doi-asserted-by":"publisher","unstructured":"G. Hartnett, A. Barbosa, P. S. Mundada, M. Hush, M. Biercuk, and Y. Baum. ``Learning to rank quantum circuits for hardware-optimized performance enhancement''. Zenodo (2024).","DOI":"10.5281\/zenodo.14037434"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Philip Krantz, Morten Kjaergaard, Fei Yan, Terry P Orlando, Simon Gustavsson, and William D Oliver. ``A quantum engineer's guide to superconducting qubits''. Applied physics reviews 6, 021318 (2019).","DOI":"10.1063\/1.5089550"},{"key":"41","doi-asserted-by":"publisher","unstructured":"Mathieu Blondel, Olivier Teboul, Quentin Berthet, and Josip Djolonga. ``Fast differentiable sorting and ranking''. In International Conference on Machine Learning. Pages 950\u2013959. PMLR (2020).","DOI":"10.48550\/arXiv.2002.08871"},{"key":"42","doi-asserted-by":"publisher","unstructured":"Robin L Plackett. ``The analysis of permutations''. Journal of the Royal Statistical Society Series C: Applied Statistics 24, 193\u2013202 (1975).","DOI":"10.2307\/2346567"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-11-27-1542\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T12:06:12Z","timestamp":1732709172000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-11-27-1542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,27]]},"references-count":43,"URL":"https:\/\/doi.org\/10.22331\/q-2024-11-27-1542","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,27]]},"article-number":"1542"}}