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

arXiv:2310.01515 · Quantum Machine Intelligence

Tensor ring optimized quantum-enhanced tensor neural networks

Debanjan Konar, Dheeraj Peddireddy, Bijaya Ketan Panigrahi, Vaneet Aggarwal

Published Apr 22, 2025• 4 citations
arXivHTMLPDF

Abstract

Abstract Quantum machine learning researchers often rely on incorporating tensor networks (TN) into deep neural networks (DNN) and variational optimization. However, the standard optimization techniques used for training the contracted trainable weights of each model layer suffer from the correlations and entanglement structure between the model parameters in classical implementations. To address this issue, a multi-layer design of a tensor ring optimized variational quantum learning classifier (Quan-TR) comprising cascading entangling gates replacing the fully connected (dense) layers of a TN is proposed, and it is referred to as tensor ring optimized quantum-enhanced tensor neural networks (TR-QNet). TR-QNet parameters are optimized using the stochastic gradient descent algorithm on qubit measurements. The proposed TR-QNet is evaluated on three distinct datasets, namely Iris, MNIST, and CIFAR-10, to demonstrate the enhanced precision achieved for binary classification. In quantum simulations, the proposed TR-QNet achieves promising precision of $$94.5\%$$ 94.5 % , $$86.16\%$$ 86.16 % , and $$83.54\%$$ 83.54 % on the Iris, MNIST, and CIFAR-10 datasets. Benchmark studies have been conducted on state-of-the-art quantum and classical implementations of TN models to show the efficacy of the proposed TR-QNet. Moreover, the scalability of TR-QNet highlights its potential for exhibiting in deep learning applications on a large scale. The PyTorch implementation of TR-QNet is available on Github https://github.com/konar1987/TR-QNet/ .

DOI
10.1007/s42484-025-00281-5

Related papers

Quantum-Train with Tensor Network Mapping Model and Distributed Circuit Ansatz

Chen-Yu Liu, Chu-Hsuan Abraham Lin, Kuan‐Cheng Chen

In the Quantum-Train (QT) framework, mapping quantum state measurements to classical neural network weights is a critical challenge that affects the scalability and efficiency of hybrid quantum-classical models. The traditional QT framework employs a multi-layer perceptron (MLP) for this task, but it struggles with scalability and interpretability. To address these issues, we propose replacing the MLP with a tensor network-based model and introducing a distributed circuit ansatz designed for large-scale quantum machine learning with multiple small quantum processing unit nodes. This approach enhances scalability, efficiently represents high-dimensional data, and maintains a compact model structure. Our enhanced QT framework retains the benefits of reduced parameter count and independence from quantum resources during inference. Experimental results on benchmark datasets demonstrate that the tensor network-based QT framework achieves competitive performance with improved efficiency and generalization, offering a practical solution for scalable hybrid quantum-classical machine learning.

arXiv:2409.06992•IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•15 citations

Variational tensor neural networks for deep learning

Saeed S. Jahromi, Román Orús

Deep neural networks (NNs) encounter scalability limitations when confronted with a vast array of neurons, thereby constraining their achievable network depth. To address this challenge, we propose an integration of tensor networks (TN) into NN frameworks, combined with a variational DMRG-inspired training technique. This in turn, results in a scalable tensor neural network (TNN) architecture capable of efficient training over a large parameter space. Our variational algorithm utilizes a local gradient-descent technique, enabling manual or automatic computation of tensor gradients, facilitating design of hybrid TNN models with combined dense and tensor layers. Our training algorithm further provides insight on the entanglement structure of the tensorized trainable weights and correlation among the model parameters. We validate the accuracy and efficiency of our method by designing TNN models and providing benchmark results for linear and non-linear regressions, data classification and image recognition on MNIST handwritten digits.

arXiv:2211.14657•Scientific Reports•Aug 16, 2024•18 citations

Tree Tensor Network Quantum-Classical Hybrid Neural Architecture for Efficient Data Classification

Novianto Nur Hidayat, Muhamad Akrom

We introduce the Tree Tensor Network-enhanced Quantum-Classical Neural Network (TTN-QNet), a hybrid architecture that leverages the hierarchical structure of Tree Tensor Networks for efficient parameter representation and Variational Quantum Circuits (VQC) for expressive modeling. Unlike Tensor Ring Networks, TTNs reduce parameter redundancy through a tree-based topology, enabling scalable and interpretable computation. The proposed TTN-QNet is evaluated on the Iris, MNIST, and CIFAR-10 datasets, achieving classification accuracies of 93.2%, 85.24%, and 81.67%, respectively, on binary classification tasks. TTN-QNet demonstrates rapid convergence and robustness against barren plateaus, offering a promising direction for deep quantum learning.

Journal of Multiscale Materials Informatics•Jun 14, 2025•3 citations

Quantum-Classical Machine learning by Hybrid Tensor Networks

Ding Liu, Yao, Jiaqi, Z. Jamie Yao +1 more

Tensor networks (TN) have found a wide use in machine learning, and in particular, TN and deep learning bear striking similarities. In this work, we propose the quantum-classical hybrid tensor networks (HTN) which combine tensor networks with classical neural networks in a uniform deep learning framework to overcome the limitations of regular tensor networks in machine learning. We first analyze the limitations of regular tensor networks in the applications of machine learning involving the representation power and architecture scalability. We conclude that in fact the regular tensor networks are not competent to be the basic building blocks of deep learning. Then, we discuss the performance of HTN which overcome all the deficiency of regular tensor networks for machine learning. In this sense, we are able to train HTN in the deep learning way which is the standard combination of algorithms such as Back Propagation and Stochastic Gradient Descent. We finally provide two applicable cases to show the potential applications of HTN, including quantum states classification and quantum-classical autoencoder. These cases also demonstrate the great potentiality to design various HTN in deep learning way.

arXiv:2005.09428•May 15, 2020•11 citations

Transforming two-dimensional tensor networks into quantum circuits for supervised learning

Zhihui Song, Jinchen Xu, Xin Zhou +2 more

Abstract There have been numerous quantum neural networks reported, but they struggle to match traditional neural networks in accuracy. Given the huge improvement of the neural network models’ accuracy by two-dimensional tensor network (TN) states in classical tensor network machine learning (TNML), it is promising to explore whether its application in quantum machine learning can extend the performance boundary of the models. Here, we transform two-dimensional TNs into quantum circuits for supervised learning. Specifically, we encode two-dimensional TNs into quantum circuits through rigorous mathematical proofs for constructing model ansätze, including string-bond states, entangled-plaquette states and isometric TN states. In addition, we propose adaptive data encoding methods and combine with TNs. We construct a tensor-network-inspired quantum circuit (TNQC) supervised learning framework for transferring TNML from classical to quantum, and build several novel two-dimensional TN-inspired quantum classifiers based on this framework. Finally, we propose a parallel quantum machine learning method for multi-class classification to construct 2D TNQC-based multi-class classifiers. Classical simulation results on the MNIST benchmark dataset show that our proposed models achieve the state-of-the-art accuracy performance, significantly outperforming other quantum classifiers on both binary and multi-class classification tasks, and beat simple convolutional classifiers on a fair track with identical inputs. The noise resilience of the models makes them successfully run and work in a real quantum computer.

Machine Learning Science and Technology•Mar 1, 2024•3 citations

Scalable Tensor Ring Methods for Variational Quantum Algorithms

Dheeraj Peddireddy

Variational quantum algorithms (VQAs) have emerged as a promising candidate for realizing quantum advantage in machine learning and optimization tasks on noisy intermediate-scale quantum (NISQ) devices. Despite significant theoretical promise, the practical impact of VQAs is constrained by the exponential growth in computational resources required for classical simulation, the onset of barren plateaus in parameterized landscapes, and the inherent difficulties of scaling classical optimization routines to circuits with many qubits and layers. Addressing these intertwined challenges is essential for both advancing quantum algorithm development and extracting actionable physical insights from modern quantum hardware.This dissertation develops, analyzes, and validates an efficient framework based on approximate tensor ring decompositions for the classical simulation, training, and benchmarking of variational quantum circuits and eigensolvers. The first component of this work formalizes the representation of quantum states and gates within a cyclic tensor ring structure, enabling the compression of parameterized quantum circuits to linear scaling in both qubit number and circuit depth, while preserving essential quantum correlations and entanglement structure. Gate operations are efficiently approximated via truncated singular value decomposition, and novel algorithms for forward propagation and gradient-based training in the tensor ring domain are developed. These methodological advances are systematically benchmarked on standard supervised learning tasks, including Iris and MNIST datasets, and compared to conventional statevector and matrix product state baselines, resulting in competitive accuracy and orders-of-magnitude reductions in simulation cost. Extending this framework, the dissertation also introduces a scalable method for gradient evaluation in variational quantum eigensolvers (VQE) using the approximate tensor ring representation. This approach enables the simulation and training of large circuits for combinatorial optimization problems, supporting practical qubit counts and circuit depths inaccessible to traditional simulation methods. Detailed experiments on the Maximum-Cut optimization problem demonstrate both the computational efficiency and robustness of the tensor ring framework in nontrivial optimization landscapes.Collectively, the results establish approximate tensor ring decomposition as a versatile and powerful framework for advancing quantum machine learning and discrete optimization, supporting both pre-deployment benchmarking on classical hardware and algorithm design for next-generation quantum devices. This work provides a foundation for the further exploration of scalable quantum-classical hybrid algorithms, with implications for quantum simulation, optimization, and beyond.

•Jan 20, 2026•0 citations
Abstract Quantum machine learning researchers often rely on incorporating tensor networks (TN) into deep neural networks (DNN) and variational optimization. However, the standard optimization techniques used for training the contracted trainable weights of each model layer suffer from the correlations and entanglement structure between the model parameters in classical implementations. To address this issue, a multi-layer design of a tensor ring optimized variational quantum learning classifier (Quan-TR) comprising cascading entangling gates replacing the fully connected (dense) layers of a TN is proposed, and it is referred to as tensor ring optimized quantum-enhanced tensor neural networks (TR-QNet). TR-QNet parameters are optimized using the stochastic gradient descent algorithm on qubit measurements. The proposed TR-QNet is evaluated on three distinct datasets, namely Iris, MNIST, and CIFAR-10, to demonstrate the enhanced precision achieved for binary classification. In quantum simulations, the proposed TR-QNet achieves promising precision of 94.5%94.5\%94.5% 94.5 % , 86.16%86.16\%86.16% 86.16 % , and 83.54%83.54\%83.54% 83.54 % on the Iris, MNIST, and CIFAR-10 datasets. Benchmark studies have been conducted on state-of-the-art quantum and classical implementations of TN models to show the efficacy of the proposed TR-QNet. Moreover, the scalability of TR-QNet highlights its potential for exhibiting in deep learning applications on a large scale. The PyTorch implementation of TR-QNet is available on Github https://github.com/konar1987/TR-QNet/ .
In the Quantum-Train (QT) framework, mapping quantum state measurements to classical neural network weights is a critical challenge that affects the scalability and efficiency of hybrid quantum-classical models. The traditional QT framework employs a multi-layer perceptron (MLP) for this task, but it struggles with scalability and interpretability. To address these issues, we propose replacing the MLP with a tensor network-based model and introducing a distributed circuit ansatz designed for large-scale quantum machine learning with multiple small quantum processing unit nodes. This approach enhances scalability, efficiently represents high-dimensional data, and maintains a compact model structure. Our enhanced QT framework retains the benefits of reduced parameter count and independence from quantum resources during inference. Experimental results on benchmark datasets demonstrate that the tensor network-based QT framework achieves competitive performance with improved efficiency and generalization, offering a practical solution for scalable hybrid quantum-classical machine learning.
Deep neural networks (NNs) encounter scalability limitations when confronted with a vast array of neurons, thereby constraining their achievable network depth. To address this challenge, we propose an integration of tensor networks (TN) into NN frameworks, combined with a variational DMRG-inspired training technique. This in turn, results in a scalable tensor neural network (TNN) architecture capable of efficient training over a large parameter space. Our variational algorithm utilizes a local gradient-descent technique, enabling manual or automatic computation of tensor gradients, facilitating design of hybrid TNN models with combined dense and tensor layers. Our training algorithm further provides insight on the entanglement structure of the tensorized trainable weights and correlation among the model parameters. We validate the accuracy and efficiency of our method by designing TNN models and providing benchmark results for linear and non-linear regressions, data classification and image recognition on MNIST handwritten digits.
We introduce the Tree Tensor Network-enhanced Quantum-Classical Neural Network (TTN-QNet), a hybrid architecture that leverages the hierarchical structure of Tree Tensor Networks for efficient parameter representation and Variational Quantum Circuits (VQC) for expressive modeling. Unlike Tensor Ring Networks, TTNs reduce parameter redundancy through a tree-based topology, enabling scalable and interpretable computation. The proposed TTN-QNet is evaluated on the Iris, MNIST, and CIFAR-10 datasets, achieving classification accuracies of 93.2%, 85.24%, and 81.67%, respectively, on binary classification tasks. TTN-QNet demonstrates rapid convergence and robustness against barren plateaus, offering a promising direction for deep quantum learning.
Tensor networks (TN) have found a wide use in machine learning, and in particular, TN and deep learning bear striking similarities. In this work, we propose the quantum-classical hybrid tensor networks (HTN) which combine tensor networks with classical neural networks in a uniform deep learning framework to overcome the limitations of regular tensor networks in machine learning. We first analyze the limitations of regular tensor networks in the applications of machine learning involving the representation power and architecture scalability. We conclude that in fact the regular tensor networks are not competent to be the basic building blocks of deep learning. Then, we discuss the performance of HTN which overcome all the deficiency of regular tensor networks for machine learning. In this sense, we are able to train HTN in the deep learning way which is the standard combination of algorithms such as Back Propagation and Stochastic Gradient Descent. We finally provide two applicable cases to show the potential applications of HTN, including quantum states classification and quantum-classical autoencoder. These cases also demonstrate the great potentiality to design various HTN in deep learning way.
Abstract There have been numerous quantum neural networks reported, but they struggle to match traditional neural networks in accuracy. Given the huge improvement of the neural network models’ accuracy by two-dimensional tensor network (TN) states in classical tensor network machine learning (TNML), it is promising to explore whether its application in quantum machine learning can extend the performance boundary of the models. Here, we transform two-dimensional TNs into quantum circuits for supervised learning. Specifically, we encode two-dimensional TNs into quantum circuits through rigorous mathematical proofs for constructing model ansätze, including string-bond states, entangled-plaquette states and isometric TN states. In addition, we propose adaptive data encoding methods and combine with TNs. We construct a tensor-network-inspired quantum circuit (TNQC) supervised learning framework for transferring TNML from classical to quantum, and build several novel two-dimensional TN-inspired quantum classifiers based on this framework. Finally, we propose a parallel quantum machine learning method for multi-class classification to construct 2D TNQC-based multi-class classifiers. Classical simulation results on the MNIST benchmark dataset show that our proposed models achieve the state-of-the-art accuracy performance, significantly outperforming other quantum classifiers on both binary and multi-class classification tasks, and beat simple convolutional classifiers on a fair track with identical inputs. The noise resilience of the models makes them successfully run and work in a real quantum computer.
Variational quantum algorithms (VQAs) have emerged as a promising candidate for realizing quantum advantage in machine learning and optimization tasks on noisy intermediate-scale quantum (NISQ) devices. Despite significant theoretical promise, the practical impact of VQAs is constrained by the exponential growth in computational resources required for classical simulation, the onset of barren plateaus in parameterized landscapes, and the inherent difficulties of scaling classical optimization routines to circuits with many qubits and layers. Addressing these intertwined challenges is essential for both advancing quantum algorithm development and extracting actionable physical insights from modern quantum hardware.This dissertation develops, analyzes, and validates an efficient framework based on approximate tensor ring decompositions for the classical simulation, training, and benchmarking of variational quantum circuits and eigensolvers. The first component of this work formalizes the representation of quantum states and gates within a cyclic tensor ring structure, enabling the compression of parameterized quantum circuits to linear scaling in both qubit number and circuit depth, while preserving essential quantum correlations and entanglement structure. Gate operations are efficiently approximated via truncated singular value decomposition, and novel algorithms for forward propagation and gradient-based training in the tensor ring domain are developed. These methodological advances are systematically benchmarked on standard supervised learning tasks, including Iris and MNIST datasets, and compared to conventional statevector and matrix product state baselines, resulting in competitive accuracy and orders-of-magnitude reductions in simulation cost. Extending this framework, the dissertation also introduces a scalable method for gradient evaluation in variational quantum eigensolvers (VQE) using the approximate tensor ring representation. This approach enables the simulation and training of large circuits for combinatorial optimization problems, supporting practical qubit counts and circuit depths inaccessible to traditional simulation methods. Detailed experiments on the Maximum-Cut optimization problem demonstrate both the computational efficiency and robustness of the tensor ring framework in nontrivial optimization landscapes.Collectively, the results establish approximate tensor ring decomposition as a versatile and powerful framework for advancing quantum machine learning and discrete optimization, supporting both pre-deployment benchmarking on classical hardware and algorithm design for next-generation quantum devices. This work provides a foundation for the further exploration of scalable quantum-classical hybrid algorithms, with implications for quantum simulation, optimization, and beyond.