cirq.quantum_shannon_decomposition
Decomposes n-qubit unitary 1-q, 2-q and GlobalPhase gates, preserving global phase.
cirq . quantum_shannon_decomposition (
qubits : 'List[cirq.Qid]' , u : np . ndarray , atol : float = 1e-08
) -> Iterable [ 'cirq.Operation' ]
The gates used are CX/YPow/ZPow/CNOT/GlobalPhase/CZ/PhasedXZGate/PhasedXPowGate.
The algorithm is described in Shende et al.:
Synthesis of Quantum Logic Circuits. Tech. rep. 2006,
https://arxiv.org/abs/quant-ph/0406176
Note: Shannon decomposition is sensitive to the numerical accuracy of doing eigendecomposition.
Eigendecomposition is obtained using np.linalg.eig
and the resulting difference between
the input and output unitary is heavily affected by the accuracy of np.linalg.eig
.
Args
qubits
List of qubits in order of significance
u
Numpy array for unitary matrix representing gate to be decomposed
atol
Absolute tolerance of floating point checks.
Calls
(Base Case)
_single_qubit_decomposition
OR
(Recursive Case)
_msb_demuxer
_multiplexed_cossin
_msb_demuxer
Yields
A single 2-qubit or 1-qubit operations from OP TREE
composed from the set
{ CNOT, rz, ry, ZPowGate }
Raises
ValueError
If the u matrix is non-unitary
ValueError
If the u matrix is not of shape (2^n,2^n)
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.
[[["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 2025-04-15 UTC."],[],[]]