Skip to content
Preprint

CLOPS: Benchmarking System Speed at Utility Scale

Aug 2026 · 0 citations · 34 references
Physics

TL;DR

This work formalizes CLOPS_h (Circuit Layer Operations Per Second) as a holistic speed benchmark defined over layered, hardware-aware circuits, and shares its layer decomposition with scalable layer-fidelity (LF) quality benchmarks, enabling coherent interpretation of speed and quality without conflating the two.

Abstract

As quantum processors scale to hundreds of qubits, execution speed is a critical performance dimension alongside scale and quality. While substantial progress has been made in benchmarking circuit fidelity, existing speed metrics often fail to reflect the sustained, end-to-end throughput experienced by users running utility-scale workloads. This shortfall is especially pronounced for layered, parameterized circuits executed repeatedly within classical-quantum workflows, such as variational algorithms and error-mitigated simulations. In this work, we formalize CLOPS_h (Circuit Layer Operations Per Second) as a holistic speed benchmark defined over layered, hardware-aware circuits. CLOPS_h measures the sustained rate at which the system executes physical layers, parallel slices of qubit-disjoint two-qubit gates separated by synchronization barriers. Because each such layer is one time slice of an N-qubit circuit, this rate maps directly to the execution rate of layered $N$-qubit circuits, connecting CLOPS_h to published device capability claims, and to the device-level throughput ceiling we formalize as Max Circuits Per Second (MCPS). CLOPS_h is obtained under layer-fidelity operating conditions, binding the speed measurement to an independently verified quality envelope, and it shares its layer decomposition with scalable layer-fidelity (LF) quality benchmarks, enabling coherent interpretation of speed and quality without conflating the two.

View source

Similar papers

Preprint Aug 2026

ChainForge: Characterizing Embedding as the Bottleneck in Quantum Annealer Workloads

Quantum Annealers (QAs) are among the first commercially scaled quantum computing systems designed for large-scale optimization. Unlike digital systems that execute sequences of compiled instructions, QAs operate as analog single-instruction machines that directly evolve an Ising Hamiltonian toward low-energy solutions...

Kanishka Jayathilake, Cordelia Brumley, T. Smith et al. · 0 citations
Preprint Sep 2026

Parallel Circuit Execution for Scalable Quantum Computation

The results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase.

Avimita Chatterjee, W. M. Brown, Si-Yuan Niu et al. · 0 citations
Preprint Aug 2026

To Scale Up or To Scale Out: Evaluating Space-Time Costs of Compiled Logical Circuits on Modular Superconducting Quantum Processors

Modular integration has emerged as the main pathway for scaling superconducting quantum processing units (QPUs) beyond the constraints of fabrication yield and physical footprint. Currently, two primary strategies lead this effort. Mirroring the"Scaling Up"and"Scaling Out"approaches in GPU architectures and AI infrastr...

Nikiforos Paraskevopoulos, S. de Bone, Mick Christophersen et al. · 0 citations
Preprint Sep 2026

From NISQ to Fault-Tolerance: Applications and Algorithmic Benchmarks for Spin Qubits

This work shows that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA, and describes an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm...

F. Lohof, Florian Ginzel, Wolfgang Lechner · 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
Conference Sep 2026

Efficient Circuit Management and Scheduling in Multi-Node Quantum Systems with Dynamic Links

The realization of practical quantum advantage requires executing large-scale circuits that far exceed the qubit capacity of any single quantum processor. To address this, two primary scaling strategies have emerged: circuit cutting, which utilizes classical resources to decompose circuits into smaller fragments, and m...

Ze-Fan Du, Wen-Rui Zhang, Jake Gesseck et al. · 0 citations

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