Visualizing the patterns and flows

GraphVisualizer tool offers a wide selection of visualization methods for inspecting the causal structure of the graph associated with the pattern, graph or the (generalized-)flow.

Causal flow

First, let us inspect the flow and gflow associated with the resource graph of a pattern. simply call draw_graph() method. Below we list the meaning of the node boundary and face colors.

• Nodes with red boundaries are the input nodes where the computation starts.

• Nodes with gray color is the output nodes where the final state end up in.

• Nodes with blue color is the nodes that are measured in Pauli basis, one of X, Y or Z computational bases.

• Nodes in white are the ones measured in non-Pauli basis.

from __future__ import annotations

from graphix import Circuit
from graphix.fundamentals import ANGLE_PI, Plane

circuit = Circuit(3)
circuit.cnot(0, 1)
circuit.cnot(2, 1)
circuit.rx(0, ANGLE_PI / 3)
circuit.x(2)
circuit.cnot(2, 1)
pattern = circuit.transpile().pattern
# note that this visualization is not always consistent with the correction set of pattern,
# since we find the correction sets with flow-finding algorithms.
pattern.draw_graph(flow_from_pattern=False, show_measurement_planes=True)

Flow detected in the graph.

next, show the gflow:

pattern.remove_input_nodes()
pattern.perform_pauli_measurements()
pattern.draw_graph(flow_from_pattern=False, show_measurement_planes=True, node_distance=(1, 0.6))

Flow detected in the graph.

Correction set (‘xflow’ and ‘zflow’ of pattern)

next let us visualize the X and Z correction set in the pattern by flow_from_pattern=False statement.

# node_distance argument specifies the scale of the node arrangement in x and y directions.
pattern.draw_graph(flow_from_pattern=True, show_measurement_planes=True, node_distance=(0.7, 0.6))

The pattern is consistent with flow structure.

Instead of the measurement planes, we can show the local Clifford of the resource graph. see clifford.py for the details of the indices of each single-qubit Clifford operators. 6 is the Hadamard and 8 is the \(\sqrt{iY}\) operator.

pattern.draw_graph(flow_from_pattern=True, show_local_clifford=True, node_distance=(0.7, 0.6))

The pattern is consistent with flow structure.

Visualize based on the graph

The visualizer also works without the pattern. Simply supply the

import networkx as nx

from graphix.visualization import GraphVisualizer

# graph with gflow but no flow
nodes = [1, 2, 3, 4, 5, 6]
edges = [(1, 4), (1, 6), (2, 4), (2, 5), (2, 6), (3, 5), (3, 6)]
inputs = {1, 2, 3}
outputs = {4, 5, 6}
graph: nx.Graph[int] = nx.Graph()
graph.add_nodes_from(nodes)
graph.add_edges_from(edges)
meas_planes = {1: Plane.XY, 2: Plane.XY, 3: Plane.XY}
vis = GraphVisualizer(graph, inputs, outputs, meas_plane=meas_planes)
vis.visualize(show_measurement_planes=True)

Gflow detected in the graph. (flow not detected)

# graph with extended gflow but no flow
nodes = [0, 1, 2, 3, 4, 5]
edges = [(0, 1), (0, 2), (0, 4), (1, 5), (2, 4), (2, 5), (3, 5)]
inputs = {0, 1}
outputs = {4, 5}
graph = nx.Graph()
graph.add_nodes_from(nodes)
graph.add_edges_from(edges)
meas_planes = {
    0: Plane.XY,
    1: Plane.XY,
    2: Plane.XZ,
    3: Plane.YZ,
}
vis = GraphVisualizer(graph, inputs, outputs, meas_plane=meas_planes)
vis.visualize(show_measurement_planes=True)

Gflow detected in the graph. (flow not detected)