Skip to content

Quantum Fidelity-per-Cost: A Metric for Evaluation of Quantum Computing Systems

Jul 2026 · arXiv.org · Vol abs/2607.28572 · 1 citation · 20 references
Physics Computer Science

TL;DR

The main empirical observation from this work is that cost-aware ranking can differ from purely fidelity-based evaluation of quantum computers, and that users may select different quantum computing backends when they consider price in their selection, as opposed to selection based on fidelity alone.

Abstract

Cloud-accessible quantum computing has made hardware comparison not only a physics benchmark but also a practical purchasing decision. Cost-aware comparison of quantum computers remains underexplored and is difficult to do under the heterogeneous billing models offered by various cloud-based quantum computing providers. This paper makes two main contributions to enable price-aware comparison of quantum computers. First, this work presents a cross-provider measurement study of quantum circuit execution fidelity spanning 14 cloud QPU access-path entries (12 distinct physical QPUs) across four cloud access paths: Amazon Web Services (AWS) cloud, IBM Quantum Runtime (IBM) cloud, IQM Resonance (IQM) cloud, and Oxford Quantum Circuits (OQC) cloud. Second, this work proposes and analyzes a cost-aware score, Quantum Fidelity-per-Cost (QFC), which combines Kullback--Leibler (KL) divergence from an ideal output distribution, shot count, and monetary cost into one possible metric under a documented billing model. The main empirical observation from this work is that cost-aware ranking can differ from purely fidelity-based evaluation of quantum computers, and that users may select different quantum computing backends when they consider price in their selection, as opposed to selection based on fidelity alone. This work shows that the ranking is stable under reweighting of the metric, and that a device's billing model, not its hardware, governs how its score scales with shot count. Reported QFC values change as new machines come online or as providers revise their prices.

View source

Similar papers

Preprint Sep 2026

Coherence Rather Than Error Rate Governs Privacy in Multi-Tenant Quantum Computing

Multi-tenant computing enables providers of commercial cloud quantum processors to rent disjoint sectors of a device to independent users. Average gate error, which cloud quantum computing providers report, does not determine how much one tenant learns about another. We propose an information-theoretic notion of inform...

Farhad Farokhi · 0 citations
Preprint Oct 2026

Compiling Together: High-Throughput Distributed Quantum Computing via Multi-Compilation

Quantum computing is a promising paradigm for problems that are challenging for classical machines, but realizing that promise requires far more qubits than a single processor can offer. Distributed quantum computing (DQC) scales out by connecting multiple quantum processing units (QPUs), at the cost of making entangle...

Yi-Pei Liu, Sen Zhang, Ze-Bo Yang et al. · 0 citations
Preprint Sep 2026

Benchmarking the computational power of quantum computers

This work demonstrates direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them, and project the growth of capability a...

Timothy Proctor, Oliver Hart, Oliver Widzowski Maupin et al. · 1 citation
#edge computing Open access Sep 2026

Hybrid VQA architectures for cloud-based quantum platforms: maximizing computational utility

These quantitative findings demonstrate that tightly coupled hybrid co-processing, physically adjacent to the control electronics, is critical for extending the computational bound of Noisy Intermediate-Scale Quantum (NISQ) devices.

Akshay Joseph, R. Delhibabu · 0 citations
#artificial intelligence Preprint Sep 2026

Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems

A low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network that estimates, before compilation, the expected fidelity of each circuit on each available QPU, and a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism.

Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto et al. · 0 citations
Preprint Oct 2026

Hybrid Classical-Quantum Solutions to Accelerate the Adoption of Quantum Computing

Despite the promise and potential of quantum computing, most of the current day developments of quantum computing have several limitations for relevant practical use. As a result, hybrid classical-quantum computing has emerged as a viable solution. This paper discusses the software aspects of hybrid classical-quantum c...

Advait Deshpande, Luciano Baresi, A. Bandara · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.