Return a heavy square graph coupling map.
A heavy square graph is described in:
distance (int) – The code distance for the generated heavy square graph. The value for distance can be any odd positive integer. The distance relates to the number of qubits by: \(n = 3d^2 - 2d\) where \(n\) is the number of qubits and \(d\) is the
bidirectional (bool) – Whether the edges in the output coupling graph are bidirectional or not. By default this is set to
A heavy square coupling graph
- Return type