cirq.unroll_circuit_op_greedy_earliest

Unrolls (tagged) cirq.CircuitOperations by inserting operations using EARLIEST strategy.

cirq.unroll_circuit_op_greedy_earliest(
    circuit: CIRCUIT_TYPE,
    *,
    deep: bool = False,
    tags_to_check: Optional[Sequence[Hashable]] = (MAPPED_CIRCUIT_OP_TAG,)
) -> CIRCUIT_TYPE

Each matching cirq.CircuitOperation is replaced by inserting underlying operations using the cirq.InsertStrategy.EARLIEST strategy. The greedy approach attempts to minimize circuit depth of the resulting circuit.

Args
`circuit`	Input circuit to apply the transformations on. The input circuit is not mutated.
`deep`	If true, the transformer primitive will be recursively applied to all circuits wrapped inside circuit operations.
`tags_to_check`	If specified, only circuit operations tagged with one of the `tags_to_check` are unrolled.

Returns
Copy of input circuit with (Tagged) CircuitOperation's expanded using EARLIEST strategy.

Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.

Last updated 2025-04-15 UTC.

cirq.unroll_circuit_op_greedy_earliest

Args

Returns