Cp/tfqa add - #5609
Merged
Merged
Cp/tfqa add#5609
Conversation
|
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
abbycross
reviewed
Sep 15, 2026
| "<Accordion>\n", | ||
| "<AccordionItem title=\"Answer\">\n", | ||
| "\n", | ||
| "(a) Qubit 3 could be affected, as well as obviously qubit 2 itself. No others! If you listed qubits 0 and 1, note that qubit 2 is the target of the ECR entangling it with qubit 1. No change is made to qubit 1 in that gate. (b) qubits 0-3 could be affected. The bit flip or X-type error does not commute with the ZZ coupling in the ECR gate and thus can propagate from the target to the control.\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "(a) Qubit 3 could be affected, as well as obviously qubit 2 itself. No others! If you listed qubits 0 and 1, note that qubit 2 is the target of the ECR entangling it with qubit 1. No change is made to qubit 1 in that gate. (b) qubits 0-3 could be affected. The bit flip or X-type error does not commute with the ZZ coupling in the ECR gate and thus can propagate from the target to the control.\n", | |
| "(a) Qubit 3 could be affected, as well as obviously qubit 2 itself. No others! If you listed qubits 0 and 1, note that qubit 2 is the target of the ECR entangling it with qubit 1. No change is made to qubit 1 in that gate. (b) Qubits 0-3 could be affected. The bit flip or X-type error does not commute with the ZZ coupling in the ECR gate and thus can propagate from the target to the control.\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "In the previous section we discussed error propagation without giving it a formal definition. Going forward:\n", | ||
| "\n", | ||
| "For an error $E$ that occurs before some part of the logical payload of a circuit $U$, error propagation means finding the equivalent operator $E'$' that reproduces the same faulty outcome when applied after $U$ instead of before it.\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "For an error $E$ that occurs before some part of the logical payload of a circuit $U$, error propagation means finding the equivalent operator $E'$' that reproduces the same faulty outcome when applied after $U$ instead of before it.\n", | |
| "For an error $E$ that occurs before some part of the logical payload of a circuit $U$, error propagation means finding the equivalent operator $E'$ that reproduces the same faulty outcome when applied after $U$ instead of before it.\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "The image of error propagation in the previous section suggested that errors could spread from a control qubit to a target qubit across a CNOT gate. One way to check when this is true is to consider an error on the control or on the target prior to entanglement, and check whether that operator commutes with the CNOT gate. If the two operators commute, then there is no difference if you apply them in the reverse order, meaning the error could be simply \"moved past\" the CNOT without having any effect on other qubits. This is the most common way people approach error propagation, and it yields the following rules:\n", | ||
| "\n", | ||
| "Let control be qubit 0 and target be qubit 1. And consider X and Z errors on the control and target qubits ($X_c$, $Z_c$, $X_t$, and $Z_t$, respectively). Moving these errors past a $\\text{CNOT}_{0\\to1}$ causes the errors to become:\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "Let control be qubit 0 and target be qubit 1. And consider X and Z errors on the control and target qubits ($X_c$, $Z_c$, $X_t$, and $Z_t$, respectively). Moving these errors past a $\\text{CNOT}_{0\\to1}$ causes the errors to become:\n", | |
| "Let control be qubit 0 and target be qubit 1. Consider X and Z errors on the control and target qubits ($X_c$, $Z_c$, $X_t$, and $Z_t$, respectively). Moving these errors past a $\\text{CNOT}_{0\\to1}$ causes the errors to become:\n", |
abbycross
reviewed
Sep 15, 2026
| "\\end{aligned}\n", | ||
| "$$\n", | ||
| "\n", | ||
| "We state the above without proof. But if you are like the author of this lesson, and prefer the Schr\\\"odinger picture, you can also write down arbitrary control and target states, apply the error, then the CNOT, and examine the final state. Comparing that final state to an error free case allows you to see what error combination applied after the CNOT would yield the erroneous state, and in particular, you can see if the error operation has spread from one qubit to the other.\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "We state the above without proof. But if you are like the author of this lesson, and prefer the Schr\\\"odinger picture, you can also write down arbitrary control and target states, apply the error, then the CNOT, and examine the final state. Comparing that final state to an error free case allows you to see what error combination applied after the CNOT would yield the erroneous state, and in particular, you can see if the error operation has spread from one qubit to the other.\n", | |
| "We state the above without proof. But if you are like the author of this lesson, and prefer the Schr\\\"odinger picture, you can also write down arbitrary control and target states, apply the error, then the CNOT, and examine the final state. If you compare that final state to an error-free case, you can see what error combination applied after the CNOT would yield the erroneous state, and in particular, you can see if the error operation has spread from one qubit to the other.\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "As you can imagine, tracking such propagation of error operators forward through circuits (or equivalently, propagating backward the operators to be measured) is complicated. Qiskit has tools to facilitate this, which we learn about in lesson 6 on modern workflows.\n", | ||
| "\n", | ||
| "There is a Qiskit addon called [Shaded Lightcones](https://qiskit.github.io/qiskit-addon-slc/). The shaded lightcones (SLC) addon analyzes error propagation in quantum circuits using Pauli propagation to identify which parts of a circuit can actually influence a target observable. It is designed primarily to make error mitigation more efficient, especially for probabilistic error cancellation (PEC) workflows. We will only briefly explore this tool here, and make wider use of it in the context of error mitigation techniques in future lessons. It uses Pauli operator propagation to map out propagation of errors of different types, producing a light cone for X, Y, and Z type errors.\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "There is a Qiskit addon called [Shaded Lightcones](https://qiskit.github.io/qiskit-addon-slc/). The shaded lightcones (SLC) addon analyzes error propagation in quantum circuits using Pauli propagation to identify which parts of a circuit can actually influence a target observable. It is designed primarily to make error mitigation more efficient, especially for probabilistic error cancellation (PEC) workflows. We will only briefly explore this tool here, and make wider use of it in the context of error mitigation techniques in future lessons. It uses Pauli operator propagation to map out propagation of errors of different types, producing a light cone for X, Y, and Z type errors.\n", | |
| "There is a Qiskit addon called [Shaded Lightcones](https://qiskit.github.io/qiskit-addon-slc/). The shaded lightcones (SLC) addon analyzes error propagation in quantum circuits by using Pauli propagation to identify which parts of a circuit can actually influence a target observable. It is designed primarily to make error mitigation more efficient, especially for probabilistic error cancellation (PEC) workflows. We will only briefly explore this tool here, and make wider use of it in the context of error mitigation techniques in future lessons. It uses Pauli operator propagation to map out propagation of errors of different types, producing a light cone for X, Y, and Z type errors.\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "\n", | ||
| "\n", | ||
| "Separates it into \"boxes\" useful for learning noise behavior:\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "Separates it into \"boxes\" useful for learning noise behavior:\n", | |
| "The workflow separates the circuit into \"boxes\" useful for learning noise behavior:\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "\n", | ||
| "\n", | ||
| "And finally uses operator propagation and noise learning to produce a shaded map of error susceptibility throughout the circuit:\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "And finally uses operator propagation and noise learning to produce a shaded map of error susceptibility throughout the circuit:\n", | |
| "Finally, it uses operator propagation and noise learning to produce a shaded map of error susceptibility throughout the circuit:\n", |
abbycross
reviewed
Sep 15, 2026
| "<Accordion>\n", | ||
| "<AccordionItem title=\"Answer\">\n", | ||
| "\n", | ||
| "It must be done after transpilation. In order for these different maps to be useful we must make sure that the adjacent qubits in our circuit corresponded to adjacent qubits on our quantum chip. Otherwise, entangling gates shown as acting on the adjacent qubits in the circuit diagram would end up requiring SWAP gates and more complicated circuit structure.\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "It must be done after transpilation. In order for these different maps to be useful we must make sure that the adjacent qubits in our circuit corresponded to adjacent qubits on our quantum chip. Otherwise, entangling gates shown as acting on the adjacent qubits in the circuit diagram would end up requiring SWAP gates and more complicated circuit structure.\n", | |
| "It must be done after transpilation. In order for these different maps to be useful we must make sure that the adjacent qubits in our circuit corresponded to adjacent qubits on our quantum chip. Otherwise, entangling gates shown as acting on the adjacent qubits in the circuit diagram would end up requiring SWAP gates and more a complicated circuit structure.\n", |
abbycross
reviewed
Sep 15, 2026
| "\n", | ||
| "### Energy relaxation ($T_1$) errors\n", | ||
| "\n", | ||
| "Recall from our discussion of thermal noise that at any non-zero temperature, there is some probability of a quantum system undergoing a transition between energy eigenstates. The relaxation ($|1\\rangle> \\rightarrow |0\\rangle$) dominates because it's driven by spontaneous emission (independent of temperature), while low temperature suppresses the competing excitation process. The longer a qubit sits idle, the more time it has to undergo such a transition. The probability that a qubit prepared in the state $|1\\rangle$ remains in $|1\\rangle$ after a time $t$ is given by\n", |
Collaborator
There was a problem hiding this comment.
Suggested change
| "Recall from our discussion of thermal noise that at any non-zero temperature, there is some probability of a quantum system undergoing a transition between energy eigenstates. The relaxation ($|1\\rangle> \\rightarrow |0\\rangle$) dominates because it's driven by spontaneous emission (independent of temperature), while low temperature suppresses the competing excitation process. The longer a qubit sits idle, the more time it has to undergo such a transition. The probability that a qubit prepared in the state $|1\\rangle$ remains in $|1\\rangle$ after a time $t$ is given by\n", | |
| "Recall from our discussion of thermal noise that at any non-zero temperature, there is some probability of a quantum system undergoing a transition between energy eigenstates. The relaxation ($|1\\rangle \\rightarrow |0\\rangle$) dominates because it's driven by spontaneous emission (independent of temperature), while low temperature suppresses the competing excitation process. The longer a qubit sits idle, the more time it has to undergo such a transition. The probability that a qubit prepared in the state $|1\\rangle$ remains in $|1\\rangle$ after a time $t$ is given by\n", |
abbycross
reviewed
Sep 15, 2026
abbycross
approved these changes
Sep 16, 2026
christopherporter1
left a comment
Collaborator
Author
There was a problem hiding this comment.
Perfect! Thank you!
abbycross
enabled auto-merge
September 16, 2026 14:48
auto-merge was automatically disabled
September 16, 2026 14:51
Pull request was closed
abbycross
enabled auto-merge
September 16, 2026 14:51
This branch had an error being deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Starting to add content for the Tools for Quantum Advantage course.