Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver

• URL: http://arxiv.org/abs/2504.04932v1
• Date: Mon, 07 Apr 2025 11:18:09 GMT
• Title: Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver
• Authors: Chenyu Shi, Vedran Dunjko, Hao Wang,
• Abstract summary: Variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices.<n>We propose a weighted Approximate Quantum Natural Gradient (WA-QNG) method tailored for $k$ of local Hamiltonians.
• Score: 5.873113584103881
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices, designed to find the ground state of a Hamiltonian. In VQE, a classical optimizer iteratively updates the parameters in the quantum circuit. Among various optimization methods, quantum natural gradient descent (QNG) stands out as a promising optimization approach for VQE. However, standard QNG only leverages the quantum Fisher information of the entire system and treats each subsystem equally in the optimization process, without accounting for the different weights and contributions of each subsystem corresponding to each observable. To address this limitation, we propose a Weighted Approximate Quantum Natural Gradient (WA-QNG) method tailored for $k$-local Hamiltonians. In this paper, we theoretically analyze the potential advantages of WA-QNG compared to QNG from three distinct perspectives and reveal its connection with the Gauss-Newton method. We also show it outperforms standard quantum natural gradient descent in the numerical experiments for seeking the ground state of the Hamiltonian.

Related papers

• Quantum natural gradient with thermal-state initialization [3.481985817302898]
  We provide exact methods to compute three quantum generalizations of the Fisher information matrix-the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrix-for PQCs with thermal states.<n>We prove that these matrix elements can be estimated using quantum algorithms combining the Hadamard test, classical random sampling, and Hamiltonian simulation.
  arXiv  Detail & Related papers  (2025-02-26T19:00:05Z)
• A Quantum Approximate Optimization Algorithm for Local Hamiltonian Problems [0.0]
  Local Hamiltonian Problems (LHPs) are important problems that are computationally-complete and physically relevant for many-body quantum systems. We propose and analyze a quantum approximation which we call the Hamiltonian Quantum Approximate Optimization Algorithm (HamQAOA) Our results indicate that the linear-depth HamQAOA can deterministically prepare exact ground states of 1-dimensional antiferromagnetic Heisenberg spin chains.
  arXiv  Detail & Related papers  (2024-12-12T12:22:08Z)
• 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.<n>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)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Truncation technique for variational quantum eigensolver for Molecular Hamiltonians [0.0]
  variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices. We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
  arXiv  Detail & Related papers  (2024-02-02T18:45:12Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• 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)
• 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)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Variational Quantum Eigensolver for Frustrated Quantum Systems [0.0]
  A variational quantum eigensolver, or VQE, is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits.
  arXiv  Detail & Related papers  (2020-05-01T18:00:01Z)

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.