Extending the Q-score to an Application-level Quantum Metric Framework

Abstract

Evaluating the performance of quantum devices is an important step towards scaling quantum devices and eventually using them in practice. The great number of available quantum metrics and the different hardware technologies used to develop quantum computers complicate this evaluation. In addition, different computational paradigms implement quantum operations in different ways. A prominent quantum metric is given by the Q-score metric of Atos. This metric was originally introduced as a standalone way to benchmark devices using the Max-Cut problem. In this work, we show that the Q-score defines a framework of quantum metrics, which allows benchmarking using different problems, user settings and solvers. To showcase the applicability of the framework, we showcase a second Q-score in this framework, called the Q-score Max-Clique. This yields, to our knowledge, the first application-level metric capable of natively comparing three different paradigms of quantum computing. This metric is evaluated on these computational quantum paradigms -- quantum annealing, gate-based quantum computing, and photonic quantum computing -- and the results are compared to those obtained by classical solvers.

11 pages, 5 figures

References in corpus (19)

• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• The Variational Quantum Eigensolver: a review of methods and best practices
• Fluxonium: single Cooper pair circuit free of charge offsets
• Coherent Josephson qubit suitable for scalable quantum integrated circuits
• Validating quantum computers using randomized model circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Scalable Noise Estimation with Random Unitary Operators
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Molecular Docking with Gaussian Boson Sampling
• Using Gaussian Boson Sampling to Find Dense Subgraphs
• Life after charge noise: recent results with transmon qubits
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• Solving large Maximum Clique problems on a quantum annealer
• Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
• Evaluating the Q-score of Quantum Annealers
• Evaluating Three Levels of Quantum Metrics on Quantum-Inspire Hardware