Improving Figures of Merit for Quantum Circuit Compilation
Patrick Hopf, Nils Quetschlich, Laura Schulz, Robert Wille

TL;DR
This paper investigates the correlation between traditional figures of merit and actual quantum circuit execution quality, revealing weaknesses and proposing a machine learning-based figure of merit that better predicts real performance.
Contribution
It introduces a novel machine learning-based figure of merit that more accurately predicts quantum circuit execution quality on real hardware.
Findings
Weak correlation between existing figures of merit and actual performance
Complex figures of merit do not necessarily improve prediction accuracy
The proposed machine learning approach achieves a 49% average correlation improvement
Abstract
Quantum computing is an emerging technology that has seen significant software and hardware improvements in recent years. Executing a quantum program requires the compilation of its quantum circuit for a target Quantum Processing Unit (QPU). Various methods for qubit mapping, gate synthesis, and optimization of quantum circuits have been proposed and implemented in compilers. These compilers try to generate a quantum circuit that leads to the best execution quality - a criterion that is usually approximated by figures of merit such as the number of (two-qubit) gates, the circuit depth, expected fidelity, or estimated success probability. However, it is often unclear how well these figures of merit represent the actual execution quality on a QPU. In this work, we investigate the correlation between established figures of merit and actual execution quality on real machines - revealing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
