Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Learning architectures based on quantum entanglement: a simple matrix product state algorithm for image recognition

Yuhan Liu, Xiao Zhang, Maciej Lewenstein, Shi-Ju Ran

Published Mar 24, 2018• 5 citations
OpenAlex

Abstract

It is a fundamental, but still elusive question whether methods based on quantum mechanics, in particular on quantum entanglement, can be used for classical information processing and machine learning. Even partial answer to this question would bring important insights to both fields of both machine learning and quantum mechanics. In this work, we implement simple numerical experiments, related to pattern/images classification, in which we represent the classifiers by quantum matrix product states (MPS). Classical machine learning algorithm is then applied to these quantum states. We explicitly show how quantum features (i.e., single-site and bipartite entanglement) can emerge in such represented images; entanglement characterizes here the importance of data, and this information can be practically used to improve the learning procedures. Thanks to the low demands on the dimensions and number of the unitary matrices, necessary to construct the MPS, we expect such numerical experiments could open new paths in classical machine learning, and shed at same time lights on generic quantum simulations/computations.

Related papers

Entanglement-Based Feature Extraction by Tensor Network Machine Learning

Yuhan Liu, Wenjun Li, Xiao Zhang +3 more

It is a hot topic how entanglement, a quantity from quantum information theory, can assist machine learning. In this work, we implement numerical experiments to classify patterns/images by representing the classifiers as matrix product states (MPS). We show how entanglement can interpret machine learning by characterizing the importance of data and propose a feature extraction algorithm. We show on the MNIST dataset that when reducing the number of the retained pixels to 1/10 of the original number, the decrease of the ten-class testing accuracy is only O (10–3), which significantly improves the efficiency of the MPS machine learning. Our work improves machine learning’s interpretability and efficiency under the MPS representation by using the properties of MPS representing entanglement.

arXiv:1803.09111•Frontiers in Applied Mathematics and Statistics•Aug 6, 2021•32 citations

Quantum Machine Learning Matrix Product States

Jacob Biamonte

Matrix product states minimize bipartite correlations to compress the classical data representing quantum states. Matrix product state algorithms and similar tools---called tensor network methods---form the backbone of modern numerical methods used to simulate many-body physics. Matrix product states have a further range of applications in machine learning. Finding matrix product states is in general a computationally challenging task, a computational task which we show quantum computers can accelerate. We present a quantum algorithm which returns a classical description of a $k$-rank matrix product state approximating an eigenvector given black-box access to a unitary matrix. Each iteration of the optimization requires $O(n\cdot k^2)$ quantum gates, yielding sufficient conditions for our quantum variational algorithm to terminate in polynomial-time.

•Apr 6, 2018•2 citations

Matrix Product State–Based Quantum Classifier

Amandeep Singh Bhatia, Mandeep Kaur Saggi, Ajay Kumar +1 more

Interest in quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated systems. Matrix product state (MPS) is a well-designed class of tensor network states that plays an important role in processing quantum information. In this letter, we show that MPS, as a one-dimensional array of tensors, can be used to classify classical and quantum data. We have performed binary classification of the classical machine learning data set Iris encoded in a quantum state. We have also investigated its performance by considering different parameters on the ibmqx4 quantum computer and proved that MPS circuits can be used to attain better accuracy. Furthermore the learning ability of an MPS quantum classifier is tested to classify evapotranspiration (ET[Formula: see text]) for the Patiala meteorological station located in northern Punjab (India), using three years of a historical data set (Agri). We have used different performance metrics of classification to measure its capability. Finally, the results are plotted and the degree of correspondence among values of each sample is shown.

arXiv:1905.01426•Neural Computation•May 21, 2019•43 citations

Innovative Techniques using Quantum Computing: Improve Pattern Recognition in Multi-Dimensional Machine Learning Complications

V.S. Prakash, Hebatullah Awwad, J. Refonaa +3 more

This phenomenon is due to the development of complex high-dimensional datasets within machine learning that may not be effectively processed, identified or classified by classical computers. Multi-dimensional data are increasingly common in a wide range of scientific disciplines including genomics, finance modeling, computer vision, climate prediction et al, and standard approaches to analysis have begun to falter in the face of the curse of dimensionality, computational efficiency, and reduced interpretability. Quantum computing, in this context, is a disruptive paradigm that can bring about a substantial overhaul to machines ability to learn. In this work, we investigate a family of new quantumenhanced protocols specially designed for enhancing pattern recognition in multi-dimensional machine learning problems. We demonstrate a hybrid quantum-classical scheme, combining quantum state representation, quantum feature encoding and quantum kernel estimation to make complex data transformations in a time that scales only with the squareroot of the data size. Important techniques are the use of variational quantum circuits, quantum principal component analysis (qPCA), and quantum support vector machines (QSVMs) to uncover the structure of non-linear and highdimensional features spaces that would have been hidden otherwise. We benchmark these quantum models against classical deep learning models on three datasets: healthcare diagnostics, image classification, and sensor-based time series prediction. Experiments demonstrate that quantum-enhanced models not only accelerate the training process and save the memory space but also achieve better generalization on identifying shape features and abstract patterns. By entanglement and quantum parallelism, we can encode and process information of a multi-dimensional input at the same time and provide a compact and informative representation. In addition to that, quantum circuits show a good potential to deal with noisy and overfitting when dealing with sparsed and imbalanced data. This work demonstrates the quantumcomputational power for pattern recognition, and paves the way for scalable, efficient, and interpretable quantum machine learning. Through connecting quantum algorithms to practical machine learning problems, the work paves the way for applications of quantum computing in challenging highdimensional data analysis problems and in a new territory of research interests at the intersection of quantum information and artificial intelligence.

International Conference on Natural Language Processing and Computer Vision (ICNPCV)•Jul 1, 2026•0 citations

Entanglement detection in pure states with a quantum classifier algorithm

Joab M. Varela

Entangled states proved to be an essential resource for information processing, however, its classification is still an open problem. The objective of this work is to apply machine learning methods based on distance metrics to make a quantum state classification. The classification method implementation was made using classical and quantum algorithms also comparing the performance and efficiency of both. However, it should be noted that all quantum computation processes made in this work used simulators provided by the SDK Qiskit. No real quantum computers were used to implement the quantum methods due to the qubit quantity that exceeds the available open-access quantum computers of the IBM Q-Experience. The classical results obtained in this work make a good classification of quantum states with a precision rate between 70% and 80%. The quantum predictions may have a lower precision, due to some simplifications made in the data pre-processing step, showing that quantum algorithms for entanglement classification probably will require a higher number of qubits than the currently available ones.

•Dec 14, 2023•0 citations

A quantum GAN for entanglement detection and image classification

James E. Steck, Elizabeth Behrman

Machine learning can be used as a systematic method to non-algorithmically program quantum computers. Quantum machine learning enables us to perform computations without breaking down an algorithm into its gate building blocks, eliminating that difficult step and potentially reducing unnecessary complexity. In addition, the machine learning approach is robust to both noise and to decoherence, which is ideal for running on inherently noisy NISQ devices which are limited in the number of qubits available for error correction. Here we apply our prior work in quantum machine learning technique, to create a QGAN, a quantum analog to the classical Stylenet GANs developed by Kerras for image generation and classification. A quantum system is used as a generator and a separate quantum system is used as a discriminator. The generator Hamiltonian quantum parameters are augmented by quantum style parameters which play the role of the style parameters used by Kerras. Both generator parameters are trained in a GAN MinMax problem along with quantum parameters of the discriminator Hamiltonian. We choose a problem to demonstrate the QGAN that has purely quantum information. The task is to generate and discriminate quantum product states. Real product states are generated to be detected and separated from fake quantum product states generated by the quantum generator. The problem of detecting quantum product states is chosen to demonstrate the QGAN because is well known as purely quantum mechanical, has no classical analog and is an open problem for quantum product states of more than 2 qubits. With proper encoding of image pixels into quantum states as density matrices, the method demonstrated here is applicable to GAN image generation and detection that can be hosted on and take advantage of the nature of quantum computers.

arXiv:2408.12620•Aug 9, 2024•3 citations
It is a fundamental, but still elusive question whether methods based on quantum mechanics, in particular on quantum entanglement, can be used for classical information processing and machine learning. Even partial answer to this question would bring important insights to both fields of both machine learning and quantum mechanics. In this work, we implement simple numerical experiments, related to pattern/images classification, in which we represent the classifiers by quantum matrix product states (MPS). Classical machine learning algorithm is then applied to these quantum states. We explicitly show how quantum features (i.e., single-site and bipartite entanglement) can emerge in such represented images; entanglement characterizes here the importance of data, and this information can be practically used to improve the learning procedures. Thanks to the low demands on the dimensions and number of the unitary matrices, necessary to construct the MPS, we expect such numerical experiments could open new paths in classical machine learning, and shed at same time lights on generic quantum simulations/computations.
It is a hot topic how entanglement, a quantity from quantum information theory, can assist machine learning. In this work, we implement numerical experiments to classify patterns/images by representing the classifiers as matrix product states (MPS). We show how entanglement can interpret machine learning by characterizing the importance of data and propose a feature extraction algorithm. We show on the MNIST dataset that when reducing the number of the retained pixels to 1/10 of the original number, the decrease of the ten-class testing accuracy is only O (10–3), which significantly improves the efficiency of the MPS machine learning. Our work improves machine learning’s interpretability and efficiency under the MPS representation by using the properties of MPS representing entanglement.
Matrix product states minimize bipartite correlations to compress the classical data representing quantum states. Matrix product state algorithms and similar tools---called tensor network methods---form the backbone of modern numerical methods used to simulate many-body physics. Matrix product states have a further range of applications in machine learning. Finding matrix product states is in general a computationally challenging task, a computational task which we show quantum computers can accelerate. We present a quantum algorithm which returns a classical description of a kkk-rank matrix product state approximating an eigenvector given black-box access to a unitary matrix. Each iteration of the optimization requires O(n⋅k2)O(n\cdot k^2)O(n⋅k2) quantum gates, yielding sufficient conditions for our quantum variational algorithm to terminate in polynomial-time.
Interest in quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated systems. Matrix product state (MPS) is a well-designed class of tensor network states that plays an important role in processing quantum information. In this letter, we show that MPS, as a one-dimensional array of tensors, can be used to classify classical and quantum data. We have performed binary classification of the classical machine learning data set Iris encoded in a quantum state. We have also investigated its performance by considering different parameters on the ibmqx4 quantum computer and proved that MPS circuits can be used to attain better accuracy. Furthermore the learning ability of an MPS quantum classifier is tested to classify evapotranspiration (ET[Formula: see text]) for the Patiala meteorological station located in northern Punjab (India), using three years of a historical data set (Agri). We have used different performance metrics of classification to measure its capability. Finally, the results are plotted and the degree of correspondence among values of each sample is shown.
This phenomenon is due to the development of complex high-dimensional datasets within machine learning that may not be effectively processed, identified or classified by classical computers. Multi-dimensional data are increasingly common in a wide range of scientific disciplines including genomics, finance modeling, computer vision, climate prediction et al, and standard approaches to analysis have begun to falter in the face of the curse of dimensionality, computational efficiency, and reduced interpretability. Quantum computing, in this context, is a disruptive paradigm that can bring about a substantial overhaul to machines ability to learn. In this work, we investigate a family of new quantumenhanced protocols specially designed for enhancing pattern recognition in multi-dimensional machine learning problems. We demonstrate a hybrid quantum-classical scheme, combining quantum state representation, quantum feature encoding and quantum kernel estimation to make complex data transformations in a time that scales only with the squareroot of the data size. Important techniques are the use of variational quantum circuits, quantum principal component analysis (qPCA), and quantum support vector machines (QSVMs) to uncover the structure of non-linear and highdimensional features spaces that would have been hidden otherwise. We benchmark these quantum models against classical deep learning models on three datasets: healthcare diagnostics, image classification, and sensor-based time series prediction. Experiments demonstrate that quantum-enhanced models not only accelerate the training process and save the memory space but also achieve better generalization on identifying shape features and abstract patterns. By entanglement and quantum parallelism, we can encode and process information of a multi-dimensional input at the same time and provide a compact and informative representation. In addition to that, quantum circuits show a good potential to deal with noisy and overfitting when dealing with sparsed and imbalanced data. This work demonstrates the quantumcomputational power for pattern recognition, and paves the way for scalable, efficient, and interpretable quantum machine learning. Through connecting quantum algorithms to practical machine learning problems, the work paves the way for applications of quantum computing in challenging highdimensional data analysis problems and in a new territory of research interests at the intersection of quantum information and artificial intelligence.
Entangled states proved to be an essential resource for information processing, however, its classification is still an open problem. The objective of this work is to apply machine learning methods based on distance metrics to make a quantum state classification. The classification method implementation was made using classical and quantum algorithms also comparing the performance and efficiency of both. However, it should be noted that all quantum computation processes made in this work used simulators provided by the SDK Qiskit. No real quantum computers were used to implement the quantum methods due to the qubit quantity that exceeds the available open-access quantum computers of the IBM Q-Experience. The classical results obtained in this work make a good classification of quantum states with a precision rate between 70% and 80%. The quantum predictions may have a lower precision, due to some simplifications made in the data pre-processing step, showing that quantum algorithms for entanglement classification probably will require a higher number of qubits than the currently available ones.
Machine learning can be used as a systematic method to non-algorithmically program quantum computers. Quantum machine learning enables us to perform computations without breaking down an algorithm into its gate building blocks, eliminating that difficult step and potentially reducing unnecessary complexity. In addition, the machine learning approach is robust to both noise and to decoherence, which is ideal for running on inherently noisy NISQ devices which are limited in the number of qubits available for error correction. Here we apply our prior work in quantum machine learning technique, to create a QGAN, a quantum analog to the classical Stylenet GANs developed by Kerras for image generation and classification. A quantum system is used as a generator and a separate quantum system is used as a discriminator. The generator Hamiltonian quantum parameters are augmented by quantum style parameters which play the role of the style parameters used by Kerras. Both generator parameters are trained in a GAN MinMax problem along with quantum parameters of the discriminator Hamiltonian. We choose a problem to demonstrate the QGAN that has purely quantum information. The task is to generate and discriminate quantum product states. Real product states are generated to be detected and separated from fake quantum product states generated by the quantum generator. The problem of detecting quantum product states is chosen to demonstrate the QGAN because is well known as purely quantum mechanical, has no classical analog and is an open problem for quantum product states of more than 2 qubits. With proper encoding of image pixels into quantum states as density matrices, the method demonstrated here is applicable to GAN image generation and detection that can be hosted on and take advantage of the nature of quantum computers.