Benchmarking Metaheuristic-Integrated QAOA against Quantum Annealing
- URL: http://arxiv.org/abs/2309.16796v3
- Date: Wed, 17 Jan 2024 18:50:09 GMT
- Title: Benchmarking Metaheuristic-Integrated QAOA against Quantum Annealing
- Authors: Arul Rhik Mazumder, Anuvab Sen, Udayon Sen
- Abstract summary: The study provides insights into the strengths and limitations of both Quantum Annealing and metaheuristic-integrated QAOA across different problem domains.
The findings suggest that the hybrid approach can leverage classical optimization strategies to enhance the solution quality and convergence speed of QAOA.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is one of the most
promising Noisy Intermediate Quantum Algorithms (NISQ) in solving combinatorial
optimizations and displays potential over classical heuristic techniques.
Unfortunately, QAOA performance depends on the choice of parameters and
standard optimizers often fail to identify key parameters due to the complexity
and mystery of these optimization functions. In this paper, we benchmark QAOA
circuits modified with metaheuristic optimizers against classical and quantum
heuristics to identify QAOA parameters. The experimental results reveal
insights into the strengths and limitations of both Quantum Annealing and
metaheuristic-integrated QAOA across different problem domains. The findings
suggest that the hybrid approach can leverage classical optimization strategies
to enhance the solution quality and convergence speed of QAOA, particularly for
problems with rugged landscapes and limited quantum resources. Furthermore, the
study provides guidelines for selecting the most appropriate approach based on
the specific characteristics of the optimization problem at hand.
Related papers
- 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) - 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) - 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) - 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) - Mean-Field Approximate Optimization Algorithm [0.17812428873698405]
Mean-field Approximate Optimization Algorithm (mean-field AOA) developed by replacing quantum evolution of QAOA with classical spin dynamics.
We benchmark its performance against the QAOA on the Sherrington-Kirkpatrick (SK) model and the partition problem.
Our algorithm can thus serve as a tool to delineate optimization problems that can be solved classically from those that cannot.
arXiv Detail & Related papers (2023-03-01T08:47:06Z) - Lyapunov control-inspired strategies for quantum combinatorial
optimization [0.0]
We provide an expanded description of Lyapunov control-inspired strategies for quantum optimization.
Instead, these strategies utilize feedback from qubit measurements to assign values to the quantum circuit parameters in a deterministic manner.
arXiv Detail & Related papers (2021-08-12T19:47:59Z) - Quantum Approximate Optimization Algorithm Based Maximum Likelihood
Detection [80.28858481461418]
Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
arXiv Detail & Related papers (2021-07-11T10:56:24Z) - 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.