Stabilizer Approximation III: Maximum Cut
Quantum Physics
2023-05-30 v3 Combinatorics
Optimization and Control
Abstract
We apply the stabilizer formalism to the Maximum Cut problem, and obtain a new greedy construction heuristic. It turns out to be an elegant synthesis of the edge-contraction and differencing edge-contraction approaches. Utilizing the relation between the Maximum Cut problem and the Ising model, the approximation ratio of the heuristic is easily found to be at least . Moreover, numerical results show that the heuristic has very nice performance for graphs with about 100 vertices.
Keywords
Cite
@article{arxiv.2303.17215,
title = {Stabilizer Approximation III: Maximum Cut},
author = {Chuixiong Wu and Jianan Wang and Fen Zuo},
journal= {arXiv preprint arXiv:2303.17215},
year = {2023}
}
Comments
The cut assignment code is amended with the graph scan method