2 citations · 2 across the 7 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
quant-ph2023★ 2 cited
More on greedy construction heuristics for the MAX-CUT problem
Jianan Wang, Chuixiong Wu, Fen Zuo
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that…
quant-ph2023
Stabilizer Approximation III: Maximum Cut
Chuixiong Wu, Jianan Wang, Fen Zuo
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 di…
quant-ph2023
Stabilizer Approximation II: From HO To CH
Jianan Wang, Chuixiong Wu, Fen Zuo
We apply the stabilizer method to the study of some complicated molecules, such as water and benzene. In the minimal STO-3G basis, the former requires 14 qubits, and the latter 72…