Escaping Barren Plateaus in Variational Quantum Algorithms Using Negative Learning Rate in Quantum Internet of Things
Ratun Rahman, Dinh C. Nguyen

TL;DR
This paper introduces a novel optimization technique for Variational Quantum Algorithms in Quantum Internet of Things devices, using negative learning rates to escape barren plateaus and improve training efficiency.
Contribution
It proposes a new method that incorporates negative learning rates to overcome barren plateaus in VQAs, enhancing scalability and robustness in resource-constrained QIoT settings.
Findings
Improved convergence in VQA benchmarks.
Theoretical analysis of negative learning effects.
Enhanced gradient recovery during training.
Abstract
Variational Quantum Algorithms (VQAs) are becoming the primary computational primitive for next-generation quantum computers, particularly those embedded as resource-constrained accelerators in the emerging Quantum Internet of Things (QIoT). However, under such device-constrained execution conditions, the scalability of learning is severely limited by barren plateaus, where gradients collapse to zero and training stalls. This poses a practical challenge to delivering VQA-enabled intelligence on QIoT endpoints, which often have few qubits, constrained shot budgets, and strict latency requirements. In this paper, we present a novel approach for escaping barren plateaus by including negative learning rates into the optimization process in QIoT devices. Our method introduces controlled instability into model training by switching between positive and negative learning phases, allowing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
