🤖 AI Summary
In the rapidly advancing field of quantum computing, measurement-based output verification faces fundamental limitations due to the probabilistic nature of quantum states, hindering rigorous validation of complex quantum program behavior. Method: We systematically classify existing measurement-based verification techniques and empirically analyze their shortcomings—particularly their inability to adequately characterize distribution-level and value-level correctness, especially for programs exhibiting nontrivial quantum phenomena. We then comparatively evaluate state-vector–based verification, conducting an empirical study across diverse quantum programs. Contribution/Results: Our results demonstrate that measurement-based verification is only suitable for rudimentary existential checks, whereas state-vector–based verification precisely captures superposition, entanglement, and other core quantum behaviors, significantly enhancing test depth and reliability. This work advances quantum program testing from a “result-oriented” paradigm toward a “process-traceable” one, providing both theoretical foundations and methodological guidance for building robust quantum software quality assurance frameworks.
📝 Abstract
As quantum computing continues to emerge, ensuring the quality of quantum programs has become increasingly critical. Quantum program testing has emerged as a prominent research area within the scope of quantum software engineering. While numerous approaches have been proposed to address quantum program quality assurance, our analysis reveals that most existing methods rely on measurement-based validation in practice. However, due to the inherently probabilistic nature of quantum programs, measurement-based validation methods face significant limitations.
To investigate these limitations, we conducted an empirical study of recent research on quantum program testing, analyzing measurement-based validation methods in the literature. Our analysis categorizes existing measurement-based validation methods into two groups: distribution-level validation and output-value-level validation. We then compare measurement-based validation with statevector-based validation methods to evaluate their pros and cons. Our findings demonstrate that measurement-based validation is suitable for straightforward assessments, such as verifying the existence of specific output values, while statevector-based validation proves more effective for complicated tasks such as assessing the program behaviors.