Fig. 4: Solving the Boolean satisfiability (SAT) problem. | Communications Physics

Fig. 4: Solving the Boolean satisfiability (SAT) problem.

From: Stochastic logic in biased coupled photonic probabilistic bits

Fig. 4

a The digital logic circuit of one clause in the 3SAT problem, i.e. x1 x2 x3 = 1 (left) with the corresponding Ising Hamiltonian (right). b Temporal evolution towards the steady state of the in-phase component (c, blue lines) of 384 coupled and biased OPOs with J and \(\overrightarrow{h}\) originating from the 3SAT problem with 20 variables and 91 clauses. From the steady state, we can read off one solution to the 3SAT problem. The orange line plots the evolution of the percentage of clauses satisfied.

Back to article page