arXiv:2607.03982

A Semantic Framework for Reproducible Variational Quantum Algorithm Execution Records

Silvie Illésová, Martin Beseda

quant-phSubmitted Jul 4, 2026• Announced Jul 7, 2026• 0 citations

Abstract

Variational quantum algorithms are hybrid quantum-classical workflows whose results depend on many interacting choices, including the ansatz, Hamiltonian, optimizer, backend, shot count, noise model, mitigation method, random seed, stopping criteria, and software versions. In current practice, this information is often scattered across code, configuration files, logs, backend metadata, and paper descriptions, making executions difficult to reproduce, compare, debug, and reuse. This paper proposes an ontology-supported framework for representing Variational Quantum Algorithm (VQA) execution records as structured and machine-readable software engineering artifacts. The framework defines a Web Ontology Language (OWL) ontology for modeling the main entities involved in VQA experimentation, including algorithms, circuits, ansatzes, Hamiltonians, optimizers, backends, noise models, mitigation techniques, execution steps, software environments, measurement outcomes, and results. It further combines the ontology with Shapes Constraint Language (SHACL) constraints for validating completeness and consistency, and SPARQL Protocol and RDF Query Language (SPARQL) competency queries for retrieving reproducibility-relevant information. We demonstrate the approach using Variational Quantum Eigensolver (VQE) execution records, including a valid record and intentionally incomplete or inconsistent examples. The results show that the framework can represent complete VQA execution contexts, detect missing or malformed metadata, and support query-based inspection of information needed for reproducible quantum software experimentation.

Related papers

An end-to-end workflow for executing a classically bootstrapped variational quantum algorithm on an academic quantum computer

Qingfeng Wang, Liudmila A. Zhukas, Qiang Miao +5 more

Academic quantum computing platforms often face unique challenges in executing quantum workloads due to fragmented software environments and limited engineering support. Unlike commercial ecosystems, academic devices typically evolve without full-stack integration in mind, making it difficult to run complex applications—such as variational quantum algorithms (VQA)—reliably and efficiently. Issues such as incompatible software layers and lack of automated job management significantly increase the overhead of theory-experiment collaboration. To address these challenges, we develop a modular, end-to-end workflow that decouples application-layer code from low-level hardware control, automates circuit submission and result collection, and supports fine-grained circuit-level job scheduling and recovery. The architecture employs a dual-end application programming interface (API) design, enabling robust operation across unstable or resource-constrained hardware backends. For practical use, the framework is lightweight and user-friendly, allowing rapid prototyping of full-stack workflows using basic Python tools. We validate this workflow on a high-fidelity trapped-ion quantum computer by demonstrating a variational quantum eigensolver (VQE) experiment with a classically bootstrapped ansatz initialization technique. The system successfully executed over 60,000 circuits across multiple molecular test cases with minimal human intervention, highlighting the framework’s effectiveness in enabling reproducible, resilient quantum experimentation in academic settings.

npj Unconventional ComputingJun 19, 20260 citations

Symmetry-Oriented Testing Framework for Variational Quantum Algorithms

Yamaguchi, Masaomi, Ishikawa, Fuyuki

Testing quantum software is challenging because quantum states cannot be directly inspected. Variational quantum algorithms (VQAs) are a particularly important target as they are among the most promising approaches for near-term noisy quantum hardware. Many testing methods rely on classically computed results, which conflicts with the regime where quantum advantage is expected. Although prior studies mitigate this oracle problem, the core difficulty remains that existing approaches do not verify whether the execution deviates from the intended problem or whether the obtained solution is physically plausible. We propose a symmetry-oriented testing framework for VQAs that addresses this gap by using operators commuting with the target Hamiltonian as test specifications. The framework provides two complementary diagnostics: a commutator-based health check that monitors whether each execution step during optimization remains consistent with the symmetry of the target Hamiltonian, and a variance-based acceptance check that assesses the converged solution by examining whether the state is an eigenstate of the symmetry operators. Both diagnostics derive from the problem structure and do not require the exact solution. We evaluate the framework on representative user- and system-side faults, across multiple target systems, and under injected noise. Results show that the two diagnostics detect faulty behavior, provide informative signals of solution quality, and remain useful under noisy execution.

arXiv:2610.29053Jan 1, 20260 citations

A framework to evaluate the performance of Variational Quantum Algorithms

Ernesto Mamedaliev, Vladyslav Libov, Albert Nieto-Morales +2 more

Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows.

quant-pharXiv:2601.18812Jan 22, 20260 citations

QSMEF — Computational Implementation and Reproducibility

María Cecilia Pezzini

QSMEF — Computational Implementation and Reproducibility QSMEF (Quantum Software Engineering Module Evaluation Framework) is a framework for evaluating the functional contributions of blocks in quantum circuits using coalition-based observable measurements and Shapley values, subject to explicitly declared technical, functional, and semantic applicability conditions. This archive provides the computational implementation and supporting research artifacts associated with the QSMEF journal manuscript. The package includes five quantum computing case studies: QAOA–MaxCut, TwoLocal–H₂, the SKW quantum walk, QPE–Shor, and graph partitioning (minimum bisection). These cases illustrate the applicability and limitations of functional attribution under different algorithmic configurations and declared semantic constraints. The archive contains Python source code, dependency specifications, automated regression tests, reference results, execution logs, and documentation. It also includes bibliographic records and analysis materials supporting the literature review of 32 selected studies in Quantum Software Engineering. QSMEF distinguishes technical validity, functional constraints, and executable semantic criteria. The framework verifies formalizable conditions across circuit coalitions, while recognizing that satisfying these conditions does not independently establish complete semantic comparability. The regression tests support computational consistency and reproducibility against previously recorded reference results. They do not constitute independent external validation of the framework or its scientific conclusions. This release is intended to support transparency, traceability, reproducibility, and further research on component-level functional evaluation in quantum software engineering.

Oct 20, 20260 citations

QC-MM: A Metadata and Schema Model for Traceable Quantum-Circuit Experiments

Nawel Huenchuleo, Samuel Sepúlveda, Alejandro Fernández

Context: Modern quantum-computing experimentation generates heterogeneous, context-dependent execution data whose scientific value depends on preserving calibration state, compilation decisions, and run outcomes in a traceable and repository-ready form. In the NISQ era, probabilistic outputs, time-varying hardware conditions, and opaque transpilation pipelines create a data-management problem that directly affects reproducibility, traceability, and long-term reuse of experimental records. Goal: This paper aims to address this gap by proposing a specialized metadata and schema model for managing quantum-circuit execution data as governed, machine-interpretable, and evolvable repository artifacts. Proposal: We propose QC-MM, a platform-agnostic metadata model for capturing, validating, and relating contextual evidence of quantum-circuit experiments. The model integrates time-indexed calibration binding, transpilation traceability, lightweight provenance links, validation rules, and controlled schema evolution through a JSON Schema specification. Results: The evaluation follows a multi-scenario protocol and shows that QC-MM captures dynamic calibration context in IBM Quantum Cloud, remains interoperable through a local SpinQ NMR device, and makes transpilation effects traceable through structured records. It also supports repeated-run statistical reporting and links compilation decisions to execution outcomes, including circuit-depth reductions and changes in an estimated fidelity proxy under different optimization settings. Conclusions: QC-MM provides a specialized data-modeling and schema-governance foundation for traceable quantum-experiment repositories. Beyond improving reproducibility-oriented reporting, the proposal contributes to metadata validation, controlled schema evolution, and repository-oriented management of contextual experimental data.

Applied SciencesJun 24, 20260 citations

QDSV: A Semantic Problem Representation and Multi-Backend Execution Framework for Quantum-Oriented Computation

Jaime Alexander Jimenez Lozano, Sebastian Jimenez Giraldo

Predicate-based computation over state spaces separates a problem specification from the backend that realizes it. Building on the model introduced in arXiv:2606.15027, this paper studies QDSV as a semantic, multi-backend execution framework for quantum-oriented computation. We describe how QDSV, QIntent, and Qruba connect declarative problem intent to a structured semantic representation, realize that representation under heterogeneous backend constraints, and report execution trace outputs that separate model-level semantic outputs from backend-specific observations. The framework supports execution modes that do not require the original problem to be authored as a circuit, while still allowing circuit-compatible artifacts when required. As a case study, we evaluate EEG ictal/interictal classification using prepared signal features from the Bonn and Delhi datasets. The study compares classical machine-learning references, a circuit-first variational quantum classifier baseline, QDSV simulator executions, and controlled IBM Quantum hardware runs. The paper does not claim general quantum advantage or superiority over classical machine learning. Its contribution is a semantic execution validation showing how a problem-first representation can remain stable across simulator and hardware realizations while retaining interpretable execution trace outputs.

arXiv:2606.19312Jun 17, 20260 citations