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:2106.02593 · Quantum

Connecting geometry and performance of two-qubit parameterized quantum circuits

Amara Katabarwa, Sukin Sim, Dax Enshan Koh, Pierre-Luc Dallaire-Demers

Published Aug 23, 2022• 20 citations
arXivHTMLPDF

Abstract

Parameterized quantum circuits (PQCs) are a central component of many variational quantum algorithms, yet there is a lack of understanding of how their parameterization impacts algorithm performance. We initiate this discussion by using principal bundles to geometrically characterize two-qubit PQCs. On the base manifold, we use the Mannoury-Fubini-Study metric to find a simple equation relating the Ricci scalar (geometry) and concurrence (entanglement). By calculating the Ricci scalar during a variational quantum eigensolver (VQE) optimization process, this offers us a new perspective to how and why Quantum Natural Gradient outperforms the standard gradient descent. We argue that the key to the Quantum Natural Gradient's superior performance is its ability to find regions of high negative curvature early in the optimization process. These regions of high negative curvature appear to be important in accelerating the optimization process.

DOI
10.22331/q-2022-08-23-782

Related papers

On the geometry of Variational Quantum Algorithms: Hopf fibrations, entanglement and the natural gradient descent

Gustavo Schranck Habermann

Variational quantum algorithms were proposed as a strategy to obtain quantum advantage using the current state of the art quantum devices, the so called noisy intermediate scale quantum (NISQ) devices, by combining low-depth parameterized quantum circuits and classical optimization methods, such as the natural gradient descent. In this work we investigate geometrical aspects of variational quantum algorithms and the natural gradient descent in one and two qubits settings using tools of Riemannian geometry and information geometry, exploring the geometry of quantum states and the associated Hopf fibration structure as well as the behaviour of the natural gradient descent on statistical models contained in Riemannian manifolds. In addittion, recent results connecting entanglement, scalar curvature and two qubits parameterized quantum circuit performance are discussed and compared to our own calculations.

•Jul 11, 2024•0 citations

Sculpting Quantum Landscapes: Fubini-Study Metric Conditioning for Geometry-Aware Learning in Parameterized Quantum Circuits

Marwan Ait Haddou, Mohamed Bennai

Abstract We introduce a novel meta-learning framework that explicitly conditions the Fubini-Study (FS) metric tensor of Parameterized Quantum Circuits (PQCs) to address the challenges of barren plateaus in Variational Quantum Algorithms (VQAs). While VQAs offer a promising paradigm for near-term quantum computing, their practical efficacy is often limited by poorly conditioned optimization landscapes. Our theoretical analysis establishes that the logarithmic condition number of the FS metric is a pivotal geometric quantity governing trainability, optimization dynamics, and generalization bounds. We propose Sculpture, a classical meta-model that learns to generate data-dependent PQC initializations by minimizing logarithmic condition number, thereby promoting an isotropic and tractable parameter space. Empirical results demonstrate that meta-training successfully reduces logarithmic condition number from approximately 1.47 to 0.64, achieved by substantially increasing the minimum eigenvalue and slightly decreasing the maximum eigenvalue, effectively mitigating barren plateaus. This learned conditioning robustly generalizes to unseen data, consistently yielding well-conditioned PQC initializations. In a downstream hybrid quantum-classical classification task on the Kaggle diabetes dataset, we demonstrate that increasing the meta-scaling coefficient significantly enhances training efficiency, resulting in faster convergence, lower training loss, and reduced gradient norms. Crucially, higher meta-scaling coefficient values consistently yield superior generalization performance, with test accuracy sharply increasing from around 0.68 to over 0.78. Our findings confirm that sculpting the quantum landscape via meta-learning provides a principled form of geometric regularization, fundamentally improving the trainability, optimization dynamics, and generalization capabilities of PQCs. This work offers a powerful avenue for developing more robust and efficient VQAs.

arXiv:2506.21940•Jul 14, 2025•3 citations

Efficient Hamiltonian-aware Quantum Natural Gradient Descent for Variational Quantum Eigensolvers

Chenyu Shi, Hao Wang

The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.

quant-pharXiv:2511.14511•Quantum Machine Intelligence•Nov 19, 2025•1 citation

Quantum Natural Gradient

JAMES M. STOKES, Josh Izaac, Nathan Killoran +1 more

A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of the Quantum Geometric Tensor (QGT), also known as the Fubini-Study metric tensor. An efficient algorithm is presented for computing a block-diagonal approximation to the Fubini-Study metric tensor for parametrized quantum circuits, which may be of independent interest.

arXiv:1909.02108•Quantum•May 25, 2020•552 citations

Quantum natural gradient with thermal-state initialization

Michele Minervini, Dhrumil Patel, Mark M. Wilde

Parameterized quantum circuits (PQCs) are central to variational quantum algorithms (VQAs), yet their performance is hindered by complex loss landscapes that make their trainability challenging. Quantum natural gradient descent, which leverages the geometry of the parameterized space through quantum generalizations of the Fisher information matrix, offers a promising solution but has been largely limited to pure-state scenarios, with only approximate methods available for mixed-state settings. This paper addresses this question, originally posed in [Stokes et al., Quantum 4, 269 (2020)], by providing exact methods to compute three quantum generalizations of the Fisher information matrix-the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrices-for PQCs initialized with thermal states. We prove that these matrix elements can be estimated using quantum algorithms combining the Hadamard test, classical random sampling, and Hamiltonian simulation. By broadening the set of quantum generalizations of Fisher information and realizing their unbiased estimation, our results enable the implementation of quantum natural gradient descent algorithms for mixed-state PQCs, thereby enhancing the flexibility of optimization when using VQAs. Another immediate consequence of our findings is to establish fundamental limitations on the ability to estimate the parameters of a state generated by an unknown PQC, when given sample access to such a state.

arXiv:2502.19487•Physical Review A•Jul 7, 2025•6 citations

Enhancing Hybrid Methods in Parameterized Quantum Circuit Optimization

Joona V. Pankkonen, Matti Raasakka, Andrea Marchesin +1 more

Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.

arXiv:2510.08142•Oct 9, 2025•1 citation
Parameterized quantum circuits (PQCs) are a central component of many variational quantum algorithms, yet there is a lack of understanding of how their parameterization impacts algorithm performance. We initiate this discussion by using principal bundles to geometrically characterize two-qubit PQCs. On the base manifold, we use the Mannoury-Fubini-Study metric to find a simple equation relating the Ricci scalar (geometry) and concurrence (entanglement). By calculating the Ricci scalar during a variational quantum eigensolver (VQE) optimization process, this offers us a new perspective to how and why Quantum Natural Gradient outperforms the standard gradient descent. We argue that the key to the Quantum Natural Gradient's superior performance is its ability to find regions of high negative curvature early in the optimization process. These regions of high negative curvature appear to be important in accelerating the optimization process.
Variational quantum algorithms were proposed as a strategy to obtain quantum advantage using the current state of the art quantum devices, the so called noisy intermediate scale quantum (NISQ) devices, by combining low-depth parameterized quantum circuits and classical optimization methods, such as the natural gradient descent. In this work we investigate geometrical aspects of variational quantum algorithms and the natural gradient descent in one and two qubits settings using tools of Riemannian geometry and information geometry, exploring the geometry of quantum states and the associated Hopf fibration structure as well as the behaviour of the natural gradient descent on statistical models contained in Riemannian manifolds. In addittion, recent results connecting entanglement, scalar curvature and two qubits parameterized quantum circuit performance are discussed and compared to our own calculations.
Abstract We introduce a novel meta-learning framework that explicitly conditions the Fubini-Study (FS) metric tensor of Parameterized Quantum Circuits (PQCs) to address the challenges of barren plateaus in Variational Quantum Algorithms (VQAs). While VQAs offer a promising paradigm for near-term quantum computing, their practical efficacy is often limited by poorly conditioned optimization landscapes. Our theoretical analysis establishes that the logarithmic condition number of the FS metric is a pivotal geometric quantity governing trainability, optimization dynamics, and generalization bounds. We propose Sculpture, a classical meta-model that learns to generate data-dependent PQC initializations by minimizing logarithmic condition number, thereby promoting an isotropic and tractable parameter space. Empirical results demonstrate that meta-training successfully reduces logarithmic condition number from approximately 1.47 to 0.64, achieved by substantially increasing the minimum eigenvalue and slightly decreasing the maximum eigenvalue, effectively mitigating barren plateaus. This learned conditioning robustly generalizes to unseen data, consistently yielding well-conditioned PQC initializations. In a downstream hybrid quantum-classical classification task on the Kaggle diabetes dataset, we demonstrate that increasing the meta-scaling coefficient significantly enhances training efficiency, resulting in faster convergence, lower training loss, and reduced gradient norms. Crucially, higher meta-scaling coefficient values consistently yield superior generalization performance, with test accuracy sharply increasing from around 0.68 to over 0.78. Our findings confirm that sculpting the quantum landscape via meta-learning provides a principled form of geometric regularization, fundamentally improving the trainability, optimization dynamics, and generalization capabilities of PQCs. This work offers a powerful avenue for developing more robust and efficient VQAs.
The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for the ground state of a given Hamiltonian. The efficacy of VQEs largely depends on the optimizer employed. Recent studies suggest that Quantum Natural Gradient Descent (QNG) can achieve faster convergence than vanilla gradient descent (VG), but at the cost of additional quantum resources to estimate Fubini-Study metric tensor in each optimization step. The Fubini-Study metric tensor used in QNG is related to the entire quantum state space and does not incorporate information about the target Hamiltonian. To take advantage of the structure of the Hamiltonian and address the limitation of additional computational cost in QNG, we propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG). In H-QNG, we propose to use the Riemannian pullback metric induced from the lower-dimensional subspace spanned by the Hamiltonian terms onto the parameter space. We show that H-QNG inherits the desirable features of both approaches: the low quantum computational cost of VG and the reparameterization-invariance of QNG. We also validate its performance through numerical experiments on molecular Hamiltonians, showing that H-QNG achieves faster convergence to chemical accuracy while requiring fewer quantum computational resources.
A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of the Quantum Geometric Tensor (QGT), also known as the Fubini-Study metric tensor. An efficient algorithm is presented for computing a block-diagonal approximation to the Fubini-Study metric tensor for parametrized quantum circuits, which may be of independent interest.
Parameterized quantum circuits (PQCs) are central to variational quantum algorithms (VQAs), yet their performance is hindered by complex loss landscapes that make their trainability challenging. Quantum natural gradient descent, which leverages the geometry of the parameterized space through quantum generalizations of the Fisher information matrix, offers a promising solution but has been largely limited to pure-state scenarios, with only approximate methods available for mixed-state settings. This paper addresses this question, originally posed in [Stokes et al., Quantum 4, 269 (2020)], by providing exact methods to compute three quantum generalizations of the Fisher information matrix-the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrices-for PQCs initialized with thermal states. We prove that these matrix elements can be estimated using quantum algorithms combining the Hadamard test, classical random sampling, and Hamiltonian simulation. By broadening the set of quantum generalizations of Fisher information and realizing their unbiased estimation, our results enable the implementation of quantum natural gradient descent algorithms for mixed-state PQCs, thereby enhancing the flexibility of optimization when using VQAs. Another immediate consequence of our findings is to establish fundamental limitations on the ability to estimate the parameters of a state generated by an unknown PQC, when given sample access to such a state.
Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.