An Efficient Gradient Sensitive Alternate Framework for VQE with Variable Ansatz

• URL: http://arxiv.org/abs/2205.03031v2
• Date: Wed, 15 Jun 2022 09:39:01 GMT
• Title: An Efficient Gradient Sensitive Alternate Framework for VQE with Variable Ansatz
• Authors: Ze-Tong Li, Fan-Xu Meng, Han Zeng, Zai-Chen Zhang, Xu-Tao Yu
• Abstract summary: We propose a gradient-sensitive alternate framework with variable ansatz to enhance the performance of the Variational quantum eigensolver (VQE) We show that our framework shows considerably improvement of the error of the found solution by up to 87.9% compared with the hardware-efficient ansatz.
• Score: 13.360755226969678
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum eigensolver (VQE), aiming at determining the ground state energy of a quantum system described by a Hamiltonian on noisy intermediate scale quantum (NISQ) devices, is among the most significant applications of variational quantum algorithms (VQAs). However, the accuracy and trainability of the current VQE algorithm are significantly influenced due to the barren plateau (BP), the non-negligible gate error and limited coherence time in NISQ devices. To tackle these issues, a gradient-sensitive alternate framework with variable ansatz is proposed in this paper to enhance the performance of the VQE. We first propose a theoretical framework for VA-VQE via alternately solving a multi-objective optimization problem and the original VQE, where the multi-objective optimization problem is defined with respect to cost function values and gradient magnitudes. Then, we propose a novel implementation method based on the double $\epsilon$-greedy strategy with the candidate tree and modified multi-objective genetic algorithm. As a result, the local optima are avoided both in ansatz and parameter perspectives, and the stability of output ansatz is enhanced. The experimental results indicate that our framework shows considerably improvement of the error of the found solution by up to 87.9% compared with the hardware-efficient ansatz. Furthermore, compared with the full-randomized VA-VQE implementation, our framework is able to obtain the improvement of the error and the stability by up to 36.0% and 58.7%, respectively, with similar quantum costs.

Related papers

• Entanglement Distribution Delay Optimization in Quantum Networks with Distillation [51.53291671169632]
  Quantum networks (QNs) distribute entangled states to enable distributed quantum computing and sensing applications. QS resource allocation framework is proposed to enhance the end-to-end (e2e) fidelity and satisfy minimum rate and fidelity requirements.
  arXiv  Detail & Related papers  (2024-05-15T02:04:22Z)
• 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)
• Variational Quantum Eigensolver with Constraints (VQEC): Solving Constrained Optimization Problems via VQE [0.0]
  Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks. This work proposes a hybrid quantum-classical algorithmic paradigm termed VQEC to handle optimization with constraints.
  arXiv  Detail & Related papers  (2023-11-14T19:49:09Z)
• Distributionally Robust Variational Quantum Algorithms with Shifted Noise [9.705847892362165]
  We show how to optimize variational quantum algorithms (VQAs) to be robust against unknown shifted noise. This work is the first step towards improving the reliability of VQAs influenced by shifted noise.
  arXiv  Detail & Related papers  (2023-08-28T23:19:57Z)
• Benchmarking Adaptative Variational Quantum Algorithms on QUBO Instances [0.0]
  Adaptative VQAs dynamically modify the circuit structure by adding and removing, and optimize their parameters during the training. We analyze three Adaptative VQAs: Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices.
  arXiv  Detail & Related papers  (2023-08-03T14:39:02Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers [0.6946929968559495]
  Variational quantum eigensolver (VQE) finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum circuits called ansatz. This work provides a systematic way to analyze energies for VQE and contribute to the design of ansatz and its initial parameters.
  arXiv  Detail & Related papers  (2021-09-24T06:09:10Z)
• Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
  We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms. We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
  arXiv  Detail & Related papers  (2021-04-20T13:51:08Z)
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers [5.644434841659249]
  We propose an iterative Layer VQE (L-VQE) approach, inspired by the Variational Quantum Eigensolver (VQE) We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.
  arXiv  Detail & Related papers  (2021-02-10T16:53:22Z)
• 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 circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.