cirq.circuits.CircuitDag

A representation of a Circuit as a directed acyclic graph.

Nodes of the graph are instances of Unique containing each operation of a circuit.

Edges of the graph are tuples 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).

Methods

all_operations

View source

all_qubits

View source

append

View source

disjoint_qubits

View source

Returns true only if the operations have qubits in common.

findall_nodes_until_blocked

View source

Finds all nodes before blocking ones.

Args
is_blocker The predicate that indicates whether or not an operation is blocking.

from_circuit

View source

from_ops

View source

make_node

View source

ordered_nodes

View source

to_circuit

View source

__eq__

View source

Return self==value.

__ne__

View source

Return self!=value.