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:2201.08878 · Applied Soft Computing

Classical simulation of variational quantum classifiers using tensor rings

Dheeraj Peddireddy, Vipul Bansal, Vaneet Aggarwal

Published Apr 19, 2023• 20 citations
arXivHTMLPDF
DOI
10.1016/j.asoc.2023.110308

Related papers

Variational quantum tensor networks classifiers

Rui Huang, Xiaoqing Tan, Qingshan Xu

Neurocomputing•Apr 24, 2021•49 citations

Toward Acceleration of Variational Quantum Classifier Simulation on GPUs

Lan Anh Nguyen, Thai Anh Vo, Trang Nguyen +4 more

Communications in computer and information science•Aug 11, 2026•0 citations

Noisy tensor-ring approximation for computing gradients of a variational quantum eigensolver for combinatorial optimization

Dheeraj Peddireddy, Utkarsh Priyam, Vaneet Aggarwal

Variational quantum algorithms, especially quantum approximate optimization and the variational quantum eigensolver (VQE), have demonstrated their potential to provide computational advantage in the realm of combinatorial optimization. However, these algorithms suffer from classically intractable gradients limiting the scalability. This work addresses the scalability challenge for the VQE by proposing a classical gradient computation method which utilizes the parameter-shift rule but computes the expected values from the circuits using a tensor-ring approximation. The parametrized gates from the circuit transform the tensor ring by contracting the matrix along the free edges of the tensor ring. While the single-qubit gates do not alter the ring structure, the state transformations from the two-qubit rotations are evaluated by truncating the singular values, thereby preserving the structure of the tensor ring and reducing the computational complexity. This variation of the matrix-product-state approximation grows linearly in number of qubits and the number of two-qubit gates as opposed to the exponential growth in the classical simulations, allowing for a faster evaluation of the gradients on classical simulators.

arXiv:2307.03884•Physical Review A•Oct 30, 2023•5 citations

Tensor ring optimized quantum-enhanced tensor neural networks

Debanjan Konar, Dheeraj Peddireddy, Bijaya Ketan Panigrahi +1 more

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/ .

arXiv:2310.01515•Quantum Machine Intelligence•Apr 22, 2025•4 citations

On quantum ensembles of quantum classifiers

Amira Abbas, Maria Schuld, Francesco Petruccione

arXiv:2001.10833•Quantum Machine Intelligence•Jun 1, 2020•43 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
Variational quantum algorithms, especially quantum approximate optimization and the variational quantum eigensolver (VQE), have demonstrated their potential to provide computational advantage in the realm of combinatorial optimization. However, these algorithms suffer from classically intractable gradients limiting the scalability. This work addresses the scalability challenge for the VQE by proposing a classical gradient computation method which utilizes the parameter-shift rule but computes the expected values from the circuits using a tensor-ring approximation. The parametrized gates from the circuit transform the tensor ring by contracting the matrix along the free edges of the tensor ring. While the single-qubit gates do not alter the ring structure, the state transformations from the two-qubit rotations are evaluated by truncating the singular values, thereby preserving the structure of the tensor ring and reducing the computational complexity. This variation of the matrix-product-state approximation grows linearly in number of qubits and the number of two-qubit gates as opposed to the exponential growth in the classical simulations, allowing for a faster evaluation of the gradients on classical simulators.
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/ .
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.