Quantum natural gradient without monotonicity

• URL: http://arxiv.org/abs/2401.13237v1
• Date: Wed, 24 Jan 2024 05:54:02 GMT
• Title: Quantum natural gradient without monotonicity
• Authors: Toi Sasaki, Hideyuki Miyahara
• Abstract summary: The quantum natural gradient (QNG) was introduced and utilized for noisy intermediate-scale devices. In this paper, we propose generalized QNG by removing the condition of monotonicity. We provide analytical and numerical evidence showing that non-monotone QNG based on the SLD metric in terms of convergence speed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Natural gradient (NG) is an information-geometric optimization method that plays a crucial role, especially in the estimation of parameters for machine learning models like neural networks. To apply NG to quantum systems, the quantum natural gradient (QNG) was introduced and utilized for noisy intermediate-scale devices. Additionally, a mathematically equivalent approach to QNG, known as the stochastic reconfiguration method, has been implemented to enhance the performance of quantum Monte Carlo methods. It is worth noting that these methods are based on the symmetric logarithmic derivative (SLD) metric, which is one of the monotone metrics. So far, monotonicity has been believed to be a guiding principle to construct a geometry in physics. In this paper, we propose generalized QNG by removing the condition of monotonicity. Initially, we demonstrate that monotonicity is a crucial condition for conventional QNG to be optimal. Subsequently, we provide analytical and numerical evidence showing that non-monotone QNG outperforms conventional QNG based on the SLD metric in terms of convergence speed.

Related papers

• Efficient Hamiltonian-aware Quantum Natural Gradient Descent for Variational Quantum Eigensolvers [4.918606409746505]
  Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices.<n>We propose Hamiltonian-aware Quantum Natural Gradient Descent (H-QNG)
  arXiv  Detail & Related papers  (2025-11-18T14:06:53Z)
• Information geometry of nonmonotonic quantum natural gradient [0.0]
  We investigate the properties of nonmonotonic quantum natural gradient (QNG)<n>Nonmonotonic QNG was shown to achieve faster convergence compared to conventional QNG.<n>We show that non-monotone quantum Fisher metrics can lead to faster convergence in QNG.
  arXiv  Detail & Related papers  (2025-10-21T04:27:10Z)
• Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver [5.873113584103881]
  Variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices. We propose a weighted Approximate Quantum Natural Gradient (WA-QNG) method tailored for $k$ of local Hamiltonians.
  arXiv  Detail & Related papers  (2025-04-07T11:18:09Z)
• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG force to demonstrate that its discrete-time solution gives a generalized form, which we call Momentum-QNG.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Random Natural Gradient [0.0]
  Quantum Natural Gradient (QNG) is a method that uses information about the local geometry of the quantum state-space. We propose two methods that reduce the resources/state preparations required for QNG, while keeping the advantages and performance of the QNG-based optimization.
  arXiv  Detail & Related papers  (2023-11-07T17:04:23Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• Stochastic approach for quantum metrology with generic Hamiltonians [0.0]
  We introduce a quantum-circuit-based approach for studying quantum metrology with generic Hamiltonians. We present a time-dependent parameter-shift rule for derivatives of evolved quantum states. In magnetic field estimations, we demonstrate the consistency between the results obtained from the parameter-shift rule and the exact results.
  arXiv  Detail & Related papers  (2022-04-03T11:46:06Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Chaos and Complexity from Quantum Neural Network: A study with Diffusion Metric in Machine Learning [0.0]
  We study the phenomena of quantum chaos and complexity in the machine learning dynamics of Quantum Neural Network (QNN) We employ a statistical and differential geometric approach to study the learning theory of QNN.
  arXiv  Detail & Related papers  (2020-11-16T10:41:47Z)
• Sinkhorn Natural Gradient for Generative Models [125.89871274202439]
  We propose a novel Sinkhorn Natural Gradient (SiNG) algorithm which acts as a steepest descent method on the probability space endowed with the Sinkhorn divergence. We show that the Sinkhorn information matrix (SIM), a key component of SiNG, has an explicit expression and can be evaluated accurately in complexity that scales logarithmically. In our experiments, we quantitatively compare SiNG with state-of-the-art SGD-type solvers on generative tasks to demonstrate its efficiency and efficacy of our method.
  arXiv  Detail & Related papers  (2020-11-09T02:51:17Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.