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

CRC Press eBooks

Tensor Networks and Quantum-Inspired Machine Learning

Hamid D. Ismail

Published Nov 4, 2026• 0 citations
Publisher

Abstract

This chapter presents tensor networks as a unifying framework for quantum-inspired machine learning and for the analysis of near-term quantum learning models. Motivated by the challenge of high dimensionality, this chapter shows how tensor networks exploit locality, low-rank structure, and controlled correlations to represent high-order data efficiently while avoiding the exponential scaling of naïve tensor representations. Fundamental concepts including tensors, tensor contraction, and graphical network representations are introduced, followed by the development of key architectures such as Matrix Product States (Tensor Trains) and the Multi-scale Entanglement Renormalization Ansatz. Their roles in controlling expressivity, entanglement, and computational cost are emphasized throughout. This chapter further demonstrates the close correspondence between tensor networks and quantum circuits, showing how shallow quantum models can be interpreted as low-bond-dimension tensor networks and how this perspective clarifies classical simulability, representational capacity, and noisy intermediate-scale quantum (NISQ)-era limitations. Hybrid quantum-tensor network architectures are presented as a practical route for combining classical compression and representation learning with targeted quantum processing. Applications in natural language processing, biological sequence learning, and image and signal processing illustrate how tensor network methods serve as both efficient classical models and structured surrogates for quantum learning systems. Hands-on Qiskit and PennyLane examples connect these ideas to executable machine learning workflows.

DOI
10.1201/9781042002818-15

Related papers

Towards quantum machine learning with tensor networks

William J. Huggins, Piyush Patil, Bradley Mitchell +2 more

Abstract Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. We demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

arXiv:1803.11537•Quantum Science and Technology•Oct 23, 2018•407 citations

Hybrid Tensor Networks: The Integration of Quantum and Classical Machine Learning

Jiaqi Yao

Tensor networks can compactly represent high-dimensional data in the form of low-rank tensor decompositions, which helps capture complex structures and correlations within the data. However, their inherently multilinear nature limits their potential as universal approximators. To address this limitation, tensor networks are combined with classical neural network layers, introducing nonlinear elements to enhance the model’s expressive power. The Hybrid Tensor Networks (HTN) system encompasses two prevalent tensor network configurations, Matrix Product States and Tree Tensor Networks, which facilitates the adaptable design of models customized for particular machine learning applications. This framework has been validated on classification and image reconstruction tasks, demonstrating its potential to handle complex data structures and its applicability within the machine learning field. Employing this approach, the goal is to establish a foundation for future research on hybrid quantum-classical models, thereby opening up avenues for the realm of quantum machine learning.

International Conference on Computer, Vision and Intelligent Technology (ICCVIT)•Nov 24, 2024•1 citation

Classical versus quantum: Comparing tensor-network-based quantum circuits on Large Hadron Collider data

Jack Y. Araz, Michael Spannowsky

Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.

arXiv:2202.10471•Physical Review A•Dec 19, 2022•44 citations

Sequence processing with quantum-inspired tensor networks

Carys Harvey, Richie Wai Kit Yeung, Konstantinos Meichanetzidis

We introduce efficient tensor network models for sequence processing motivated by correspondence to probabilistic graphical models, interpretability and resource compression. Inductive bias is introduced via network architecture as motivated by correlation and compositional structure in the data. We create expressive networks utilising tensors that are both complex and unitary. As such they may be represented by parameterised quantum circuits and describe physical processes. The relevant inductive biases result in networks with logarithmic treewidth which is paramount for avoiding trainability issues in these spaces. For the same reason, they are also efficiently contractable or 'quantum-inspired'. We demonstrate experimental results for the task of binary classification of bioinformatics and natural language, characterised by long-range correlations and often equipped with syntactic information. This work provides a scalable route for experimentation on the role of tensor structure and syntactic priors in NLP. Since these models map operationally to the qubits of a quantum processor, unbiased sampling equates to taking measurements on the quantum state encoding the learnt probability distribution. We demonstrate implementation on Quantinuum's H2-1 trapped-ion quantum processor, showing the potential of near-term quantum devices.

arXiv:2308.07865•Scientific Reports•Feb 28, 2025•13 citations

Quantum-inspired tensor networks in machine learning models

Guillermo Valverde, Igor García-Olaizola, Giannicola Scarpa +1 more

Tensor networks were developed in the context of many-body physics as compressed representations of multiparticle quantum states. These representations mitigate the exponential complexity of many-body systems by capturing only the most relevant dependencies. Due to the formal similarity between quantum entanglement and statistical correlations, tensor networks have recently been integrated in machine learning, operating both as alternative learning architectures and as decompositions of components of neural networks. The expectation is that the theoretical understanding of tensor networks developed within quantum many-body physics leads to novel methods that offer advantages in terms of computational efficiency, explainability, or privacy. Here we review the use of tensor networks in the context of machine learning, providing a critical assessment of the state of the art, the potential advantages, and the challenges that must be overcome.

cs.LGCross-listedarXiv:2604.14287•Apr 17, 2026•0 citations

From Probabilistic Graphical Models to Generalized Tensor Networks for Supervised Learning

Ivan Glasser, Nicola Pancotti, J. I. Cirac

Tensor networks have found a wide use in a variety of applications in physics and computer science, recently leading to both theoretical insights as well as practical algorithms in machine learning. In this work we explore the connection between tensor networks and probabilistic graphical models, and show that it motivates the definition of generalized tensor networks where information from a tensor can be copied and reused in other parts of the network. We discuss the relationship between generalized tensor network architectures used in quantum physics, such as string-bond states, and architectures commonly used in machine learning. We provide an algorithm to train these networks in a supervised-learning context and show that they overcome the limitations of regular tensor networks in higher dimensions, while keeping the computation efficient. A method to combine neural networks and tensor networks as part of a common deep learning architecture is also introduced. We benchmark our algorithm for several generalized tensor network architectures on the task of classifying images and sounds, and show that they outperform previously introduced tensor-network algorithms. The models we consider also have a natural implementation on a quantum computer and may guide the development of near-term quantum machine learning architectures.

arXiv:1806.05964•IEEE Access•Jan 1, 2020•135 citations
This chapter presents tensor networks as a unifying framework for quantum-inspired machine learning and for the analysis of near-term quantum learning models. Motivated by the challenge of high dimensionality, this chapter shows how tensor networks exploit locality, low-rank structure, and controlled correlations to represent high-order data efficiently while avoiding the exponential scaling of naïve tensor representations. Fundamental concepts including tensors, tensor contraction, and graphical network representations are introduced, followed by the development of key architectures such as Matrix Product States (Tensor Trains) and the Multi-scale Entanglement Renormalization Ansatz. Their roles in controlling expressivity, entanglement, and computational cost are emphasized throughout. This chapter further demonstrates the close correspondence between tensor networks and quantum circuits, showing how shallow quantum models can be interpreted as low-bond-dimension tensor networks and how this perspective clarifies classical simulability, representational capacity, and noisy intermediate-scale quantum (NISQ)-era limitations. Hybrid quantum-tensor network architectures are presented as a practical route for combining classical compression and representation learning with targeted quantum processing. Applications in natural language processing, biological sequence learning, and image and signal processing illustrate how tensor network methods serve as both efficient classical models and structured surrogates for quantum learning systems. Hands-on Qiskit and PennyLane examples connect these ideas to executable machine learning workflows.
Abstract Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. We demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.
Tensor networks can compactly represent high-dimensional data in the form of low-rank tensor decompositions, which helps capture complex structures and correlations within the data. However, their inherently multilinear nature limits their potential as universal approximators. To address this limitation, tensor networks are combined with classical neural network layers, introducing nonlinear elements to enhance the model’s expressive power. The Hybrid Tensor Networks (HTN) system encompasses two prevalent tensor network configurations, Matrix Product States and Tree Tensor Networks, which facilitates the adaptable design of models customized for particular machine learning applications. This framework has been validated on classification and image reconstruction tasks, demonstrating its potential to handle complex data structures and its applicability within the machine learning field. Employing this approach, the goal is to establish a foundation for future research on hybrid quantum-classical models, thereby opening up avenues for the realm of quantum machine learning.
Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.
We introduce efficient tensor network models for sequence processing motivated by correspondence to probabilistic graphical models, interpretability and resource compression. Inductive bias is introduced via network architecture as motivated by correlation and compositional structure in the data. We create expressive networks utilising tensors that are both complex and unitary. As such they may be represented by parameterised quantum circuits and describe physical processes. The relevant inductive biases result in networks with logarithmic treewidth which is paramount for avoiding trainability issues in these spaces. For the same reason, they are also efficiently contractable or 'quantum-inspired'. We demonstrate experimental results for the task of binary classification of bioinformatics and natural language, characterised by long-range correlations and often equipped with syntactic information. This work provides a scalable route for experimentation on the role of tensor structure and syntactic priors in NLP. Since these models map operationally to the qubits of a quantum processor, unbiased sampling equates to taking measurements on the quantum state encoding the learnt probability distribution. We demonstrate implementation on Quantinuum's H2-1 trapped-ion quantum processor, showing the potential of near-term quantum devices.
Tensor networks were developed in the context of many-body physics as compressed representations of multiparticle quantum states. These representations mitigate the exponential complexity of many-body systems by capturing only the most relevant dependencies. Due to the formal similarity between quantum entanglement and statistical correlations, tensor networks have recently been integrated in machine learning, operating both as alternative learning architectures and as decompositions of components of neural networks. The expectation is that the theoretical understanding of tensor networks developed within quantum many-body physics leads to novel methods that offer advantages in terms of computational efficiency, explainability, or privacy. Here we review the use of tensor networks in the context of machine learning, providing a critical assessment of the state of the art, the potential advantages, and the challenges that must be overcome.
Tensor networks have found a wide use in a variety of applications in physics and computer science, recently leading to both theoretical insights as well as practical algorithms in machine learning. In this work we explore the connection between tensor networks and probabilistic graphical models, and show that it motivates the definition of generalized tensor networks where information from a tensor can be copied and reused in other parts of the network. We discuss the relationship between generalized tensor network architectures used in quantum physics, such as string-bond states, and architectures commonly used in machine learning. We provide an algorithm to train these networks in a supervised-learning context and show that they overcome the limitations of regular tensor networks in higher dimensions, while keeping the computation efficient. A method to combine neural networks and tensor networks as part of a common deep learning architecture is also introduced. We benchmark our algorithm for several generalized tensor network architectures on the task of classifying images and sounds, and show that they outperform previously introduced tensor-network algorithms. The models we consider also have a natural implementation on a quantum computer and may guide the development of near-term quantum machine learning architectures.