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:2309.14980

Statistical Analysis of Quantum State Learning Process in Quantum Neural Networks

Hao-kai Zhang, Chenghong Zhu, Mingrui Jing, Xin Wang

Published Sep 26, 2023• 3 citations
arXivHTMLPDF

Abstract

Quantum neural networks (QNNs) have been a promising framework in pursuing near-term quantum advantage in various fields, where many applications can be viewed as learning a quantum state that encodes useful data. As a quantum analog of probability distribution learning, quantum state learning is theoretically and practically essential in quantum machine learning. In this paper, we develop a no-go theorem for learning an unknown quantum state with QNNs even starting from a high-fidelity initial state. We prove that when the loss value is lower than a critical threshold, the probability of avoiding local minima vanishes exponentially with the qubit count, while only grows polynomially with the circuit depth. The curvature of local minima is concentrated to the quantum Fisher information times a loss-dependent constant, which characterizes the sensibility of the output state with respect to parameters in QNNs. These results hold for any circuit structures, initialization strategies, and work for both fixed ansatzes and adaptive methods. Extensive numerical simulations are performed to validate our theoretical results. Our findings place generic limits on good initial guesses and adaptive methods for improving the learnability and scalability of QNNs, and deepen the understanding of prior information's role in QNNs.

DOI
10.48550/arxiv.2309.14980

Related papers

Exponential Hardness of Optimization from the Locality in Quantum Neural Networks

Hao-Kai Zhang, Chengkai Zhu, Geng Liu +1 more

Quantum neural networks (QNNs) have become a leading paradigm for establishing near-term quantum applications in recent years. The trainability issue of QNNs has garnered extensive attention, spurring demand for a comprehensive analysis of QNNs in order to identify viable solutions. In this work, we propose a perspective that characterizes the trainability of QNNs based on their locality. We prove that the entire variation range of the loss function via adjusting any local quantum gate vanishes exponentially in the number of qubits with a high probability for a broad class of QNNs. This result reveals extra harsh constraints independent of gradients and unifies the restrictions on gradient-based and gradient-free optimizations naturally. We showcase the validity of our results with numerical simulations of representative models and examples. Our findings, as a fundamental property of random quantum circuits, deepen the understanding of the role of locality in QNNs and serve as a guideline for assessing the effectiveness of diverse training strategies for quantum neural networks.

Proceedings of the AAAI Conference on Artificial Intelligence•Mar 24, 2024•6 citations

Exponentially Many Local Minima in Quantum Neural Networks

Xuchen You, Xiaodi Wu

Quantum Neural Networks (QNNs), or the so-called variational quantum circuits, are important quantum applications both because of their similar promises as classical neural networks and because of the feasibility of their implementation on near-term intermediate-size noisy quantum machines (NISQ). However, the training task of QNNs is challenging and much less understood. We conduct a quantitative investigation on the landscape of loss functions of QNNs and identify a class of simple yet extremely hard QNN instances for training. Specifically, we show for typical under-parameterized QNNs, there exists a dataset that induces a loss function with the number of spurious local minima depending exponentially on the number of parameters. Moreover, we show the optimality of our construction by providing an almost matching upper bound on such dependence. While local minima in classical neural networks are due to non-linear activations, in quantum neural networks local minima appear as a result of the quantum interference phenomenon. Finally, we empirically confirm that our constructions can indeed be hard instances in practice with typical gradient-based optimizers, which demonstrates the practical value of our findings.

arXiv:2110.02479•International Conference on Machine Learning•Oct 6, 2021•32 citations

Quantum Neural Networks: Adaptive Learning Strategies

Jincheng Zhang

Quantum Neural Networks (QNNs) represent a promising paradigm shift in machine learning, leveraging the unique properties of quantum mechanics to potentially surpass classical neural networks. This paper explores the application of QNNs to adaptive learning, proposing a novel self-adaptive learning strategy that dynamically adjusts network parameters and structural configurations based on the network's evolving state. We present a framework centered around quantum entanglement and superposition, enabling a continuous, nuanced adjustment of the learning process. The core mechanism focuses on leveraging the inherent quantum properties to optimize learning efficiency. We demonstrate the efficacy of this approach through simulations and preliminary experiments, illustrating a significant improvement in learning speed and robustness compared to traditional approaches. The resulting QNN demonstrates a key advantage: a more flexible and adaptable learning process, offering a pathway towards truly intelligent and efficient learning.

•Sep 3, 2026•0 citations

Stability and Generalization of Quantum Neural Networks

Jiaqi Yang, Wei Xie, Xiaohua Xu

Quantum neural networks (QNNs) play an important role as an emerging technology in the rapidly growing field of quantum machine learning. While their empirical success is evident, the theoretical explorations of QNNs, particularly their generalization properties, are less developed and primarily focus on the uniform convergence approach. In this paper, we exploit an advanced tool in classical learning theory, i.e., algorithmic stability, to study the generalization of QNNs. We first establish high-probability generalization bounds for QNNs via uniform stability. Our bounds shed light on the key factors influencing the generalization performance of QNNs and provide practical insights into both the design and training processes. We next explore the generalization of QNNs on near-term noisy intermediate-scale quantum (NISQ) devices, highlighting the potential benefits of quantum noise. Moreover, we argue that our previous analysis characterizes worst-case generalization guarantees, and we establish a refined optimization-dependent generalization bound for QNNs via on-average stability. Numerical experiments on various real-world datasets support our theoretical findings.

arXiv:2501.12737•Jan 22, 2025•10 citations

Quantum Neural Network Integrating with Gradient Descent Techniques for Enhanced Learning

Pellakuri Vidyullatha, G S Pradeep Ghantasala, Rajesh Sharma R +2 more

Quantum Machine Learning refers to the interdisciplinary area of research, blending principles from quantum physics and machine learning that can process information on quantum computers. Quantum machine learning (QML) intentions to exploit the superposition (qubit can exist in multiple states) property and other effects of quantum mechanics for enhanced efficiency and speed in specific machine learning computations, promising exponential-power superiority in particular computations. This paper focusses on Quantum Machine Learning Models to develop the framework to learn complicated associations within the data through the adjustment of the variational parameters during training. This framework serves as a foundational structure for implementing quantum neural networks, allowing for further experimentation and growth in quantum machine learning applications. It highlights the quantum circuits to process and learn from data in a mode distinct from classical neural networks. As the retrieve of quantum computing grows, such frameworks can be adapted and expanded to explore more sophisticated quantum algorithms and architectures. In the circumstances of Quantum Neural Networks, gradient descents is used in minimizing cost or loss function by iteratively adjusting the variational parameters based onto the gradient of the loss with admire to those parameters. The output that indicates the process of installing the Quantum information science Kit (Qiskit) library in Python specifically version 3.7 along with its dependencies.

International Conference on Computing for Sustainable Global Development•Apr 2, 2025•1 citation

Variational Learning for Quantum Artificial Neural Networks

Francesco Tacchino, Stefano Mangini, Panagiotis Kl. Barkoutsos +4 more

In the past few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of quantum machine learning aims at bringing together these two ongoing revolutions. Here, we first review a series of recent works describing the implementation of artificial neurons and feedforward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. We investigate different learning strategies involving global and local layerwise cost functions, and we assess their performances also in the presence of statistical measurement noise. While keeping full compatibility with the overall memory-efficient feedforward architecture, our constructions effectively reduce the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach toward the use of quantum neural networks for pattern classification on near-term quantum hardware.

arXiv:2103.02498•IEEE Transactions on Quantum Engineering•Jan 1, 2021•59 citations
Quantum neural networks (QNNs) have been a promising framework in pursuing near-term quantum advantage in various fields, where many applications can be viewed as learning a quantum state that encodes useful data. As a quantum analog of probability distribution learning, quantum state learning is theoretically and practically essential in quantum machine learning. In this paper, we develop a no-go theorem for learning an unknown quantum state with QNNs even starting from a high-fidelity initial state. We prove that when the loss value is lower than a critical threshold, the probability of avoiding local minima vanishes exponentially with the qubit count, while only grows polynomially with the circuit depth. The curvature of local minima is concentrated to the quantum Fisher information times a loss-dependent constant, which characterizes the sensibility of the output state with respect to parameters in QNNs. These results hold for any circuit structures, initialization strategies, and work for both fixed ansatzes and adaptive methods. Extensive numerical simulations are performed to validate our theoretical results. Our findings place generic limits on good initial guesses and adaptive methods for improving the learnability and scalability of QNNs, and deepen the understanding of prior information's role in QNNs.
Quantum neural networks (QNNs) have become a leading paradigm for establishing near-term quantum applications in recent years. The trainability issue of QNNs has garnered extensive attention, spurring demand for a comprehensive analysis of QNNs in order to identify viable solutions. In this work, we propose a perspective that characterizes the trainability of QNNs based on their locality. We prove that the entire variation range of the loss function via adjusting any local quantum gate vanishes exponentially in the number of qubits with a high probability for a broad class of QNNs. This result reveals extra harsh constraints independent of gradients and unifies the restrictions on gradient-based and gradient-free optimizations naturally. We showcase the validity of our results with numerical simulations of representative models and examples. Our findings, as a fundamental property of random quantum circuits, deepen the understanding of the role of locality in QNNs and serve as a guideline for assessing the effectiveness of diverse training strategies for quantum neural networks.
Quantum Neural Networks (QNNs), or the so-called variational quantum circuits, are important quantum applications both because of their similar promises as classical neural networks and because of the feasibility of their implementation on near-term intermediate-size noisy quantum machines (NISQ). However, the training task of QNNs is challenging and much less understood. We conduct a quantitative investigation on the landscape of loss functions of QNNs and identify a class of simple yet extremely hard QNN instances for training. Specifically, we show for typical under-parameterized QNNs, there exists a dataset that induces a loss function with the number of spurious local minima depending exponentially on the number of parameters. Moreover, we show the optimality of our construction by providing an almost matching upper bound on such dependence. While local minima in classical neural networks are due to non-linear activations, in quantum neural networks local minima appear as a result of the quantum interference phenomenon. Finally, we empirically confirm that our constructions can indeed be hard instances in practice with typical gradient-based optimizers, which demonstrates the practical value of our findings.
Quantum Neural Networks (QNNs) represent a promising paradigm shift in machine learning, leveraging the unique properties of quantum mechanics to potentially surpass classical neural networks. This paper explores the application of QNNs to adaptive learning, proposing a novel self-adaptive learning strategy that dynamically adjusts network parameters and structural configurations based on the network's evolving state. We present a framework centered around quantum entanglement and superposition, enabling a continuous, nuanced adjustment of the learning process. The core mechanism focuses on leveraging the inherent quantum properties to optimize learning efficiency. We demonstrate the efficacy of this approach through simulations and preliminary experiments, illustrating a significant improvement in learning speed and robustness compared to traditional approaches. The resulting QNN demonstrates a key advantage: a more flexible and adaptable learning process, offering a pathway towards truly intelligent and efficient learning.
Quantum neural networks (QNNs) play an important role as an emerging technology in the rapidly growing field of quantum machine learning. While their empirical success is evident, the theoretical explorations of QNNs, particularly their generalization properties, are less developed and primarily focus on the uniform convergence approach. In this paper, we exploit an advanced tool in classical learning theory, i.e., algorithmic stability, to study the generalization of QNNs. We first establish high-probability generalization bounds for QNNs via uniform stability. Our bounds shed light on the key factors influencing the generalization performance of QNNs and provide practical insights into both the design and training processes. We next explore the generalization of QNNs on near-term noisy intermediate-scale quantum (NISQ) devices, highlighting the potential benefits of quantum noise. Moreover, we argue that our previous analysis characterizes worst-case generalization guarantees, and we establish a refined optimization-dependent generalization bound for QNNs via on-average stability. Numerical experiments on various real-world datasets support our theoretical findings.
Quantum Machine Learning refers to the interdisciplinary area of research, blending principles from quantum physics and machine learning that can process information on quantum computers. Quantum machine learning (QML) intentions to exploit the superposition (qubit can exist in multiple states) property and other effects of quantum mechanics for enhanced efficiency and speed in specific machine learning computations, promising exponential-power superiority in particular computations. This paper focusses on Quantum Machine Learning Models to develop the framework to learn complicated associations within the data through the adjustment of the variational parameters during training. This framework serves as a foundational structure for implementing quantum neural networks, allowing for further experimentation and growth in quantum machine learning applications. It highlights the quantum circuits to process and learn from data in a mode distinct from classical neural networks. As the retrieve of quantum computing grows, such frameworks can be adapted and expanded to explore more sophisticated quantum algorithms and architectures. In the circumstances of Quantum Neural Networks, gradient descents is used in minimizing cost or loss function by iteratively adjusting the variational parameters based onto the gradient of the loss with admire to those parameters. The output that indicates the process of installing the Quantum information science Kit (Qiskit) library in Python specifically version 3.7 along with its dependencies.
In the past few years, quantum computing and machine learning fostered rapid developments in their respective areas of application, introducing new perspectives on how information processing systems can be realized and programmed. The rapidly growing field of quantum machine learning aims at bringing together these two ongoing revolutions. Here, we first review a series of recent works describing the implementation of artificial neurons and feedforward neural networks on quantum processors. We then present an original realization of efficient individual quantum nodes based on variational unsampling protocols. We investigate different learning strategies involving global and local layerwise cost functions, and we assess their performances also in the presence of statistical measurement noise. While keeping full compatibility with the overall memory-efficient feedforward architecture, our constructions effectively reduce the quantum circuit depth required to determine the activation probability of single neurons upon input of the relevant data-encoding quantum states. This suggests a viable approach toward the use of quantum neural networks for pattern classification on near-term quantum hardware.