As quantum computing (QC) matures towards practical applications, effective methods to evaluate quantum algorithms, circuits, and execution quality in quantum software are gaining more relevance. To apply such methods, a set of meaningful metrics must be defined, understood, calculated, and applied. In an effort to solve that problem, this paper categorizes quantum related metrics into pre-runtime (derived from the static analysis of circuits before execution) and post-runtime (derived from the analysis of execution results). It is worthwhile to mention that while popular quantum SDKs such as Qiskit, PennyLane, and Q\# offer some circuit characteristics, there is often a gap between these native capabilities and the broader set of insightful pre- and post-runtime metrics in the literature. This paper introduces$\boldsymbol{q}$Ward, a Python library developed to bridge this gap by offering an initial implementation for the Qiskit SDK. qWard provides a toolkit designed to compute and visualize key pre-runtime and post-runtime metrics, facilitating the analysis of quantum algorithms. To illustrate its application, an experiment using a bell state circuit is conducted, which includes different backend configurations within the simulator as well as its execution on the IBM “torino” quantum processor. It is important to note that the initial version of qWard is limited to the Qiskit SDK and the Qiskit AER simulator.
As quantum computing (QC) matures towards practical applications, effective methods to evaluate quantum algorithms, circuits, and execution quality in quantum software are gaining more relevance. To apply such methods, a set of meaningful metrics must be defined, understood, calculated, and applied. In an effort to solve that problem, this paper categorizes quantum related metrics into pre-runtime (derived from the static analysis of circuits before execution) and post-runtime (derived from the analysis of execution results). It is worthwhile to mention that while popular quantum SDKs such as Qiskit, PennyLane, and Q# offer some circuit characteristics, there is often a gap between these native capabilities and the broader set of insightful pre- and post-runtime metrics in the literature. This paper introducesqWard, a Python library developed to bridge this gap by offering an initial implementation for the Qiskit SDK. qWard provides a toolkit designed to compute and visualize key pre-runtime and post-runtime metrics, facilitating the analysis of quantum algorithms. To illustrate its application, an experiment using a bell state circuit is conducted, which includes different backend configurations within the simulator as well as its execution on the IBM “torino” quantum processor. It is important to note that the initial version of qWard is limited to the Qiskit SDK and the Qiskit AER simulator.
This bachelor thesis proposes a visualization system for qWard, a library for the measurement and display of metrics for quantum circuits, as a way to help developers and researchers to understand the characteristics of a specific quantum circuit's pre and post-runtime metrics. While qWard itself already has the capacity of capturing and showing metrics, this system makes our display of such metrics more immediately readable. This system intends to help the benchmarking process for different quantum algorithms when you vary factors such as noise, backend, or the design of the circuit itself, allowing for easier and faster benchmarking during development on quantum solutions.
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.
Reproducibility and comparability remain fundamental challenges in the empirical evaluation of Quantum Software Engineering (QSE) tools. These challenges arise from the intrinsic probabilistic behavior of quantum programs and the variability introduced by quantum hardware and simulator backends. While existing quantum benchmarks typically offer only static circuit definitions, they often leave researchers responsible for data generation and execution, hindering the creation of standardized and reproducible experiments. In this paper, we introduce QSimBench, a novel, open-source benchmark suite and accompanying Python library designed to address these limitations. QSimBench provides over 20 million precomputed shot-level execution traces:20,000measurements each, across14quantum algorithms, multiple circuit sizes (4−15qubits), and six Qiskit-based backends including both ideal and noise-injected simulations. Each configuration includes not only detailed measurement histories but also the original circuit in OpenQASM, the backend's noise model, and configuration metadata, ensuring full transparency and enabling in-depth analysis. QSimBench empowers researchers to conduct scalable, reproducible, and statistically rigorous evaluations of QSE tools, such as those for monitoring, orchestration, and statistical post-processing, without the need for expensive or difficult-to-reproduce quantum executions. The benchmark is distributed with a lightweight Python API that facilitates fast data retrieval, flexible sampling strategies, and seamless integration into experimental pipelines. QSimBench is publicly available, aiming to foster collaborative and reproducible research within the quantum software community.
QiliSDK is an open-source Python framework for designing and executing digital, analog, and hybrid quantum algorithms. Its modular structure unifies circuit-based and Hamiltonian-based workflows within a single API. It provides high-level abstractions for gates, circuits, Hamiltonians, and optimizers, while remaining fully backend-agnostic: seamlessly switch between CPU, GPU, or QPU execution. The SDK simplifies quantum development through expressive syntax for Pauli algebra, variational programs, and built-in tools for visualization, serialization, and result analysis.
Quantum computing is a rapidly emerging and promising field with the potential to transform various research domains including drug design, network technologies, and sustainable energy solutions. Due to the inherent complexity and divergence from classical computing, several major quantum computing libraries have been developed to implement quantum algorithms, namely IBM Qiskit, Amazon Braket, Cirq, PyQuil, and PennyLane. These libraries enable quantum simulations on classical computers and execution on corresponding quantum hardware, such as Qiskit programs on IBM quantum computers. Despite the variations among these platforms, the core concepts remain the same. One notable challenge is the absence of a Python-based quantum interpreter to connect these five frameworks, a gap that remains to be fully addressed. In response, our work introduces a tool called Qinterpreter, accessible through a user-friendly web interface, the Quantum Science Gateway QubitHub, which operates alongside Jupyter Notebooks. Built using the Python Object-Oriented Programming System, Qinterpreter unifies the five well-known quantum libraries into a single framework. Designed as an educational tool for students and researchers entering the quantum domain, Qinterpreter enables the straightforward development and execution of quantum circuits across such platforms. This work highlights the quantum programming versatility and accessibility of Qinterpreter and underscores our ultimate goal of pervading Quantum Computing through younger, less specialized, and diverse cultural and national communities.
Quantum software ecosystems provide increasingly capable tools for simulation and hardware execution, but differences in programming models, supported features, and backend capabilities can make it difficult to move and systematically compare the same quantum algorithm across execution environments. We introduce eigenkit, a provider-neutral quantum computing library that separates algorithm definition from backend execution through a common circuit representation and provider interface. The library currently supports 12 execution providers spanning simulators and quantum hardware, provides backend-independent gradient computation, and integrates with standard scientific-computing and machine-learning workflows through NumPy, PyTorch, and scikit-learn interfaces. We evaluate the practical relevance of this abstraction across both simulation and quantum hardware. Simulator performance varies substantially with circuit size, structure, batching, and application workload, showing that no single backend is consistently preferable. On quantum hardware, experiments on IBM Heron and IQM Emerald show that which processor is better suited to a given algorithm depends not only on hardware constraints, but also on how well the topology of the quantum algorithm matches the physical connectivity of the processor. These results demonstrate that backend portability is not only a software-design convenience, but can be important for both computational efficiency and quantum execution quality.