cirq.contrib.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_operations() -> Iterator['cirq.Operation']

all_qubits

View source

all_qubits()

append

View source

append(
    op: 'cirq.Operation'
) -> None

disjoint_qubits

View source

disjoint_qubits(
    op1: 'cirq.Operation', op2: 'cirq.Operation'
) -> bool

Returns true only if the operations have qubits in common.

findall_nodes_until_blocked

View source

findall_nodes_until_blocked(
    is_blocker: Callable[['cirq.Operation'], bool]
) -> Iterator[Unique['cirq.Operation']]

Finds all nodes before blocking ones.

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

from_circuit

View source

@staticmethod
from_circuit(
    circuit: cirq.Circuit,
    can_reorder: Callable[['cirq.Operation', 'cirq.Operation'], bool] = cirq.contrib.CircuitDag.disjoint_qubits
) -> 'CircuitDag'

from_ops

View source

@staticmethod
from_ops(
    *operations,
    can_reorder: Callable[['cirq.Operation', 'cirq.Operation'], bool] = cirq.contrib.CircuitDag.disjoint_qubits
) -> 'CircuitDag'

make_node

View source

@staticmethod
make_node(
    op: 'cirq.Operation'
) -> cirq.contrib.Unique

ordered_nodes

View source

ordered_nodes() -> Iterator[Unique['cirq.Operation']]

to_circuit

View source

to_circuit() -> cirq.Circuit

__eq__

View source

__eq__(
    other
)

Return self==value.

__ne__

View source

__ne__(
    other
)

Return self!=value.