Quantum phase classification via quantum hypothesis testing

• URL: http://arxiv.org/abs/2504.04101v1
• Date: Sat, 05 Apr 2025 08:23:45 GMT
• Title: Quantum phase classification via quantum hypothesis testing
• Authors: Akira Tanji, Hiroshi Yano, Naoki Yamamoto,
• Abstract summary: We propose a classification algorithm based on the quantum Neyman-Pearson test, which is theoretically optimal for distinguishing between two quantum states.<n>Our results show that the proposed method achieves lower classification error probabilities and significantly reduces the training cost.<n>These findings highlight the potential of quantum hypothesis testing as a powerful tool for quantum phase classification.
• Score: 0.39102514525861415
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum autoencoders for image classification [0.0]
  Quantum autoencoders (QAEs) leverage classical optimization solely for parameter tuning.<n>QAEs can serve as efficient classification models with fewer parameters and highlight the potential of utilizing quantum circuits for complete end-to-end learning.
  arXiv  Detail & Related papers  (2025-02-21T07:13:38Z)
• Quantum machine learning for multiclass classification beyond kernel methods [21.23851138896271]
  We propose a quantum algorithm that demonstrates that quantum kernel methods enhance the efficiency of multiclass classification in real-world applications.<n>The results from quantum simulations reveal that the quantum algorithm outperforms its classical counterpart in handling six real-world multiclass classification problems.
  arXiv  Detail & Related papers  (2024-11-05T08:58:30Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Identification of topological phases using classically-optimized variational quantum eigensolver [0.6181093777643575]
  Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers. We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer. In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
  arXiv  Detail & Related papers  (2022-02-07T02:26:58Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Recent advances for quantum classifiers [2.459525036555352]
  We will review a number of quantum classification algorithms, including quantum support vector machine, quantum kernel methods, quantum decision tree, and quantum nearest neighbor algorithm. We will then introduce the variational quantum classifiers, which are essentially variational quantum circuits for classifications.
  arXiv  Detail & Related papers  (2021-08-30T18:00:00Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Learning k-qubit Quantum Operators via Pauli Decomposition [11.498089180181365]
  Motivated by the limited qubit capacity of current quantum systems, we study the quantum sample complexity of $k$-qubit quantum operators. We show that the quantum sample complexity of $k$-qubit quantum operations is comparable to the classical sample complexity of their counterparts.
  arXiv  Detail & Related papers  (2021-02-10T01:20:55Z)
• VSQL: Variational Shadow Quantum Learning for Classification [6.90132007891849]
  We propose a new hybrid quantum-classical framework for supervised quantum learning, which we call Variational Shadow Quantum Learning. We first use variational shadow quantum circuits to extract classical features in a convolution way and then utilize a fully-connected neural network to complete the classification task. We show that this method could sharply reduce the number of parameters and thus better facilitate quantum circuit training.
  arXiv  Detail & Related papers  (2020-12-15T13:51:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.