Pith. sign in

REVIEW 1 cited by

Stabilizer Approximation III: Maximum Cut

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.17215 v3 pith:ZI6A4ODM submitted 2023-03-30 quant-ph math.COmath.OC

Chuixiong Wu , Jianan Wang , Fen Zuo This is my paper · ORCID
classification quant-phmath.COmath.OC
keywords heuristicmaximumapproximationedge-contractionproblemstabilizerapplyapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $1/2$. Moreover, numerical results show that the heuristic has very nice performance for graphs with about 100 vertices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improving stabilizer approximation with quantum strategy

    quant-ph 2024-12 conditional novelty 3.0 of 10

    A CHSH-game-inspired local rotation of the Pauli basis, applied qubit by qubit, improves the stabilizer approximation energy for two toy Hamiltonians.

Pith tools