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

Applied Sciences

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

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

Published Jun 24, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.3390/app16136346

Related papers

Modelos de metadatos para experimentos en circuitos cuánticos: un mapeo sistemático

Samuel Sepúlveda, Nawel Huenchuleo, Ania Cravero

Statistical reproducibility in Noisy Intermediate-Scale Quantum Computing (NISQ) is hindered by hardware variability and by the lack of metadata management practices able to capture calibration, compilation decisions, and data provenance. Although these elements are essential for experimental traceability, the evidence on how they are modeled and operationalized remains scattered. This paper characterizes the state of the art in metadata management for quantum software, focusing on gaps that constrain interoperability, auditability, and statistical reproducibility. We conducted a systematic mapping study that included 40 primary studies. The results reveal a fragmented landscape with limited adoption of formal standards. Existing approaches are mostly providerspecific, conceptually incomplete, or weakly integrated with compilation and execution workflows. Overall, current approaches remain insufficient to support auditable and reproducible quantum experimentation in NISQ environments.

JAIIO, Jornadas Argentinas de Informática•Oct 29, 2026•0 citations

From AI-Generated Circuits to Accountable Quantum Execution: A Hybrid Workflow Framework

Taylor Miss

Connecting AI-generated quantum programs to executable experiments requires more than syntactically valid code: the workflow must also control execution authority and preserve the basis for interpreting its results. This paper develops a conceptual architecture organized around three responsibilities: AI-assisted circuit proposal, deterministic classical validation, and quantum measurement execution. A quantum-job contract binds circuit artifacts, measurement settings, resource allocations, backend information, and provenance to explicit admission conditions. The design separates permission to run an experiment from evidence that its output answers the intended scientific question. An analytical single-qubit variational example demonstrates this distinction through exact energy calculations, finite-shot variance, and budget-constrained measurement allocation. Responsibility allocation, runtime interception, and staged transformation provide the architectural principles, while uncertainty reporting and reference calculations supply the scientific checks. A prospective evaluation protocol covers accuracy, policy violations, reproducibility, end-to-end cost, and researcher effort. The framework is presented as a design proposal supported by mathematical illustration, not as a tested implementation; its operational benefits and applicability to larger quantum workloads remain to be established.

•Sep 11, 2026•0 citations

Designing a Research Data Pipeline for Quantum Computing Experiments

Shreyas Sonwane

Quantum computing research generates large volumes of experimental data that require systematic storage, retrieval, and analysis. However, lightweight and accessible infrastructure for managing such data remains underexplored outside of large research institutions. This paper presents the design and implementation of a research data pipeline for quantum computing experiments. The system integrates a quantum circuit simulator, a REST API for data ingestion and retrieval, a structured metadata database, a statistical analysis module, and an automated PDF report generation system. The platform is containerized using Docker and validated through automated tests. The goal is to demonstrate how modern backend engineering tools can be applied to build reproducible and scalable research data infrastructure accessible to individual researchers and small teams.

•Mar 21, 2026•0 citations

Toward Quantum Runtime Governance: Execution Invariants and Governance Requirements for Quantum and Hybrid Quantum Systems

John Willis

Existing artificial intelligence governance and runtime execution governance frameworks were developed primarily within classical computing environments. While autonomous and agentic systems have introduced new governance challenges, most governance architectures continue to rely upon assumptions regarding deterministic execution, reproducibility, authorization validity, and auditability. Quantum and hybrid classical-quantum systems introduce execution characteristics that challenge these assumptions. Probabilistic measurement, circuit compilation and transpilation, hardware-dependent execution behavior, calibration drift, shot-based execution, hybrid computational workflows, and emerging distributed quantum architectures create governance obligations not fully addressed by existing execution-governance models. This paper proposes an extension of execution-layer governance into quantum environments through the introduction of Quantum Runtime Governance Invariants and corresponding Quantum Governance Requirements. The proposed invariants identify governance properties that must remain true regardless of implementation details, hardware platforms, programming models, or execution environments. These invariants are explicitly tied to governance properties including authorization integrity, admissibility integrity, provenance continuity, governance evidence integrity, replayability, governance continuity, and governance authority. The paper further introduces the concept of Probabilistic Admissibility, in which governance systems evaluate and authorize bounded outcome distributions rather than deterministic outcomes. Building upon this foundation, the paper derives a structured set of Quantum Governance Requirements spanning quantum resource governance, circuit governance, compilation governance, probabilistic outcome governance, shot governance, calibration governance, hybrid classical-quantum governance, quantum artificial intelligence governance, and distributed quantum governance. Finally, the paper examines the implications of these concepts for the Artificial Intelligence Governance Control Plane (AGCP), arguing that quantum systems do not require a fundamentally new governance architecture. Rather, they require an extension of existing execution-governance semantics capable of operating over probabilistic execution environments. The resulting framework establishes an initial foundation for AGCP-Quantum profiles, governance conformance assessment methodologies, registry assessment frameworks, governance assurance models, and future standards development activities.

•Jun 4, 2026•1 citation

A Semantic Framework for Reproducible Variational Quantum Algorithm Execution Records

Silvie Illésová, Martin Beseda

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.

quant-pharXiv:2607.03982•Jul 7, 2026•0 citations

Maximizing quantum hardware utilization via multiprogramming circuits and shot-wise distribution

Giuseppe Bisicchia, Jaime Alvarado‐Valiente, Javier Romero‐Álvarez +3 more

Context: Quantum computing is rapidly evolving, offering new opportunities for solving problems in optimization, cryptography, and simulation. However, the limited availability of quantum resources makes efficient utilization of quantum hardware a current challenge. Today’s paradigms often lead to under-utilization of qubits, increased costs, and execution delays, especially in the NISQ era. Objective: This work aims to improve the utilization of quantum hardware by introducing an execution model that integrates multiprogramming at circuit level with quantum shot-wise distribution in a single policy-driven pipeline. Methods: An architecture has been implemented that combines circuit scheduling and shot distribution techniques to aggregate multiple circuits and distribute their shots across heterogeneous QPUs. The approach was empirically validated on actual IBM Quantum devices using a diverse set of reference circuits. Results: The proposal achieved a reduction in cost of 95% and a reduction in tasks 92%. Moreover, the fidelity analysis of the results showed an increase in noise, with an average increase of approximately 20% using different statistical distances. Conclusions: This research provides a usable and extensible solution to increase the efficiency, cost effectiveness, and resilience of quantum workload execution in heterogeneous and dynamic cloud environments. These results obtained suggest that users should weigh the implications of fidelity versus cost (and time) savings based on the application requirements and their goals.

Information and Software Technology•Dec 20, 2025•1 citation
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.
Statistical reproducibility in Noisy Intermediate-Scale Quantum Computing (NISQ) is hindered by hardware variability and by the lack of metadata management practices able to capture calibration, compilation decisions, and data provenance. Although these elements are essential for experimental traceability, the evidence on how they are modeled and operationalized remains scattered. This paper characterizes the state of the art in metadata management for quantum software, focusing on gaps that constrain interoperability, auditability, and statistical reproducibility. We conducted a systematic mapping study that included 40 primary studies. The results reveal a fragmented landscape with limited adoption of formal standards. Existing approaches are mostly providerspecific, conceptually incomplete, or weakly integrated with compilation and execution workflows. Overall, current approaches remain insufficient to support auditable and reproducible quantum experimentation in NISQ environments.
Connecting AI-generated quantum programs to executable experiments requires more than syntactically valid code: the workflow must also control execution authority and preserve the basis for interpreting its results. This paper develops a conceptual architecture organized around three responsibilities: AI-assisted circuit proposal, deterministic classical validation, and quantum measurement execution. A quantum-job contract binds circuit artifacts, measurement settings, resource allocations, backend information, and provenance to explicit admission conditions. The design separates permission to run an experiment from evidence that its output answers the intended scientific question. An analytical single-qubit variational example demonstrates this distinction through exact energy calculations, finite-shot variance, and budget-constrained measurement allocation. Responsibility allocation, runtime interception, and staged transformation provide the architectural principles, while uncertainty reporting and reference calculations supply the scientific checks. A prospective evaluation protocol covers accuracy, policy violations, reproducibility, end-to-end cost, and researcher effort. The framework is presented as a design proposal supported by mathematical illustration, not as a tested implementation; its operational benefits and applicability to larger quantum workloads remain to be established.
Quantum computing research generates large volumes of experimental data that require systematic storage, retrieval, and analysis. However, lightweight and accessible infrastructure for managing such data remains underexplored outside of large research institutions. This paper presents the design and implementation of a research data pipeline for quantum computing experiments. The system integrates a quantum circuit simulator, a REST API for data ingestion and retrieval, a structured metadata database, a statistical analysis module, and an automated PDF report generation system. The platform is containerized using Docker and validated through automated tests. The goal is to demonstrate how modern backend engineering tools can be applied to build reproducible and scalable research data infrastructure accessible to individual researchers and small teams.
Existing artificial intelligence governance and runtime execution governance frameworks were developed primarily within classical computing environments. While autonomous and agentic systems have introduced new governance challenges, most governance architectures continue to rely upon assumptions regarding deterministic execution, reproducibility, authorization validity, and auditability. Quantum and hybrid classical-quantum systems introduce execution characteristics that challenge these assumptions. Probabilistic measurement, circuit compilation and transpilation, hardware-dependent execution behavior, calibration drift, shot-based execution, hybrid computational workflows, and emerging distributed quantum architectures create governance obligations not fully addressed by existing execution-governance models. This paper proposes an extension of execution-layer governance into quantum environments through the introduction of Quantum Runtime Governance Invariants and corresponding Quantum Governance Requirements. The proposed invariants identify governance properties that must remain true regardless of implementation details, hardware platforms, programming models, or execution environments. These invariants are explicitly tied to governance properties including authorization integrity, admissibility integrity, provenance continuity, governance evidence integrity, replayability, governance continuity, and governance authority. The paper further introduces the concept of Probabilistic Admissibility, in which governance systems evaluate and authorize bounded outcome distributions rather than deterministic outcomes. Building upon this foundation, the paper derives a structured set of Quantum Governance Requirements spanning quantum resource governance, circuit governance, compilation governance, probabilistic outcome governance, shot governance, calibration governance, hybrid classical-quantum governance, quantum artificial intelligence governance, and distributed quantum governance. Finally, the paper examines the implications of these concepts for the Artificial Intelligence Governance Control Plane (AGCP), arguing that quantum systems do not require a fundamentally new governance architecture. Rather, they require an extension of existing execution-governance semantics capable of operating over probabilistic execution environments. The resulting framework establishes an initial foundation for AGCP-Quantum profiles, governance conformance assessment methodologies, registry assessment frameworks, governance assurance models, and future standards development activities.
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.
Context: Quantum computing is rapidly evolving, offering new opportunities for solving problems in optimization, cryptography, and simulation. However, the limited availability of quantum resources makes efficient utilization of quantum hardware a current challenge. Today’s paradigms often lead to under-utilization of qubits, increased costs, and execution delays, especially in the NISQ era. Objective: This work aims to improve the utilization of quantum hardware by introducing an execution model that integrates multiprogramming at circuit level with quantum shot-wise distribution in a single policy-driven pipeline. Methods: An architecture has been implemented that combines circuit scheduling and shot distribution techniques to aggregate multiple circuits and distribute their shots across heterogeneous QPUs. The approach was empirically validated on actual IBM Quantum devices using a diverse set of reference circuits. Results: The proposal achieved a reduction in cost of 95% and a reduction in tasks 92%. Moreover, the fidelity analysis of the results showed an increase in noise, with an average increase of approximately 20% using different statistical distances. Conclusions: This research provides a usable and extensible solution to increase the efficiency, cost effectiveness, and resilience of quantum workload execution in heterogeneous and dynamic cloud environments. These results obtained suggest that users should weigh the implications of fidelity versus cost (and time) savings based on the application requirements and their goals.