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

DOI10.1016/J.PHYSA.2024.129951MaRDI QIDQ6593524

Fei Gao, Shasha Wang, Jing Li, Song Wang, Xiumei Zhao, Su-Juan Qin, Yongmei Li

Publication date: 26 August 2024

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

quantum computingsemidefinite programsmaxcut problemnear-term quantum algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
• Semidefinite programming in combinatorial optimization
• On a positive semidefinite relaxation of the cut polytope
• The variational quantum eigensolver: a review of methods and best practices
• Quantum algorithms for anomaly detection using amplitude estimation
• Quantum \(k\)-fold cross-validation for nearest neighbor classification algorithm
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The theory of variational hybrid quantum-classical algorithms
• Quantum discriminative canonical correlation analysis
• A review on quantum approximate optimization algorithm and its variants

This page was built for publication: Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593524)