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

IEEE Transactions on Quantum Engineering

Relative Entropy-Based Training of Quantum Neural Networks

Subhadeep Mondal, Amit Kumar Dutta

Published Dec 1, 2025• 0 citations
Publisher

Abstract

Quantum neural networks (QNNs) are gaining attention as versatile models for quantum machine learning, but training them effectively remains a challenge. Most existing approaches, such as quantum multi-layer perceptrons (MLPs), use fidelity-based cost functions. While well-suited for pure states, these measures are less reliable when inputs and outputs are mixed states—a situation common in learning quantum channels. In this work, we introduce a training framework built on a relative entropyinspired cost function. By quantifying the directional divergence between learned and target states, relative entropy provides a more informative and principled measure than linear fidelity, naturally capturing both spectral and eigenvector differences in mixed states. This approach preserves the completely positive (CP) structure of the network, supports efficient back-propagation in layered QNN configurations, and achieves improved accuracy and convergence over fidelity-based training. These results highlight entropy-based optimization as a promising path toward scalable, robust, and noise-resilient quantum learning.

DOI
10.1109/tqe.2025.3638878

Related papers

A Quantum Approach to Neural Networks

Prof. Ahlam Ansari, Ashhar Shaikh, Faraz Shaikh +1 more

Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.

International Journal of Advanced Research in Science Communication and Technology•May 12, 2021•0 citations

Hybrid Quantum-Classical Training in Quantum Neural Networks: A Framework for Bridging Parameterized Quantum Circuits and Classical Optimization

Matthew Busel

Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.

•Mar 3, 2026•0 citations

Reliability Research on Quantum Neural Networks

Yulu Zhang, Hua Cai Lu

Quantum neural networks (QNNs) leverage the strengths of both quantum computing and neural networks, offering solutions to challenges that are often beyond the reach of traditional neural networks. QNNs are being used in areas such as computer games, function approximation, and big data processing. Moreover, quantum neural network algorithms are finding utility in social network modeling, associative memory systems, and automatic control mechanisms. Nevertheless, ensuring the reliability of quantum neural networks is crucial as it directly influences network performance and stability. To investigate the reliability of quantum neural networks, this paper proposes a methodology wherein operator measurements are performed on the final states of the output quantum states of a quantum neural network. The proximity of these measurements to the target value is compared, and the fidelity value, combined with a quantum gate operation, is utilized to assess the reliability of the quantum neural network. Through network training, the results demonstrate that, under optimal parameters, both the fidelity of the final state measurement value and the target value of the model approach are approximately equal to 1. It indicates that training mitigates the errors stemming from encoding into the initial quantum state, thereby resulting in enhanced system reliability and accuracy.

Electronics•Apr 16, 2024•3 citations

DeepQMLP: A Scalable Quantum-Classical Hybrid Deep Neural Network Architecture for Classification

Mahabubul Alam, Swaroop Ghosh

Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.

arXiv:2202.01899•International Conference on VLSI Design•Feb 1, 2022•9 citations

Quantum Contextual Bandits: Integrating Bandit Exploration into Quantum Neural Network

Tianyi Chen, Shiva Raj Pokhrel, Jiang Fang +4 more

Supervised quantum learning methods face notable limitations in dynamic, real-world environments due to their reliance on static labels and limited adaptability. To address these challenges, we propose a novel online learning framework — Quantum Contextual Bandit (QCB) — that integrates quantum neural networks (QNNs) with contextual bandit (CB) algorithms. The QCB framework enables adaptive decision-making by incorporating bandit-based exploration into QNN training, making it particularly suitable for applications such as recommender systems. To mitigate the adverse effects of quantum noise—including depolarizing, Pauli, and shot noise, the framework leverages a gradient-free optimization approach, enhancing robustness and convergence stability. Experimental results on various datasets demonstrate that QCB consistently outperforms traditional QNN training methods with identical circuit architectures. Notably, the model achieves over 99% accuracy under ideal conditions and sustains high performance under noisy quantum environments. These results underscore the potential of QCB as a scalable, noise-resilient solution for adaptive learning in quantum machine learning systems.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 5, 2025•0 citations

Quantum Gradient Descent in Neural Network Training Optimization

Zacharias Rallis, Kyriakos Vougiouklis

Optimisation of training still faces challenges due to an ill-conditioned loss surface and noisy gradient signals; at the same time, limited computational resources also restrict training options. Quantum Gradient Descent as a Hybrid Optimisation Strategy for Neural Network Training. The proposed noise-resilient quantum gradient descent framework maps selected gradient components to parameterised quantum circuits, estimates directional derivatives via parameter-shift measurements, and returns stable updates to the classical optimizer. It is not directly substituted for backpropagation; instead, it is a type of controllable gradient module that can be added to sensitive layers or low-dimensional projection heads. Add adaptive shot scheduling, damped momentum and layer-wise trust constraints to reduce estimator variance and prevent unstable quantum updates. Representative classification tasks are selected as the subjects of experiments for convergence speed, validation accuracy, gradient fidelity, measurement cost and noise robustness. Based on the above analysis, the new optimizer outperforms standard SGD in terms of final accuracy by 1.6% - 3.2% when using the same number of epochs; at the same time, it reduces the median gradient variance by 28.4% and maintains stable convergence even with an increase in simulated depolarizing noise from 0.001 to 0.015. Based on the above, it can be seen that Quantum Gradient Descent is not an all-purpose optimizer but rather a target-specific training accelerator for gradient-sensitive modules that can trade off sampling cost for more informative descent directions in measurement-aware update design.

Journal of Applied Automation Technologies•Aug 24, 2023•0 citations
Quantum neural networks (QNNs) are gaining attention as versatile models for quantum machine learning, but training them effectively remains a challenge. Most existing approaches, such as quantum multi-layer perceptrons (MLPs), use fidelity-based cost functions. While well-suited for pure states, these measures are less reliable when inputs and outputs are mixed states—a situation common in learning quantum channels. In this work, we introduce a training framework built on a relative entropyinspired cost function. By quantifying the directional divergence between learned and target states, relative entropy provides a more informative and principled measure than linear fidelity, naturally capturing both spectral and eigenvector differences in mixed states. This approach preserves the completely positive (CP) structure of the network, supports efficient back-propagation in layered QNN configurations, and achieves improved accuracy and convergence over fidelity-based training. These results highlight entropy-based optimization as a promising path toward scalable, robust, and noise-resilient quantum learning.
Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.
Quantum Neural Networks (QNNs) represent a compelling convergence of quantum mechanics and machine learning, yet their practical deployment remains constrained by noise, limited qubit counts, and the cost of full quantum execution. Hybrid quantum-classical (HQC) training offers a pragmatic path forward: parameterized quantum circuits (PQCs) process information in exponentially large Hilbert spaces while classical optimizers update parameters via gradient methods accessible on today's hardware. We present a modular HQC training framework, formalising the parameter-shift rule for hardware-compatible gradient estimation, characterising the barren-plateau phenomenon through a variance-decay analysis, and introducing noise-aware training strategies for NISQ devices. Empirical results from state-vector and shot-based simulation confirm measurable quantum advantage on quantum-structured tasks, with the phase classification benchmark improving +12.1% over a classical MLP baseline. The accompanying open-source library provides a clean abstraction between quantum simulation and classical optimisation, serving as a foundation for near-term quantum machine learning research.
Quantum neural networks (QNNs) leverage the strengths of both quantum computing and neural networks, offering solutions to challenges that are often beyond the reach of traditional neural networks. QNNs are being used in areas such as computer games, function approximation, and big data processing. Moreover, quantum neural network algorithms are finding utility in social network modeling, associative memory systems, and automatic control mechanisms. Nevertheless, ensuring the reliability of quantum neural networks is crucial as it directly influences network performance and stability. To investigate the reliability of quantum neural networks, this paper proposes a methodology wherein operator measurements are performed on the final states of the output quantum states of a quantum neural network. The proximity of these measurements to the target value is compared, and the fidelity value, combined with a quantum gate operation, is utilized to assess the reliability of the quantum neural network. Through network training, the results demonstrate that, under optimal parameters, both the fidelity of the final state measurement value and the target value of the model approach are approximately equal to 1. It indicates that training mitigates the errors stemming from encoding into the initial quantum state, thereby resulting in enhanced system reliability and accuracy.
Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.
Supervised quantum learning methods face notable limitations in dynamic, real-world environments due to their reliance on static labels and limited adaptability. To address these challenges, we propose a novel online learning framework — Quantum Contextual Bandit (QCB) — that integrates quantum neural networks (QNNs) with contextual bandit (CB) algorithms. The QCB framework enables adaptive decision-making by incorporating bandit-based exploration into QNN training, making it particularly suitable for applications such as recommender systems. To mitigate the adverse effects of quantum noise—including depolarizing, Pauli, and shot noise, the framework leverages a gradient-free optimization approach, enhancing robustness and convergence stability. Experimental results on various datasets demonstrate that QCB consistently outperforms traditional QNN training methods with identical circuit architectures. Notably, the model achieves over 99% accuracy under ideal conditions and sustains high performance under noisy quantum environments. These results underscore the potential of QCB as a scalable, noise-resilient solution for adaptive learning in quantum machine learning systems.
Optimisation of training still faces challenges due to an ill-conditioned loss surface and noisy gradient signals; at the same time, limited computational resources also restrict training options. Quantum Gradient Descent as a Hybrid Optimisation Strategy for Neural Network Training. The proposed noise-resilient quantum gradient descent framework maps selected gradient components to parameterised quantum circuits, estimates directional derivatives via parameter-shift measurements, and returns stable updates to the classical optimizer. It is not directly substituted for backpropagation; instead, it is a type of controllable gradient module that can be added to sensitive layers or low-dimensional projection heads. Add adaptive shot scheduling, damped momentum and layer-wise trust constraints to reduce estimator variance and prevent unstable quantum updates. Representative classification tasks are selected as the subjects of experiments for convergence speed, validation accuracy, gradient fidelity, measurement cost and noise robustness. Based on the above analysis, the new optimizer outperforms standard SGD in terms of final accuracy by 1.6% - 3.2% when using the same number of epochs; at the same time, it reduces the median gradient variance by 28.4% and maintains stable convergence even with an increase in simulated depolarizing noise from 0.001 to 0.015. Based on the above, it can be seen that Quantum Gradient Descent is not an all-purpose optimizer but rather a target-specific training accelerator for gradient-sensitive modules that can trade off sampling cost for more informative descent directions in measurement-aware update design.