Fig. 1: Procedure of the mapping process. | Communications Physics

Fig. 1: Procedure of the mapping process.

From: Speedup of high-order unconstrained binary optimization using quantum \({{\mathbb{Z}}}_{2}\) lattice gauge theory

Fig. 1

a Four different terms with interaction order varying from 1 to 4 in the objective function of HUBO map to four kinds of vertices in the HUBO-graph and four kinds of plaquettes in the G-graph. b An example of an inefficient cycle in the HUBO-graph. In this example, the cycle s1s2s3s6s5 is inefficient, as it can be broken down into cycles s1s2s3s4 and s4s5s6.

Back to article page