QEF: Reproducible and Exploratory Quantum Software Experiments

• URL: http://arxiv.org/abs/2511.04563v1
• Date: Thu, 06 Nov 2025 17:17:55 GMT
• Title: QEF: Reproducible and Exploratory Quantum Software Experiments
• Authors: Vincent Gierisch, Wolfgang Mauerer,
• Abstract summary: Quantum Experiment Framework (QEF) is designed to support the systematic, hypothesis-driven study of quantum algorithms.<n>QEF captures all key aspects of quantum software and algorithm experiments through a concise specification.<n>QEF supports parameter reuse to improve overall experiment runtimes.
• Score: 1.1683938179815823
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Commercially available Noisy Intermediate-Scale Quantum (NISQ) devices now make small hybrid quantum-classical experiments practical, but many tools hide configuration or demand ad-hoc scripting. We introduce the Quantum Experiment Framework (QEF): A lightweight framework designed to support the systematic, hypothesis-driven study of quantum algorithms. Unlike many existing approaches, QEF emphasises iterative, exploratory analysis of evolving experimental strategies rather than exhaustive empirical evaluation of fixed algorithms using predefined quality metrics. The framework's design is informed by a comprehensive review of the literature, identifying principal parameters and measurement practices currently reported in the field. QEF captures all key aspects of quantum software and algorithm experiments through a concise specification that expands into a Cartesian product of variants for controlled large-scale parameter sweeps. This design enables rigorous and systematic evaluation, as well as precise reproducibility. Large sweeps are automatically partitioned into asynchronous jobs across simulators or cloud hardware, and ascertain full hyper-parameter traceability. QEF supports parameter reuse to improve overall experiment runtimes, and collects all metrics and metadata into a form that can be conveniently explored with standard statistical and visualisation software. By combining reproducibility and scalability while avoiding the complexities of full workflow engines, QEF seeks to lower the practical barriers to empirical research on quantum algorithms, whether these are designed for current NISQ devices or future error-corrected quantum systems.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Quantum Search in Superposed Quantum Lattice Gas Automata and Lattice Boltzmann Systems [0.0]
  Quantum Lattice Gas Automata and Quantum Lattice Boltzmann Methods emerge as promising candidates for quantum-native implementations of CFD solvers.<n>We propose an application based on discrete optimization and quantum search, which circumvents flow field measurement altogether.
  arXiv  Detail & Related papers  (2025-10-15T20:04:06Z)
• Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA [0.2578242050187029]
  We present a hardware-maturity probe that quantifies a device's reliability.<n>We derive closed-form upper bounds on the number of stationary points in the p=1OA cost landscape for broad classes of verifiable-optimization problems.
  arXiv  Detail & Related papers  (2025-09-14T21:48:34Z)
• Benchmarking fault-tolerant quantum computing hardware via QLOPS [2.0464713282534848]
  To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels.<n>Various fault-tolerant quantum computing schemes have been developed for different hardware platforms.<n>We propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes.
  arXiv  Detail & Related papers  (2025-07-16T08:31:51Z)
• Context-Aware Unit Testing for Quantum Subroutines [14.117812847408523]
  Testing quantum software presents unique challenges due to the non-deterministic nature of quantum information, the high dimensionality of the underlying Hilbert space, complex hardware noise, and the inherent non-local properties of quantum systems.<n>We propose incorporating context-awareness into the testing process to address the computational complexity associated with unit testing in quantum systems.
  arXiv  Detail & Related papers  (2025-06-12T04:58:56Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Enhanced feature encoding and classification on distributed quantum hardware [0.0]
  We propose a novel feature map optimization strategy for Quantum Support Vector Machines (QSVMs)<n>We take into account backend-specific parameters, including qubit connectivity, native gate sets, and circuit depth, which are critical factors in noisy quantum devices.<n>The study was carried out by partitioning each quantum processing unit (QPU) into several sub-units with the same topology to implement individual QSVM instances.
  arXiv  Detail & Related papers  (2024-12-02T16:14:37Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.