.png){kind=icon}
Return
Edge-based quantum approximate optimization algorithm for MAX-CUT problem
.png){kind=icon}
OA
AI
DOI：10.1007/s11128-025-04925-0.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum computing has emerged as a promising paradigm to tackle computationally intensive problems that classical computers struggle with. In this study, we explore the application of the Edge-based quantum approximate optimization algorithm (QAOA) to the MAX-CUT problem, a well-known combinatorial optimization challenge. MAX-CUT aims to partition the vertices of a graph into two subsets such that the number of edges between the subsets is maximized. We define the edge-based MAX-CUT problem and propose a method for applying QAOA specifically tailored to this formulation. We conduct simulations using IBM's Qiskit framework, examining both vertex-based and edge-based QAOA implementations across various graph structures. Our results highlight the comparative performance of these approaches in terms of solution quality and computational efficiency. Specifically, we analyze the impact of different graph sizes and edge densities on the complexity and CNOT gate counts of the proposed algorithms. This analysis provides insights into leveraging quantum computing for combinatorial optimization tasks, particularly focusing on the implications for practical applications and future research directions.
Keywords:
MAX-CUT problem
Quantum algorithm
Quantum approximate optimization algorithm
Noisy intermediate-scale quantum
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
Q
IF:
2.2
Papers:
290
Citations:
0
Organization
No organization information available
Cited Papers
ShareSaveHardware-efficient variational quantum eigensolver for small molecules and quantum magnets.png)
NatureOAAI
NatureIF0
OAAIShareSaveShareSaveAnalyzing the performance of variational quantum factoring on a superconducting quantum processor
OAAI
OAAIShareSaveShareSaveDeep Variational Quantum Eigensolver: A Divide-And-Conquer Method for Solving a Larger Problem with Smaller Size Quantum ComputersPRX QUANTUMOAAI
PRX QUANTUMIF11
OAAIShareSaveShareSaveShareSave
View more