Failure-Guided Fuzzing for Hybrid Quantum-Classical Programs
Lei Zhang

TL;DR
This paper introduces failure-guided fuzzing for hybrid quantum-classical programs, improving testing effectiveness by focusing on failure-prone regions using a two-phase search strategy.
Contribution
It proposes a novel failure-guided fuzzing approach that models hybrid inputs and evaluates a two-phase strategy for better testing of HQC algorithms.
Findings
Failure-guided local fuzzing significantly improves testing over random methods.
Concolic seed discovery offers additional benefits for VQE but is workload-dependent.
Reusing failure information is promising for HQC testing.
Abstract
Hybrid quantum-classical (HQC) algorithms, such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are central to near-term quantum computing but remain challenging to test. Sampling-based fuzzing can expose faulty or non-convergent configurations, but under realistic execution budgets, it may miss failure-prone regions in the joint space of classical optimizer settings and quantum circuit parameters. This paper studies failure-guided fuzzing for HQC programs. It models a hybrid input as a pair of classical optimizer hyperparameters and quantum circuit parameters, and evaluates a two-phase strategy that first searches for non-convergent seeds and then locally fuzzes circuit parameters around those seeds. To understand where the gains come from, five budgeted strategies are compared: random hybrid testing, classical enumeration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
