circuit_dag: Circuit Dag

In henry090/Cirq: Interface to 'Cirq'

Description

A representation of a Circuit as a directed acyclic graph.

Usage

circuit_dag(
  can_reorder,
  incoming_graph_data = NULL,
  device = unconstrained_device()
)

Arguments

can_reorder	A predicate that determines if two operations may be reordered. Graph edges are created for pairs of operations where this returns False. The default predicate allows reordering only when the operations don’t share common qubits.
incoming_graph_data	Data in initialize the graph. This can be any value supported by networkx.DiGraph() e.g. an edge list or another graph.
device	Hardware that the circuit should be able to run on.

Details

Nodes of the graph are instances of Unique containing each operation of a circuit. Edges of the graph are lists of nodes. Each edge specifies a required application order between two operations. The first must be applied before the second. The graph is maximalist (transitive completion).

Value

Initialized Circuit Dag.

See Also

Other Circuits: circuit(), gate_operation_(), gate_parallel_operation(), insert_strategy(), moment(), qubit_order_or_list(), qubit_order(), tree_flatten_op(), tree_op()

henry090/Cirq documentation built on June 13, 2020, 1:28 a.m.