The promising path of evolutionary optimization to avoid barren plateaus
- URL: http://arxiv.org/abs/2402.05227v1
- Date: Wed, 7 Feb 2024 20:06:29 GMT
- Title: The promising path of evolutionary optimization to avoid barren plateaus
- Authors: Jakab N\'adori, Gregory Morse, Zita Majnay-Tak\'acs, Zolt\'an
Zimbor\'as, P\'eter Rakyta
- Abstract summary: Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices.
This work introduces a novel optimization method designed to alleviate the adverse effects of barren plateau (BP) problems during circuit training.
We have successfully applied our optimization strategy to quantum circuits comprising $16$ qubits and $15000$ entangling gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Variational quantum algorithms are viewed as promising candidates for
demonstrating quantum advantage on near-term devices. These approaches
typically involve the training of parameterized quantum circuits through a
classical optimization loop. However, they often encounter challenges
attributed to the exponentially diminishing gradient components, known as the
barren plateau (BP) problem. This work introduces a novel optimization method
designed to alleviate the adverse effects of BPs during circuit training. Our
approach to select the optimization search direction relies on the distant
features of the cost-function landscape. This enables the optimization path to
navigate around barren plateaus without the need for external control
mechanisms. We have successfully applied our optimization strategy to quantum
circuits comprising $16$ qubits and $15000$ entangling gates, demonstrating
robust resistance against BPs. Additionally, we have extended our optimization
strategy by incorporating an evolutionary selection framework, enhancing its
ability to avoid local minima in the landscape. The modified algorithm has been
successfully utilized in quantum gate synthesis applications, showcasing a
significantly improved efficiency in generating highly compressed quantum
circuits compared to traditional gradient-based optimization approaches.
Related papers
- 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) - Cost Explosion for Efficient Reinforcement Learning Optimisation of
Quantum Circuits [55.616364225463066]
Reinforcement Learning (RL) is a recent approach for learning strategies to optimise quantum circuits by increasing the reward of an optimisation agent.
Our goal is to improve the agent's optimization strategy, by including hints about how quantum circuits are optimized manually.
We show that allowing cost explosions offers significant advantages for RL training, such as reaching optimum circuits.
arXiv Detail & Related papers (2023-11-21T10:16:03Z) - 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) - Efficient DCQO Algorithm within the Impulse Regime for Portfolio
Optimization [41.94295877935867]
We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm.
Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors.
We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
arXiv Detail & Related papers (2023-08-29T17:53:08Z) - Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes [0.0]
Variational quantum algorithms (VQAs) represent a promising approach to utilizing current quantum computing infrastructures.
We propose the quantum Broyden adaptive natural gradient (qBang) approach, a novel that aims to distill the best aspects of existing approaches.
arXiv Detail & Related papers (2023-04-27T00:06:48Z) - Optimizing Quantum Algorithms on Bipotent Architectures [0.0]
We investigate the trade-off between hardware-level and algorithm-level improvements on bipotent quantum architectures.
Our results indicate that the benefits of pulse-level optimizations currently outweigh the improvements due to vigorously optimized monolithic gates.
arXiv Detail & Related papers (2023-03-23T08:57:06Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 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.