Efficient Parabolic Optimisation Algorithm for adaptive VQE implementations

• URL: http://arxiv.org/abs/2110.12756v1
• Date: Mon, 25 Oct 2021 09:36:56 GMT
• Title: Efficient Parabolic Optimisation Algorithm for adaptive VQE implementations
• Authors: V. Armaos, Dimitrios A. Badounas, Paraskevas Deligiannis, Konstantinos Lianos, Yordan S. Yordanov
• Abstract summary: Variational Quantum Eigensolver (VQE) is one of the most promising applications of quantum computing. We introduce the parabolic optimiser that we designed specifically for the needs of VQE.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Computational chemistry is one of the most promising applications of quantum computing, mostly thanks to the development of the Variational Quantum Eigensolver (VQE) algorithm. VQE is being studied extensively and numerous optimisations of VQE's sub-processes have been suggested, including the encoding methods and the choice of excitations. Recently, adaptive methods were introduced that apply each excitation iteratively. When it comes to adaptive VQE, research is focused on the choice of excitation pool and the strategies for choosing each excitation. Here we focus on a usually overlooked component of VQE, which is the choice of the classical optimisation algorithm. We introduce the parabolic optimiser that we designed specifically for the needs of VQE. This includes both an 1-D and an n-D optimiser that can be used either for adaptive or traditional VQE implementations. We then continue to benchmark the parabolic optimiser against Nelder-Mead for various implementations of VQE. We found that the parabolic optimiser performs significantly better than traditional optimisation methods, requiring fewer CNOTs and fewer quantum experiments to achieve a given energy accuracy.

Related papers

• An Adaptive Weighted QITE-VQE Algorithm for Combinatorial Optimization Problems [0.0]
  We propose an Adaptive Weighted QITE-VQE (AWQV) algorithm that integrates the VQE gradients with the cQITE updates through an adaptive weighting scheme during optimization. AWQV achieves near-optimal approximation ratios, while for weighted ErdHos-R'enyi instances, it outperforms the classical Goemans-Williamson algorithm.
  arXiv  Detail & Related papers  (2025-04-14T19:05:16Z)
• Solving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer [0.0]
  Block ENcoding Quantum (BEQO) is a hybrid quantum solver that uses block encoding to represent the cost function. Our findings confirm that BENQO performs significantly better than QAOA and competes with VQE across a variety of performance metrics.
  arXiv  Detail & Related papers  (2024-04-22T10:10:29Z)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• 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)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• Evolutionary Solution Adaption for Multi-Objective Metal Cutting Process Optimization [59.45414406974091]
  We introduce a framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks. We study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, that optimize solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, that accommodates different possibilities that can be activated or deactivated. Results show that adaption with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal, while the proposed variants further improve the adaption costs.
  arXiv  Detail & Related papers  (2023-05-31T12:07:50Z)
• Study of Adaptative Derivative-Assemble Pseudo-Trotter Ansatzes in VQE through qiskit API [0.0]
  Variational Quantum Algorithms (VQAs) were designed to answer the problem of Quantum Phase Estimation Algorithm. ADAPT-VQE determines a quasi-optimal ansatz with a minimal number of parameters. We will compare all of these algorithms on different criterions such as the number of parameters, the accuracy or the number of CNOT gate used on H2 and LiH molecules.
  arXiv  Detail & Related papers  (2022-10-25T16:53:14Z)
• An Empirical Review of Optimization Techniques for Quantum Variational Circuits [0.0]
  Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware. Standard approaches to optimizing these circuits rely on a classical system to compute the new parameters at every optimization step. We empirically evaluate the potential of many common gradient and frees on a variety of optimization tasks.
  arXiv  Detail & Related papers  (2022-02-03T03:20:54Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Classically optimal variational quantum algorithms [0.0]
  Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQA), are suitable for implementation on NISQ computers. In this Letter we expand an implicit step of VQAs: the classical pre-computation subroutine which can non-trivially use classical algorithms to simplify, transform, or specify problem instance-specific variational quantum circuits.
  arXiv  Detail & Related papers  (2021-03-31T13:33:38Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• 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.