Pith. sign in

REVIEW

Solving the max-3-cut problem using synchronized dissipative networks

Not yet reviewed by Pith; the record is open.

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 2007.06135 v2 pith:NXYK6EIU submitted 2020-07-13 quant-ph cond-mat.mes-hall

classification quant-phcond-mat.mes-hall
keywords networkmax-3-cutproblemcoherentcondensatesdecisionproblemssynchronized
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many computational problems are intractable through classical computing and, as Moore's law is drawing to a halt, demand for finding alternative methods in tackling these problems is growing. Here, we realize a liquid light machine for the NP-hard max-3-cut problem based on a network of synchronized exciton-polariton condensates. We overcome the binary limitation of the decision variables in Ising machines using the continuous-phase degrees of freedom of a coherent network of polariton condensates. The condensate network dynamical transients provide optically-fast annealing of the XY Hamiltonian. We apply the Goemans and Williamson random hyperplane technique, discretizing the XY ground state spin configuration to serve as ternary decision variables for an approximate optimal solution to the max-3-cut problem. Applications of the presented coherent network are investigated in image-segmentation tasks and in circuit design.

Discussion (0). Continue with ORCID to comment.

Pith tools