Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

About a criterion of successfully executing a circuit in the NISQ era: what wd ≪ 1/𝜖 eff really means

Marie Salm, Johanna Barzen, Frank Leymann, Benjamin Weder

Published Nov 13, 2020• 15 citations
Publisher

Abstract

To evaluate classical software, a huge variety of software metrics exists. Similar metrics of quantum algorithms especially in context of near-term quantum computers are only rudimentary investigated. Hereby, metrics are particularly important to be able to estimate what is already possible with current quantum computers. Thus, in this paper, we discuss existing quantum performance metrics and focus on a metric that determines whether a quantum circuit is successfully executable on a given gate-based quantum computer. Thereby, we give an overview of various factors that can affect an execution and present our plan to concretize and apply the metric.

DOI
10.1145/3412451.3428498

Related papers

The bitter truth about gate-based quantum algorithms in the NISQ era

Frank Leymann, Johanna Barzen

Abstract Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum (NISQ) device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the depth and width as well as to the noise of an implementation of a gate-based algorithm must be understood in order to assess whether an implementation will execute successfully on a given NISQ device. In this contribution, we discuss these factors and their impact on algorithm implementations. Especially, we will cover state preparation, oracle expansion, connectivity, circuit rewriting, and readout: these factors are very often ignored when presenting a gate-based algorithm but they are crucial when implementing such an algorithm on near-term quantum computers. Our contribution will help developers in charge of realizing gate-based algorithms on such machines in (i) achieving an executable implementation, and (ii) assessing the success of their implementation on a given machine.

arXiv:2006.02856•Quantum Science and Technology•Aug 12, 2020•251 citations

Implementation of Pre-Runtime Metrics to Predict Quantum Execution Success Rate: a Validation with Grover’s Algorithm

Juan Pablo Baldion Castillo

In the current era of noisy intermediate-scale quantum (NISQ) devices, hardware resources are limited and costly, making software validation a significant engineering challenge. This paper addresses the need for efficient evaluation methods by proposing a set of pre-runtime metrics to predict the success of quantum circuit execution without requiring physical execution. A total of 63 static metrics—categorized as Elemental, Structural, Behavioral, and Quantum-Specific—were implemented within the open-source qWard library and validated through an empirical study using Grover’s algorithm on IBM Quantum processors. The empirical analysis identified 27 statistically significant metrics (with ≤ 10−6) capable of anticipating performance degradation. Furthermore, the study reveals a counterintuitive relationship in which aggressive compiler optimization reduces the linear correlation between static metrics and physical outcomes, and identifies distinct operational zones—stable, chaotic, and death—that enable developers to optimize resource usage by anticipating circuit instability.

•Jan 21, 2026•0 citations

Quantum Gate Count Analysis

Omar Ghoniem, Hatem Elsayed, Hassan Soubra

In recent years, interest in quantum computers has grown significantly. While commercial quantum computers are not available yet, both private and public sector investment into developing quantum computers has developed considerably. One of the key challenges in quantum computing is optimizing the performance of the quantum hardware devices. Different factors can be put into consideration regarding this point, including the number of gates used by the processors to execute different quantum computations and operations. This paper focuses on developing quantum hardware metrics that can be used to measure the performance of a quantum processor in terms of number of quantum gates needed to execute different quantum algorithms. The proposed metrics have been implemented and experimental evaluations have been conducted on various IBM back-end Quantum Computers and using 4 different algorithms: a 5-Qubit entangled circuit algorithm, a 5-Qubit implementation of Grover’s quantum search algorithm, a 5-Qubit implementation of Simon’s quantum algorithm and the 7-Qubit implementation of Steane’s error correction quantum algorithm. In addition, quantitative data on the number of quantum gates used by quantum processors to execute the different quantum algorithms were gathered, which enabled the analysis of how the availability and compatibility of different gate sets affect the overall number of quantum gates needed in the execution of the different quantum algorithms.

International Conference on Intelligent Computing and Information Systems (ICICIS)•Nov 21, 2023•2 citations

Profiling quantum circuits for their efficient execution on single- and multi-core architectures

Medina Bandić, Pablo le Henaff, Anabel Ovide +8 more

Abstract Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep understanding of quantum circuit properties and their relationship to execution outcomes on quantum devices. Our study aims to perform for the first time a rigorous examination of quantum circuits by introducing graph theory-based metrics extracted from their qubit interaction graph and gate dependency graph (GDG) alongside conventional parameters describing the circuit itself. This methodology facilitates a comprehensive analysis and clustering of quantum circuits. Furthermore, it uncovers a connection between parameters rooted in both qubit interaction and GDGs, and the performance metrics for quantum circuit mapping, across a range of established quantum device and mapping configurations. Among the various device configurations, we particularly emphasize modular (i.e. multi-core) quantum computing architectures due to their high potential as a viable solution for quantum device scalability. This thorough analysis will help us to: i) identify key attributes of quantum circuits that affect the quantum circuit mapping performance metrics; ii) predict the performance on a specific chip for similar circuit structures; iii) determine preferable combinations of mapping techniques and hardware setups for specific circuits; and iv) define representative benchmark sets by clustering similarly structured circuits.

arXiv:2407.12640•Quantum Science and Technology•Dec 19, 2024•10 citations

Towards a Set of Metrics for Quantum Circuits Understandability

Luis A. Marcelo, José A. Cruz-Lemus, Mario Gerardo Piattini Velthuis

Quantum computing is the basis of a new revolution. Several quantum computers are already available and, with them, quantum programming languages, quantum software development kits and platforms, quantum error correction and optimization tools are proposed and presented continuously. In connection with this, disciplines such as the Quantum Software Engineering are appearing for applying the knowledge acquired through time in their corresponding classical relatives. Besides, measurement is well known as a key factor for assessing, and improving if needed, the quality of any model in terms of, for instance, its understandability. The easier to understand a model is, the easier to maintain, reuse, etc. In this work, we present the definition of a set of metrics for assessing the understandability of quantum circuits. Some examples of the calculation of the metrics are also presented. This is just the beginning of a more thorough process in which they will be empirically validated by the performance of empirical studies, especially experiments.

•Jan 1, 2021•0 citations

Comprehensive Review of Metrics and Measurements of Quantum Systems

Hassan Soubra, Hatem Elsayed, Yousef Elbrolosy +2 more

Quantum computing promises to offer significant computational advantages over classical computing, leveraging principles such as superposition and entanglement. This necessitates effective metrics and measurement techniques for evaluating quantum systems, aiding in their development and performance optimization. However, due to fundamental differences in computing paradigms and current immaturity of quantum software abstractions, classical software and hardware metrics may not directly apply to quantum computing, where the distinction between software and hardware can still be somewhat indiscernible compared to classical computing. This paper provides a comprehensive review of existing quantum software and hardware metrics in the scientific literature, highlighting key challenges in the field. Additionally, it investigates the application of Functional Size Measurement (FSM), based on the COSMIC ISO 19761 FSM Method, to measure quantum software. Three FSM approaches are analyzed by applying them to Shor’s and Grover’s algorithms, with measurement results compared to assess their effectiveness. A comparative analysis highlights the strengths and limitations of each approach, emphasizing the need for further refinement. The insights from this study contribute to the advancement of quantum metrics, especially software metrics and measurement, paving the way for the development of a unified and standardized approach to quantum software measurement and assessment.

Metrics•Jun 19, 2025•8 citations
To evaluate classical software, a huge variety of software metrics exists. Similar metrics of quantum algorithms especially in context of near-term quantum computers are only rudimentary investigated. Hereby, metrics are particularly important to be able to estimate what is already possible with current quantum computers. Thus, in this paper, we discuss existing quantum performance metrics and focus on a metric that determines whether a quantum circuit is successfully executable on a given gate-based quantum computer. Thereby, we give an overview of various factors that can affect an execution and present our plan to concretize and apply the metric.
Abstract Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum (NISQ) device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the depth and width as well as to the noise of an implementation of a gate-based algorithm must be understood in order to assess whether an implementation will execute successfully on a given NISQ device. In this contribution, we discuss these factors and their impact on algorithm implementations. Especially, we will cover state preparation, oracle expansion, connectivity, circuit rewriting, and readout: these factors are very often ignored when presenting a gate-based algorithm but they are crucial when implementing such an algorithm on near-term quantum computers. Our contribution will help developers in charge of realizing gate-based algorithms on such machines in (i) achieving an executable implementation, and (ii) assessing the success of their implementation on a given machine.
In the current era of noisy intermediate-scale quantum (NISQ) devices, hardware resources are limited and costly, making software validation a significant engineering challenge. This paper addresses the need for efficient evaluation methods by proposing a set of pre-runtime metrics to predict the success of quantum circuit execution without requiring physical execution. A total of 63 static metrics—categorized as Elemental, Structural, Behavioral, and Quantum-Specific—were implemented within the open-source qWard library and validated through an empirical study using Grover’s algorithm on IBM Quantum processors. The empirical analysis identified 27 statistically significant metrics (with ≤ 10−6) capable of anticipating performance degradation. Furthermore, the study reveals a counterintuitive relationship in which aggressive compiler optimization reduces the linear correlation between static metrics and physical outcomes, and identifies distinct operational zones—stable, chaotic, and death—that enable developers to optimize resource usage by anticipating circuit instability.
In recent years, interest in quantum computers has grown significantly. While commercial quantum computers are not available yet, both private and public sector investment into developing quantum computers has developed considerably. One of the key challenges in quantum computing is optimizing the performance of the quantum hardware devices. Different factors can be put into consideration regarding this point, including the number of gates used by the processors to execute different quantum computations and operations. This paper focuses on developing quantum hardware metrics that can be used to measure the performance of a quantum processor in terms of number of quantum gates needed to execute different quantum algorithms. The proposed metrics have been implemented and experimental evaluations have been conducted on various IBM back-end Quantum Computers and using 4 different algorithms: a 5-Qubit entangled circuit algorithm, a 5-Qubit implementation of Grover’s quantum search algorithm, a 5-Qubit implementation of Simon’s quantum algorithm and the 7-Qubit implementation of Steane’s error correction quantum algorithm. In addition, quantitative data on the number of quantum gates used by quantum processors to execute the different quantum algorithms were gathered, which enabled the analysis of how the availability and compatibility of different gate sets affect the overall number of quantum gates needed in the execution of the different quantum algorithms.
Abstract Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep understanding of quantum circuit properties and their relationship to execution outcomes on quantum devices. Our study aims to perform for the first time a rigorous examination of quantum circuits by introducing graph theory-based metrics extracted from their qubit interaction graph and gate dependency graph (GDG) alongside conventional parameters describing the circuit itself. This methodology facilitates a comprehensive analysis and clustering of quantum circuits. Furthermore, it uncovers a connection between parameters rooted in both qubit interaction and GDGs, and the performance metrics for quantum circuit mapping, across a range of established quantum device and mapping configurations. Among the various device configurations, we particularly emphasize modular (i.e. multi-core) quantum computing architectures due to their high potential as a viable solution for quantum device scalability. This thorough analysis will help us to: i) identify key attributes of quantum circuits that affect the quantum circuit mapping performance metrics; ii) predict the performance on a specific chip for similar circuit structures; iii) determine preferable combinations of mapping techniques and hardware setups for specific circuits; and iv) define representative benchmark sets by clustering similarly structured circuits.
Quantum computing is the basis of a new revolution. Several quantum computers are already available and, with them, quantum programming languages, quantum software development kits and platforms, quantum error correction and optimization tools are proposed and presented continuously. In connection with this, disciplines such as the Quantum Software Engineering are appearing for applying the knowledge acquired through time in their corresponding classical relatives. Besides, measurement is well known as a key factor for assessing, and improving if needed, the quality of any model in terms of, for instance, its understandability. The easier to understand a model is, the easier to maintain, reuse, etc. In this work, we present the definition of a set of metrics for assessing the understandability of quantum circuits. Some examples of the calculation of the metrics are also presented. This is just the beginning of a more thorough process in which they will be empirically validated by the performance of empirical studies, especially experiments.
Quantum computing promises to offer significant computational advantages over classical computing, leveraging principles such as superposition and entanglement. This necessitates effective metrics and measurement techniques for evaluating quantum systems, aiding in their development and performance optimization. However, due to fundamental differences in computing paradigms and current immaturity of quantum software abstractions, classical software and hardware metrics may not directly apply to quantum computing, where the distinction between software and hardware can still be somewhat indiscernible compared to classical computing. This paper provides a comprehensive review of existing quantum software and hardware metrics in the scientific literature, highlighting key challenges in the field. Additionally, it investigates the application of Functional Size Measurement (FSM), based on the COSMIC ISO 19761 FSM Method, to measure quantum software. Three FSM approaches are analyzed by applying them to Shor’s and Grover’s algorithms, with measurement results compared to assess their effectiveness. A comparative analysis highlights the strengths and limitations of each approach, emphasizing the need for further refinement. The insights from this study contribute to the advancement of quantum metrics, especially software metrics and measurement, paving the way for the development of a unified and standardized approach to quantum software measurement and assessment.