cirq.bit_flip
Construct a BitFlipChannel that flips a qubit state with probability p.
cirq.bit_flip(
p: Optional[float] = None
) -> Union[cirq.XPowGate
, cirq.BitFlipChannel
]
Used in the notebooks
If p is None, this returns a guaranteed flip in the form of an X operation.
This channel evolves a density matrix via
\[
\rho \rightarrow M_0 \rho M_0^\dagger + M_1 \rho M_1^\dagger
\]
With
\[
\begin{aligned}
M_0 =& \sqrt{1-p} \begin{bmatrix}
1 & 0 \\
0 & 1
\end{bmatrix}
\\
M_1 =& \sqrt{p} \begin{bmatrix}
0 & 1 \\
1 & 0
\end{bmatrix}
\end{aligned}
\]
Args |
p
|
the probability of a bit flip.
|
Raises |
ValueError
|
if p is not a valid probability.
|
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."],[],[]]