Modified Conjugate Quantum Natural Gradient

• URL: http://arxiv.org/abs/2501.05847v1
• Date: Fri, 10 Jan 2025 10:37:40 GMT
• Title: Modified Conjugate Quantum Natural Gradient
• Authors: Mourad Halla,
• Abstract summary: Modified Conjugate Quantum Natural Gradient (CQNG) is an optimization algorithm that integrates QNG with principles from the nonlinear conjugate gradient method. CQNG achieves faster convergence than QNG across various optimization scenarios, even when strict conjugacy conditions are not always satisfied.
• Score: 0.0
• License:
• Abstract: The efficient optimization of variational quantum algorithms (VQAs) is critical for their successful application in quantum computing. The Quantum Natural Gradient (QNG) method, which leverages the geometry of quantum state space, has demonstrated improved convergence compared to standard gradient descent [Quantum 4, 269 (2020)]. In this work, we introduce the Modified Conjugate Quantum Natural Gradient (CQNG), an optimization algorithm that integrates QNG with principles from the nonlinear conjugate gradient method. Unlike QNG, which employs a fixed learning rate, CQNG dynamically adjusts hyperparameters at each step, enhancing both efficiency and flexibility. Numerical simulations show that CQNG achieves faster convergence than QNG across various optimization scenarios, even when strict conjugacy conditions are not always satisfied -- hence the term ``Modified Conjugate.'' These results highlight CQNG as a promising optimization technique for improving the performance of VQAs.

Related papers

• Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits [0.0]
  We extend the Quantum Natural Gradient (QNG) method by introducing higher-order and geodesic corrections. Our approach paves the way for more efficient quantum algorithms, leveraging the advantages of geometric methods.
  arXiv  Detail & Related papers  (2024-09-05T15:54:02Z)
• 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. Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Experimental quantum natural gradient optimization in photonics [11.72584828456107]
  Variational quantum algorithms (VQAs) promise practical quantum applications in the Noisy Intermediate-Scale Quantum era. The quantum natural gradient (QNG) can achieve faster convergence and avoid local minima more easily. We utilize a fully programmable photonic chip to experimentally estimate the QNG in photonics for the first time.
  arXiv  Detail & Related papers  (2023-10-11T10:41:51Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Normalized Gradient Descent for Variational Quantum Algorithms [4.403985869332685]
  Vari quantum algorithms (VQAs) are promising methods that leverage noisy quantum computers. NGD method, which employs the normalized gradient vector to update the parameters, has been successfully utilized in several optimization problems. We propose a new NGD that can attain the faster convergence than the ordinary NGD.
  arXiv  Detail & Related papers  (2021-06-21T11:03:12Z)
• Optimal training of variational quantum algorithms without barren plateaus [0.0]
  Variational quantum algorithms (VQAs) promise efficient use of near-term quantum computers. We show how to optimally train a VQA for learning quantum states. We propose the application of Gaussian kernels for quantum machine learning.
  arXiv  Detail & Related papers  (2021-04-29T17:54:59Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.