Pith. sign in

REVIEW 2 cited by

Learning to rank quantum circuits for hardware-optimized performance enhancement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.06535 v2 pith:F2YLJTEC submitted 2024-04-09 quant-ph cs.LG

classification quant-phcs.LG
keywords modelperformancequantumselectioncircuitsdevicehardwaremethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Breaking Memory Bottlenecks in Quantum Control Systems for More Precise Experiments and Higher Throughput Computing

    cs.AR 2026-08 conditional novelty 6.0 of 10

    Ant-Q pipelines quantum circuit loading, execution, and readout uplink on FPGA control boards using a DRAM plus BRAM hierarchy, supporting deep randomized benchmarking circuits and reducing classical overhead to near zero.

  2. Learning to Rank Tensor Network Contraction Plans for GPU-Accelerated Quantum Circuit Simulation

    cs.LG 2026-08 conditional novelty 6.0 of 10

    Learning-to-rank models trained on measured GPU runtimes can rank tensor-network contraction plans well enough to make Top-3 selection practical, but performance drops under circuit-family shift and is partly backend-...

Pith tools