2020
DOI: 10.48550/arxiv.2007.06135
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Stella L. Harrison,
Helgi Sigurdsson,
Sergey Alyatkin
et al.

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 propose a hardware implementable optical optimization heuristic for the NP-Hard max-3-cut problem based on a synchronized network of exciton-polariton condensates. The condensate network dynamical transients provide optically-fast annealing of the XY Hamiltonian to which we apply Goemans and Williamson random hyp… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 43 publications
0
2
0
Order By: Relevance
“…Recently, investigation has been devoted to the network dynamics of dissipatively coupled Stuart-Landau oscillators whose fixed point attractors correlate with minimal energy configurations of the XY Hamiltonian encoded in the network weights [10][11][12]. This opens up perspectives on analogue computing strategies based on oscillatory networks to heuristically solve a variety of complex graph problems such as the NP-hard max-3-cut problem [13], and the phase retrieval problem [14].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, investigation has been devoted to the network dynamics of dissipatively coupled Stuart-Landau oscillators whose fixed point attractors correlate with minimal energy configurations of the XY Hamiltonian encoded in the network weights [10][11][12]. This opens up perspectives on analogue computing strategies based on oscillatory networks to heuristically solve a variety of complex graph problems such as the NP-hard max-3-cut problem [13], and the phase retrieval problem [14].…”
Section: Introductionmentioning
confidence: 99%
“…We demonstrate how the minor embedding technique realises a more experimentally friendly strategy to simulate and study graph problems with high degrees of connectivity in dissipatively coupled oscillatory systems. These include polariton condensates [13,17], photon condensates [18], non-degenerate optical parametric oscillators [19,20], and coupled microlaser arrays [21,22].…”
Section: Introductionmentioning
confidence: 99%