🤖 AI Summary
Fixed-sample-size approaches to composite quantum hypothesis testing (QHT) suffer from inefficiency and lack of adaptivity. Method: We propose the Quantum Sequential Universal Testing (QSUT) framework, which abandons pre-specified sample sizes and instead alternates adaptive local measurements with collective discrimination measurements to dynamically infer the class membership of an unknown quantum state. QSUT integrates universal inference, the Helstrom–Holevo optimality criterion, and shallow variational quantum circuits, adaptively adjusting the number of copies while strictly controlling Type-I error. Contribution/Results: Experiments demonstrate that QSUT significantly reduces copy complexity across diverse composite QHT tasks—improving detection efficiency by up to several-fold—while maintaining theoretical rigor and engineering feasibility. To our knowledge, QSUT is the first sequential testing paradigm for composite quantum hypotheses, establishing a foundational framework for adaptive quantum statistical inference.
📝 Abstract
Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states. In the general setting of composite hypotheses, the goal of QHT is to determine whether an unknown quantum state belongs to one or another of two classes of states based on the measurement of a number of copies of the state. Prior art on QHT with composite hypotheses focused on a fixed-copy two-step protocol, with state estimation followed by an optimized joint measurement. However, this fixed-copy approach may be inefficient, using the same number of copies irrespective of the inherent difficulty of the testing task. To address these limitations, we introduce the quantum sequential universal test (QSUT), a novel framework for sequential QHT in the general case of composite hypotheses. QSUT builds on universal inference, and it alternates between adaptive local measurements aimed at exploring the hypothesis space and joint measurements optimized for maximal discrimination. QSUT is proven to rigorously control the type I error under minimal assumptions about the hypothesis structure. We present two practical instantiations of QSUT, one based on the Helstrom-Holevo test and one leveraging shallow variational quantum circuits. Empirical results across a range of composite QHT tasks demonstrate that QSUT consistently reduces copy complexity relative to state-of-the-art fixed-copy strategies.