cirq.testing.assert_circuits_have_same_unitary_given_final_permutation
Asserts two circuits have the same unitary up to a final permutation of qubits.
cirq.testing.assert_circuits_have_same_unitary_given_final_permutation(
actual: cirq.AbstractCircuit
,
expected: cirq.AbstractCircuit
,
qubit_map: Dict[cirq.Qid
, cirq.Qid
]
) -> None
Args |
actual
|
A circuit computed by some code under test.
|
expected
|
The circuit that should have been computed.
|
qubit_map
|
the permutation of qubits from the beginning to the end of the circuit.
|
Raises |
ValueError
|
if 'qubit_map' is not a mapping from the qubits in 'actual' to themselves.
|
ValueError
|
if 'qubit_map' does not have the same set of keys and values.
|
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."],[],[]]