The term “machine learning” especially refers to algorithms that derive mappings, i.e., input–output transforms, by using numerical data that provide information about considered transforms. These transforms appear in many problems related to classification/clustering, regression, system identification, system inversion, and input signal restoration/separation. We here analyze the connections between all these problems in the classical and quantum frameworks. We then focus on their most challenging versions, involving quantum data and/or quantum processing means, and unsupervised, i.e., blind, learning. We consider the general single-preparation quantum information processing (SIPQIP) framework that we have recently proposed. It involves methods that can work with a single instance of each (unknown) state, whereas usual methods are quite cumbersome because they have to very accurately create many copies of each (known) state. In our previous papers, we applied the SIPQIP approach to only one task [blind quantum process tomography (BQPT)], but it opens the way to a large range of other types of methods. In this article, we, therefore, propose various new SIPQIP methods that efficiently perform tasks related to system identification (blind Hamiltonian parameter estimation (BHPE), blind quantum channel identification/estimation, and blind phase estimation), system inversion and state estimation (blind quantum source separation (BQSS), blind quantum entangled state restoration (BQSR), and blind quantum channel equalization), and classification. Numerical tests show that our SIPQIP framework, moreover, yields much more accurate estimation than the usual multiple-preparation approach. Our methods are especially useful in aquantum computer, which we propose to more briefly call a “quamputer”: BQPT and BHPE simplify the characterization of quamputer gates; BQSS and BQSR yield quantum gates that may be used to compensate for the nonidealities that alter states stored in quantum registers and open the way to very general self-adaptive quantum gates.
The term “machine learning” especially refers to algorithms that derive mappings, i.e., input–output transforms, by using numerical data that provide information about considered transforms. These transforms appear in many problems related to classification/clustering, regression, system identification, system inversion, and input signal restoration/separation. We here analyze the connections between all these problems in the classical and quantum frameworks. We then focus on their most challenging versions, involving quantum data and/or quantum processing means, and unsupervised, i.e., blind, learning. We consider the general single-preparation quantum information processing (SIPQIP) framework that we have recently proposed. It involves methods that can work with a single instance of each (unknown) state, whereas usual methods are quite cumbersome because they have to very accurately create many copies of each (known) state. In our previous papers, we applied the SIPQIP approach to only one task [blind quantum process tomography (BQPT)], but it opens the way to a large range of other types of methods. In this article, we, therefore, propose various new SIPQIP methods that efficiently perform tasks related to system identification (blind Hamiltonian parameter estimation (BHPE), blind quantum channel identification/estimation, and blind phase estimation), system inversion and state estimation (blind quantum source separation (BQSS), blind quantum entangled state restoration (BQSR), and blind quantum channel equalization), and classification. Numerical tests show that our SIPQIP framework, moreover, yields much more accurate estimation than the usual multiple-preparation approach. Our methods are especially useful in aquantum computer, which we propose to more briefly call a “quamputer”: BQPT and BHPE simplify the characterization of quamputer gates; BQSS and BQSR yield quantum gates that may be used to compensate for the nonidealities that alter states stored in quantum registers and open the way to very general self-adaptive quantum gates.
Many methods for processing classical or quantum data are based on estimating some parameters, e.g. those of adaptive filters, artificial neural networks (including deep learning approaches), blind source separation systems or quantum gates. For classical signals, these methods include stochastic algorithms, such as stochastic gradient descent. We here first introduce a partly related, general, type of stochastic algorithms for quantum data and we prove the asymptotic efficiency of the proposed estimator. We then show the attractiveness of this stochastic approach for the quantum version of blind multiple-input multiple-output system identification and blind source separation: the resulting model estimation methods can operate with a single copy of each considered quantum state, whereas the previous methods require many copies of the same (unknown) states to be available and are thus "less blind". Numerical tests show that good performance is obtained with 104such quantum states.
Quantum process tomography (QPT) methods aim at identifying, i.e., estimating, a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. However, usual QPT procedures are complicated, since they set several constraints on the quantum states used as inputs of the process to be characterized. In this paper, we extend QPT so as to avoid two such constraints. On the one hand, usual QPT methods require one to know, hence to very precisely control (i.e., prepare), the specific quantum states used as inputs of the considered quantum process, which is cumbersome. We therefore propose a blind, or unsupervised, extension of QPT (i.e., BQPT), which means that this approach uses input quantum states whose values are unknown and arbitrary, except that they are requested to meet some general known properties (and this approach exploits the output states of the considered quantum process). On the other hand, usual QPT methods require one to be able to prepare many copies of the same (known) input state, which is constraining. In contrast, we propose ``single-preparation BQPT methods'' (SBQPT) , i.e., methods which can operate with only one instance of each considered input state. These two concepts are here illustrated with practical (S)BQPT methods which are numerically validated, in the case when (i) random pure states are used as inputs and their required properties are especially related to the statistical independence of the random variables that define them and (ii) the considered quantum process is based on cylindrical-symmetry Heisenberg spin coupling. As a benchmark, we moreover introduce nonblind QPT methods dedicated to the considered Heisenberg process, we analyze their theoretical behavior (this requires the tools developed in this paper for random input states), and we numerically test their sensitivity to systematic and nonsystematic errors, which are most likely to occur in practice. This shows that, even for very low preparation errors (especially systematic ones), these nonblind QPT methods yield much lower performance than our SBQPT methods. Our blind and single-preparation QPT concepts may be extended, e.g., to a much wider class of processes and to SBQPT methods based on other quantum state properties, as outlined in this paper.
System identification and inversion are two closely related problems, which lead to various configurations. In the quantum framework, system identification was only studied in the non-blind (or supervised) mode, i.e. with known input states (in addition to known output states). It is then called quantum process tomography. We here develop its blind (or unsupervised) version, operating with unknown (unentangled) input states (which are here not controlled by an automated loop). Our approach takes advantage of the blind quantum source separation (i.e. blind multi-qubit system inversion) methods based on disentanglement that we recently introduced. It is detailed for Heisenberg spin coupling and could be extended to other classes of processes. It estimates the parameter values of the Heisenberg Hamiltonian.
Quantum machine learning (QML) provides a transformative approach to data analysis by integrating the principles of quantum computing with classical machine learning methods. With the exponential growth of data and the increasing complexity of computational tasks, quantum algorithms offer tremendous advantages in terms of processing speed, memory efficiency, and the ability to resolve issues intractable for classical systems. In this work, the use of QML techniques for both supervised and unsupervised learning problems is explored. Quantum-enhanced models such Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs) show outstanding performance in classification and regression tasks by using quantum kernels and entanglement in supervised learning. Moreover, hybrid quantum-classical solutions offer useful implementations on noisy intermediate-scale quantum (NISQ) devices, hence bridging the gap between present quantum technology and practical uses. By means of comparative analysis, this paper emphasizes the possible benefits and drawbacks of QML, thereby providing understanding of its future importance in sectors including material science, finance, and healthcare. In the end, QML opens the path for a new era of intelligent data processing and solves until unthinkable difficult challenges.
Due to the superiority and noteworthy progress of Quantum Computing (QC) in a lot of applications such as cryptography, chemistry, Big data, machine learning, optimization, Internet of Things (IoT), Blockchain, communication, and many more. Fully towards to combine classical machine learning (ML) with Quantum Information Processing (QIP) to build a new field in the quantum world is called Quantum Machine Learning (QML) to solve and improve problems that displayed in classical machine learning (e.g. time and energy consumption, kernel estimation). The aim of this paper presents and summarizes a comprehensive survey of the state-of-the-art advances in Quantum Machine Learning (QML). Especially, recent QML classification works. Also, we cover about 30 publications that are published lately in Quantum Machine Learning (QML). we propose a classification scheme in the quantum world and discuss encoding methods for mapping classical data to quantum data. Then, we provide quantum subroutines and some methods of Quantum Computing (QC) in improving performance and speed up of classical Machine Learning (ML). And also some of QML applications in various fields, challenges, and future vision will be presented.
Characterizing a quantum system by learning its state or evolution is a fundamental problem in quantum physics and learning theory with a myriad of applications. Recently, as a new approach to this problem, the task of agnostic state tomography was defined, in which one aims to approximate an arbitrary quantum state by a simpler one in a given class. Generalizing this notion to quantum processes, we initiate the study of agnostic process tomography: given query access to an unknown quantum channel Φ and a known concept class C of channels, output a quantum channel that approximates Φ as well as any channel in the concept class C , up to some error. In this work, we propose several natural applications for this new task in quantum machine learning, quantum metrology, classical simulation, and error mitigation. In addition, we give efficient agnostic process tomography algorithms for a wide variety of concept classes, including Pauli strings, Pauli channels, quantum junta channels, low-degree channels, and a class of channels produced by Q A C 0 circuits. The main technical tool we use is Pauli spectrum analysis of operators and superoperators. We also prove that, using ancilla qubits, any agnostic state tomography algorithm can be extended to one solving agnostic process tomography for a compatible concept class of unitaries, immediately giving us efficient agnostic learning algorithms for Clifford circuits, Clifford circuits with few T gates, and circuits consisting of a tensor product of single-qubit gates. Together, our results provide insight into the conditions and new algorithms necessary to extend the learnability of a concept class from the standard tomographic setting to the agnostic one.