Quantum phase classification via quantum hypothesis testing

Quantum phase classification is a fundamental problem in quantum many-body physics, traditionally approached using order parameters or quantum machine learning techniques such as quantum convolutional neural networks (QCNNs). However, these methods often require extensive prior knowledge of the system or large numbers of quantum state copies for reliable classification. In this work, we propose a classification algorithm based on the quantum Neyman-Pearson test, which is theoretically optimal for distinguishing between two quantum states. While directly constructing the quantum Neyman-Pearson test for many-body systems via full state tomography is intractable due to the exponential growth of the Hilbert space, we introduce a partitioning strategy that applies hypothesis tests to subsystems rather than the entire state, effectively reducing the required number of quantum state copies while maintaining classification accuracy. We validate our approach through numerical simulations, demonstrating its advantages over conventional methods, including the order parameter-based classifier and the QCNN. Our results show that the proposed method achieves lower classification error probabilities and significantly reduces the training cost compared to the QCNN and the recently developed classical machine learning algorithm enhanced with quantum data, while maintaining high scalability up to systems with 81 qubits. These findings highlight the potential of quantum hypothesis testing as a powerful tool for quantum phase classification, particularly in experimental settings where quantum measurements are combined with classical post-processing.