Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources

Xiumei Zhao, Yongmei Li, Jing Li, Shasha Wang, Song Wang, Sujuan Qin and Fei Gao

Physica A: Statistical Mechanics and its Applications, 2024, vol. 648, issue C

Abstract: MaxCut is an NP-hard combinatorial optimization problem in graph theory. The quantum approximate optimization algorithms (QAOAs) offer new methods for solving such problems, which are potentially better than classical schemes. However, the requirement of N qubits for solving graphs with N-vertex in QAOA, coupled with the large-N trainability issue due to barren plateaus, poses a substantial challenge for noisy intermediate-scale quantum (NISQ) devices. Recently, a hybrid quantum–classical algorithm has been proposed for solving semidefinite programs (SDPs), named NISQ SDP Solver (NSS). In this paper, we study the performance of the NSS for solving MaxCut problem via the introduction of a near-term quantum algorithm and execution of experimental simulations. Since the MaxCut problem admits a relaxation into an SDP formulation, the SDP can be solved using NSS, with a subsequent classical post-processing step converting the hybrid density matrix into a MaxCut solution. After performing these steps, the near-term quantum algorithm will also inherit the advantages of NSS. We analyze the algorithm as compared to QAOAs and find that the depth of the quantum circuit is independent of the number of edges on the graph. Our algorithm requires logN qubits and has O(1) circuit depth. This implies that it uses exponentially fewer qubits compared to QAOAs while also requiring a significantly reduced circuit depth to solve the MaxCut problem. To demonstrate the effectiveness of the NSS, we focused on 3-regular graphs, 9-regular graphs, and ER graphs. Numerical results indicate that the quantum algorithm achieves a comparable approximation ratio with classical methods by solving the original high dimensional problem within a lower dimensional ansatz space. Analysis under various initial states shows that the algorithm exhibits a remarkably stable performance.

Keywords: Quantum computing; Near-term quantum algorithms; Semidefinite programs; MaxCut problem (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437124004606
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:648:y:2024:i:c:s0378437124004606

DOI: 10.1016/j.physa.2024.129951

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().