A Comparison of Various Classical Optimizers for a Variational Quantum
Linear Solver
- URL: http://arxiv.org/abs/2106.08682v1
- Date: Wed, 16 Jun 2021 10:40:00 GMT
- Title: A Comparison of Various Classical Optimizers for a Variational Quantum
Linear Solver
- Authors: Aidan Pellow-Jarman, Ilya Sinayskiy, Anban Pillay and Francesco
Petruccione
- Abstract summary: Variational Hybrid Quantum Classical Algorithms (VHQCAs) are a class of quantum algorithms intended to run on noisy quantum devices.
These algorithms employ a parameterized quantum circuit (ansatz) and a quantum-classical feedback loop.
A classical device is used to optimize the parameters in order to minimize a cost function that can be computed far more efficiently on a quantum device.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Variational Hybrid Quantum Classical Algorithms (VHQCAs) are a class of
quantum algorithms intended to run on noisy intermediate-scale quantum (NISQ)
devices. These algorithms employ a parameterized quantum circuit (ansatz) and a
quantum-classical feedback loop. A classical device is used to optimize the
parameters in order to minimize a cost function that can be computed far more
efficiently on a quantum device. The cost function is constructed such that
finding the ansatz parameters that minimize its value, solves some problem of
interest. We focus specifically on the Variational Quantum Linear Solver
(VQLS), and examine the effect of several gradient-free and gradient-based
classical optimizers on performance. We focus on both the average rate of
convergence of the classical optimizers studied, as well as the distribution of
their average termination cost values, and how these are affected by noise. Our
work demonstrates that realistic noise levels on NISQ devices present a
challenge to the optimization process. All classical optimizers appear to be
very negatively affected by the presence of realistic noise. If noise levels
are significantly improved, there may be a good reason for preferring
gradient-based methods in the future, which performed better than the
gradient-free methods with the only shot-noise present. The gradient-free
optimizers, Simultaneous Perturbation Stochastic Approximation (SPSA) and
Powell's method, and the gradient-based optimizers, AMSGrad and BFGS performed
the best in the noisy simulation, and appear to be less affected by noise than
the rest of the methods. SPSA appears to be the best performing method. COBYLA,
Nelder-Mead and Conjugate-Gradient methods appear to be the most heavily
affected by noise, with even slight noise levels significantly impacting their
performance.
Related papers
- Gradient Normalization with(out) Clipping Ensures Convergence of Nonconvex SGD under Heavy-Tailed Noise with Improved Results [60.92029979853314]
This paper investigates Gradient Normalization without (NSGDC) its gradient reduction variant (NSGDC-VR)
We present significant improvements in the theoretical results for both algorithms.
arXiv Detail & Related papers (2024-10-21T22:40:42Z) - 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) - A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms [1.4770642357768933]
A key component of variational quantum algorithms (VQAs) is the choice of classical solvers employed to update the parameterization of an ansatz.
It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities.
We introduce the key defining characteristics of novel noise-aware derivative-free model-based methods that separate them from standard model-based methods.
arXiv Detail & Related papers (2024-01-18T16:51:02Z) - Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational
Quantum Systems [65.268245109828]
We compare the performance of classicals across a series of partially-randomized tasks.
We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
arXiv Detail & Related papers (2023-10-14T02:13:26Z) - QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth [0.32985979395737786]
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ)
This paper presents an investigation into the impact realistic noise on the classical vectors.
We find that while there is no significant difference in the performance of classicals in a state simulation, the Adam and AMSGrads perform best in the presence of shot noise.
arXiv Detail & Related papers (2023-07-19T17:22:44Z) - Accelerating Noisy VQE Optimization with Gaussian Processes [0.0]
We introduce the use of Gaussian Processes (GP) as surrogate models to reduce the impact of noise.
ImFil is a state-of-the-art, gradient-free method, which in comparative studies has been shown to outperform on noisy VQE problems.
We show that when noise is present, the GP+ImFil approach finds results closer to the true global minimum in fewer evaluations than standalone ImFil.
arXiv Detail & Related papers (2022-04-15T05:01:14Z) - Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity.
We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z) - Performance comparison of optimization methods on variational quantum
algorithms [2.690135599539986]
Variational quantum algorithms (VQAs) offer a promising path towards using near-term quantum hardware for applications in academic and industrial research.
We study the performance of four commonly used gradient-free optimization methods: SLSQP, COBYLA, CMA-ES, and SPSA.
arXiv Detail & Related papers (2021-11-26T12:13:20Z) - 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) - Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [1.43494686131174]
We present a collection of tunings tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices.
We analyze the efficiency and effectiveness of different minimizes in a VQE case study.
While most results to date concentrated on tuning the quantum VQE circuit, we show that, in the presence of quantum noise, the classical minimizer step needs to be carefully chosen to obtain correct results.
arXiv Detail & Related papers (2020-04-06T21:31:22Z) - 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.