cirq.unroll_circuit_op_greedy_frontier
Unrolls (tagged) cirq.CircuitOperation
s by inserting operations inline at qubit frontier.
cirq.unroll_circuit_op_greedy_frontier(
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
circuit.insert_at_frontier
method. The greedy approach attempts to reuse any available space
in existing moments on the right of circuit_op before inserting new moments.
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 inline at qubit frontier.
|
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 2024-06-27 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-06-27 UTC."],[],[]]