QuanForge: A Mutation Testing Framework for Quantum Neural Networks
With the growing synergy between deep learning and quantum computing, Quantum Neural Networks (QNNs) have emerged as a promising paradigm by leveraging quantum parallelism and entanglement. However, testing QNNs remains underexplored due to their complex quantum dynamics and limited interpretability. Developing a mutation testing technique for QNNs is promising while requires addressing stochastic factors, including the inherent randomness of mutation operators and quantum measurements. To tackle these challenges, we propose QuanForge, a mutation testing framework specifically designed for QNNs. We first introduce statistical mutation killing to provide a more reliable criterion. QuanForge incorporates nine post-training mutation operators at both gate and parameter levels, capable of simulating various potential errors in quantum circuits. Finally, a mutant generation algorithm is formalized that systematically produces effective mutants, thereby enabling a robust and reliable mutation analysis. Through extensive experiments on benchmark datasets and QNN architectures, we show that QuanForge can effectively distinguish different test suites and localize vulnerable circuit regions, providing insights for data enhancement and structural assessment of QNNs. We also analyze the generation capabilities of different operators and evaluate performance under simulated noisy conditions to assess the practical feasibility of QuanForge for future quantum devices.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient Mutation Testing of Quantum Machine Learning Models
Quantum machine learning integrates the strengths of quantum computing and machine learning, enabling models to learn complex features using fewer parameters than their classical counterparts. Due to the increasing compl…
Quantum Machine LearningEvaluating Mutation Techniques in Genetic Algorithm-Based Quantum Circuit Synthesis
Quantum computing leverages the unique properties of qubits and quantum parallelism to solve problems intractable for classical systems, offering unparalleled computational potential. However, the optimization of quantum…
HyQuRP: Hybrid quantum-classical neural network with rotational and permutational equivariance
Group-equivariant quantum machine learning has emerged as a promising paradigm by incorporating symmetry into quantum models. However, constructing models simultaneously equivariant to both rotational and permutational s…
3D Point Cloud ClassificationQuantum Machine LearningAdiabatic Quantum Graph Matching with Permutation Matrix Constraints
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we a…
Graph MatchingvalidQuantum Permutation Synchronization
We present QuantumSync, the first quantum algorithm for solving a synchronization problem in the context of computer vision. In particular, we focus on permutation synchronization which involves solving a non-convex opti…