Learning to rank quantum circuits for hardware-optimized performance enhancement
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 ibmq_guadalupe 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\times$ reduction in selection error when compared to the baseline approach and a $3.2\times$ 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.
- IBM, Ibm quantum.
- Rigetti, Rigetti computing.
- Amazon, Amazon braket.
- J. Emerson, R. Alicki, and K. Życzkowski, Scalable noise estimation with random unitary operators, Journal of Optics B: Quantum and Semiclassical Optics 7, S347 (2005).
- S. Niu, A. Todri-Sanial, and N. T. Bronn, Multi-qubit dynamical decoupling for enhanced crosstalk suppression (2024), arXiv:2403.05391 [quant-ph] .
- V. Zhang and P. D. Nation, Characterizing quantum processors using discrete time crystals, arXiv preprint arXiv:2301.07625 (2023).
- G. Acampora and R. Schiattarella, Deep neural networks for quantum circuit mapping, Neural Computing and Applications 33, 13723 (2021).
- Y. Mao, S. Shresthamali, and M. Kondo, Quantum circuit fidelity improvement with long short-term memory networks, arXiv preprint arXiv:2303.17523 (2023).
- T.-Y. Liu et al., Learning to rank for information retrieval, Foundations and Trends® in Information Retrieval 3, 225 (2009).
- A. Jüttner and P. Madarasi, Vf2++—an improved subgraph isomorphism algorithm, Discrete Applied Mathematics 242, 69 (2018).
- E. Bernstein and U. Vazirani, Quantum complexity theory, in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (1993) pp. 11–20.
- S. Bravyi and D. Maslov, Hadamard-free circuits expose the structure of the clifford group, IEEE Transactions on Information Theory 67, 4546 (2021).
- E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv preprint arXiv:1411.4028 (2014).
- P. D. Nation and M. Treinish, Suppressing quantum circuit errors due to system variability, PRX Quantum 4, 010327 (2023).
- D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, arXiv preprint arXiv:1412.6980 (2014).
- L. N. Smith and N. Topin, Super-convergence: Very fast training of neural networks using large learning rates, in Artificial intelligence and machine learning for multi-domain operations applications, Vol. 11006 (SPIE, 2019) pp. 369–386.
- R. L. Plackett, The analysis of permutations, Journal of the Royal Statistical Society Series C: Applied Statistics 24, 193 (1975).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.