NovaQ: Improving Quantum Program Testing through Diversity-Guided Test Case Generation

• URL: http://arxiv.org/abs/2509.04763v1
• Date: Fri, 05 Sep 2025 02:45:00 GMT
• Title: NovaQ: Improving Quantum Program Testing through Diversity-Guided Test Case Generation
• Abstract summary: We introduce NovaQ, a diversity-guided testing framework for quantum programs.<n>We evaluate NovaQ on quantum programs of varying sizes and complexities.
• Score: 5.86175243785015
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum programs are designed to run on quantum computers, leveraging quantum circuits to solve problems that are intractable for classical machines. As quantum computing advances, ensuring the reliability of quantum programs has become increasingly important. This paper introduces NovaQ, a diversity-guided testing framework for quantum programs. NovaQ combines a distribution-based test case generator with a novelty-driven evaluation module. The generator produces diverse quantum state inputs by mutating circuit parameters, while the evaluator quantifies behavioral novelty based on internal circuit state metrics, including magnitude, phase, and entanglement. By selecting inputs that map to infrequently covered regions in the metric space, NovaQ effectively explores under-tested program behaviors. We evaluate NovaQ on quantum programs of varying sizes and complexities. Experimental results show that NovaQ consistently achieves higher test input diversity and detects more bugs than existing baseline approaches.

Related papers

• 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 [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• 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)
• QCRMut: Quantum Circuit Random Mutant generator tool [0.0]
  Quantum computing has been on the rise in recent years, evidenced by a surge in publications on quantum software engineering and testing. As this technology edges closer to practical application, ensuring the efficacy of our software becomes imperative. We introduce QCRMut, a mutation tool tailored for quantum programs, leveraging the inherent Quantum Circuit structure.
  arXiv  Detail & Related papers  (2024-10-02T10:54:00Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Quantum Concolic Testing [5.3611583388647635]
  This paper presents the first concolic testing framework explicitly designed for quantum programs.<n>We generate path constraints for each concrete execution path of a quantum program, with a quantum constraint solver determining outcomes to create novel input samples.<n>Our framework has been implemented in Python and integrated with Qiskit for practical evaluation.
  arXiv  Detail & Related papers  (2024-05-08T07:32:19Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• The QUATRO Application Suite: Quantum Computing for Models of Human Cognition [49.038807589598285]
  We unlock a new class of applications ripe for quantum computing research -- computational cognitive modeling. We release QUATRO, a collection of quantum computing applications from cognitive models.
  arXiv  Detail & Related papers  (2023-09-01T17:34:53Z)
• 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)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Swap Test-based Characterization of Quantum Processes in Universal Quantum Computers [0.0]
  Unreliable quantum processes in universal quantum computers still represent one of the the greatest challenges to be overcome. In this article we verify whether a tool called Swap Test is able to identify decoherence to a quantum system.
  arXiv  Detail & Related papers  (2022-08-04T21:31:49Z)
• 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.