Variational Quantum Classifiers Through the Lens of the Hessian
Pinaki Sen, Amandeep Singh Bhatia, Kamalpreet Singh Bhangu, Ahmed, Elbeltagi

TL;DR
This paper explores the curvature and loss landscape of variational quantum classifiers by calculating and visualizing the Hessian, providing insights into their trainability and convergence behavior on quantum hardware.
Contribution
It introduces the analysis of the Hessian matrix for variational quantum classifiers, linking curvature information to training dynamics and convergence in quantum machine learning.
Findings
Hessian analysis reveals the loss landscape topology of VQCs.
Eigenvalues of the Hessian relate to trainability and convergence.
Adaptive Hessian learning rate improves training efficiency.
Abstract
In quantum computing, the variational quantum algorithms (VQAs) are well suited for finding optimal combinations of things in specific applications ranging from chemistry all the way to finance. The training of VQAs with gradient descent optimization algorithm has shown a good convergence. At an early stage, the simulation of variational quantum circuits on noisy intermediate-scale quantum (NISQ) devices suffers from noisy outputs. Just like classical deep learning, it also suffers from vanishing gradient problems. It is a realistic goal to study the topology of loss landscape, to visualize the curvature information and trainability of these circuits in the existence of vanishing gradients. In this paper, we calculate the Hessian and visualize the loss landscape of variational quantum classifiers at different points in parameter space. The curvature information of variational quantum…
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.
