Max-cut Clustering Utilizing Warm-Start QAOA and IBM Runtime

• URL: http://arxiv.org/abs/2108.13464v1
• Date: Mon, 30 Aug 2021 18:21:04 GMT
• Title: Max-cut Clustering Utilizing Warm-Start QAOA and IBM Runtime
• Authors: Daniel Beaulieu and Anh Pham
• Abstract summary: Quantum optimization algorithms can be used to recreate unsupervised learning clustering of data. This research tests the "Warm Start" variant of Quantum Approximate Optimization (QAOA) Algorithm.
• Score: 0.7106986689736827
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum optimization algorithms can be used to recreate unsupervised learning clustering of data by mapping the problem to a graph optimization problem and finding the minimum energy for a MaxCut problem formulation. This research tests the "Warm Start" variant of Quantum Approximate Optimization Algorithm (QAOA) versus the standard implementation of QAOA for unstructured clustering problems. The performance for IBM's new Qiskit Runtime API for speeding up optimization algorithms is also tested in terms of speed up and relative performance compared to the standard implementation of optimization algorithms. Warm-start QAOA performs better than any other optimization algorithm, though standard QAOA runs the fastest. This research also used a non-convex optimizer to relax the quadratic program for the Warm-start QAOA.

Related papers

• Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling [96.47086913559289]
  gradient-based algorithms are widely used in bilevel optimization. We introduce a without-replacement sampling based algorithm which achieves a faster convergence rate. We validate our algorithms over both synthetic and real-world applications.
  arXiv  Detail & Related papers  (2024-11-07T17:05:31Z)
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era [3.734751161717204]
  Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum optimizations. Recent advances in parameter setting in QAOA make EFTQC experiments with QAOA practically viable.
  arXiv  Detail & Related papers  (2024-08-18T16:48:14Z)
• A hybrid quantum-classical approach to warm-starting optimization [0.0]
  We compare the performance of standard QAOA with that of warm-start QAOA in the context of portfolio optimization. We show that the results can be reproduced or even surpassed by a purely classical preprocessing of the original problem followed by standard QAOA.
  arXiv  Detail & Related papers  (2023-09-25T08:53:54Z)
• Iterative-Free Quantum Approximate Optimization Algorithm Using Neural Networks [20.051757447006043]
  We propose a practical method that uses a simple, fully connected neural network to find better parameters tailored to a new given problem instance. Our method is consistently the fastest to converge while also the best final result.
  arXiv  Detail & Related papers  (2022-08-21T14:05:11Z)
• Evaluating performance of hybrid quantum optimization algorithms for MAXCUT Clustering using IBM runtime environment [0.7106986689736827]
  We benchmark the performance of the "Warm-Start" variant of Quantum Approximate Optimization Algorithm (QAOA) versus the standard implementation of QAOA and variational quantum eigensolver (VQE) Our results show a strong speedup in execution time for different optimization algorithms using the IBM Qiskit architecture and increased speedup in classification accuracy in ws-QAOA algorithm.
  arXiv  Detail & Related papers  (2021-12-06T17:56:35Z)
• An Accelerated Variance-Reduced Conditional Gradient Sliding Algorithm for First-order and Zeroth-order Optimization [111.24899593052851]
  Conditional gradient algorithm (also known as the Frank-Wolfe algorithm) has recently regained popularity in the machine learning community. ARCS is the first zeroth-order conditional gradient sliding type algorithms solving convex problems in zeroth-order optimization. In first-order optimization, the convergence results of ARCS substantially outperform previous algorithms in terms of the number of gradient query oracle.
  arXiv  Detail & Related papers  (2021-09-18T07:08:11Z)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• Recent Theoretical Advances in Non-Convex Optimization [56.88981258425256]
  Motivated by recent increased interest in analysis of optimization algorithms for non- optimization in deep networks and other problems in data, we give an overview of recent results of theoretical optimization algorithms for non- optimization.
  arXiv  Detail & Related papers  (2020-12-11T08:28:51Z)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer [0.0]
  The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves optimization problems. We develop an iterative version of QAOA that is problem-tailored, and which can also be adapted to specific hardware constraints. We simulate the algorithm on a class of Max-Cut graph problems and show that it converges much faster than the standard QAOA.
  arXiv  Detail & Related papers  (2020-05-20T18:00:01Z)
• 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.