cirq.KakDecomposition
A convenient description of an arbitrary two-qubit operation.
cirq.KakDecomposition(
*,
global_phase: complex = complex(1),
single_qubit_operations_before: Optional[Tuple[np.ndarray, np.ndarray]] = None,
interaction_coefficients: Tuple[float, float, float],
single_qubit_operations_after: Optional[Tuple[np.ndarray, np.ndarray]] = None
)
Any two qubit operation U can be decomposed into the form
U = g · (a1 ⊗ a0) · exp(i·(x·XX + y·YY + z·ZZ)) · (b1 ⊗ b0)
This class stores g, (b0, b1), (x, y, z), and (a0, a1).
Args |
global_phase
|
g from the above equation.
|
single_qubit_operations_before
|
b0, b1 from the above equation.
|
interaction_coefficients
|
x, y, z from the above equation.
|
single_qubit_operations_after
|
a0, a1 from the above equation.
|
Attributes |
global_phase
|
g from the above equation.
|
single_qubit_operations_before
|
b0, b1 from the above equation.
|
interaction_coefficients
|
x, y, z from the above equation.
|
single_qubit_operations_after
|
a0, a1 from the above equation.
|
Methods
__eq__
View source
__eq__(
other: _SupportsValueEquality
) -> bool
__ne__
View source
__ne__(
other: _SupportsValueEquality
) -> bool
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."],[],[]]