Benchmarking Quantum Software Testing with Scalable Quantum Programs
- URL: http://arxiv.org/abs/2607.02029v1
- Date: Thu, 02 Jul 2026 10:56:35 GMT
- Title: Benchmarking Quantum Software Testing with Scalable Quantum Programs
- Abstract summary: We present Qolumbina, a benchmark infrastructure for controlled QST experiments on scalable quantum programs.<n>Qlumbina curates 40 programs from open-source repositories, turns them into test-ready subjects.<n>We also propose QST-oriented criteria to characterize quantum programs along functionality, output behavior, development complexity, and quantum-specific execution complexity.
- Score: 9.3695909584334
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum software testing (QST) checks whether quantum programs behave according to their intended specifications. A key requirement for QST research is a benchmark that supports rigorous empirical evaluation on programs that are testable and better reflect current software development practices. However, existing studies heavily rely on small hard-coded or circuit-level benchmarks, while available quantum programs are scattered across repositories without clear selection criteria, which limits fair comparison and systematic reproducibility. To this end, we present Qolumbina, a benchmark infrastructure for controlled QST experiments on scalable quantum programs. Qolumbina curates 40 programs from open-source repositories, turns them into test-ready subjects through systematic selection, refactoring, specifications, test case examples, unit tests, and standardized interfaces. We also propose QST-oriented criteria to characterize quantum programs along functionality, output behavior, development complexity, and quantum-specific execution complexity. Using these criteria, our empirical study shows that Qolumbina covers diverse testing-relevant properties and supports scalability analysis beyond fixed-size circuit benchmarks. Through controlled experiments with two recent QST approaches, we demonstrate the feasibility of using Qolumbina for execution-cost and fault-detection studies, and highlight backend-dependent effects that can influence QST result interpretation.
Related papers
- QEF: Reproducible and Exploratory Quantum Software Experiments [1.1683938179815823]
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.
arXiv Detail & Related papers (2025-11-06T17:17:55Z) - On the Feasibility of Quantum Unit Testing [7.96685560797073]
This work presents a study on quantum-centric unit tests, comparing traditional statistical approaches with tests specifically designed for quantum circuits.<n>We investigate (a) each test's ability to detect subtle discrepancies between the expected and actual states of a quantum circuit, and (b) the number of measurements required to achieve high reliability.<n>The results demonstrate that quantum-centric tests provide clear advantages in terms of precision and efficiency, reducing both false positives and false negatives compared to statistical tests.
arXiv Detail & Related papers (2025-07-23T06:05:24Z) - 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) - Quantum Program Linting with LLMs: Emerging Results from a Comparative Study [5.062046608347911]
This study investigates the feasibility of employing Large Language Models (LLMs) to develop a novel linting technique for quantum software development.<n>We introduce LintQ-LLM, an LLM-based linting tool designed to detect quantum-specific problems comparable to those identified by LintQ.
arXiv Detail & Related papers (2025-04-07T15:51:31Z) - 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) - QuanTest: Entanglement-Guided Testing of Quantum Neural Network Systems [45.18451374144537]
Quantum Neural Network (QNN) combines the Deep Learning (DL) principle with the fundamental theory of quantum mechanics to achieve machine learning tasks with quantum acceleration.
QNN systems differ significantly from traditional quantum software and classical DL systems, posing critical challenges for QNN testing.
We propose QuanTest, a quantum entanglement-guided adversarial testing framework to uncover potential erroneous behaviors in QNN systems.
arXiv Detail & Related papers (2024-02-20T12:11:28Z) - 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) - Testing Multi-Subroutine Quantum Programs: From Unit Testing to Integration Testing [2.8611507672161265]
This paper addresses the specific testing requirements of multi-subroutine quantum programs.
We focus on testing criteria and techniques based on the whole testing process perspective.
We conduct comprehensive testing on typical quantum subroutines, including diverse mutants and randomized inputs.
arXiv Detail & Related papers (2023-06-30T05:31:56Z) - QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
Self-Attention Mechanism (SAM) is good at capturing the internal connections of features.
A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
arXiv Detail & Related papers (2022-07-14T12:22:51Z) - Quantum circuit architecture search on a superconducting processor [56.04169357427682]
Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry.
However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability.
We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
arXiv Detail & Related papers (2022-01-04T01:53:42Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
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.