dimod.generators.chimera_anticluster

chimera_anticluster(m: int, n: Optional[int] = None, t: int = 4, multiplier: float = 3, cls: None = None, subgraph: Union[int, Tuple[Collection[Hashable], Collection[Tuple[Hashable, Hashable]]], Collection[Tuple[Hashable, Hashable]], networkx.classes.graph.Graph] = None, seed: Union[None, int] = None) dimod.binary.binary_quadratic_model.BinaryQuadraticModel[source]

Generate an anticluster problem on a Chimera lattice.

An anticluster problem has weak interactions within a tile and strong interactions between tiles.

Parameters
  • m – Number of rows in the Chimera lattice.

  • n – Number of columns in the Chimera lattice. Defaults to m.

  • t – Size of the shore within each Chimera tile.

  • multiplier – Strength of the intertile edges.

  • cls – Deprecated. Does nothing

  • subgraph – A subgraph of a Chimera(m, n, t) graph to build the anticluster problem on.

  • seed – Random seed.

Returns

A binary quadratic model.