Lecture audit and resequencing

Prepared 4 October 2026 · Instructor working materials

All revised decks · Slide-by-slide source map · Every original slide: disposition

Result and teaching sequence

Six Q2 foundation decks, eight Q3 meeting decks, and four Q4 physical-machine decks have been assembled from the deployed slides. Q1 (Lectures 1–6) stays unchanged. Q3 starts with a conceptual introduction to computational models inside the M0 meeting; it does not add a ninth meeting. The complete circuit model and executable Qiskit examples occur at MQ.

Bruna owns the 24 Q2/Q4 placeholders. The 17 Q3 placeholders are assigned to Matthew. A separate Bruna packet collects her placeholders; the same slides are also inserted in the corresponding course decks.

These are editable authoring drafts. Placeholder slides specify missing teaching content; their presence does not mean a lecture is complete. In particular, DJ/BV, Grover, QFT/QPE, and Shor still need worked derivations and exercises.

What changed in the mixed lectures

No original deck was overwritten or deleted. Original files remain the archive; the revised decks are the new teaching order.

Corrections and exclusions

SourceDecision
Lecture 7: 8, 13–14Replace the claim that state-space size guarantees quantum speedup and the unit-sphere-only account of physical states. New course connections distinguish dimension, normalized states, and global phase.
Lecture 8: 14A deterministic transition has one 1 per column; reversibility also requires bijectivity. Replaced with a corrected model connection.
Lecture 8: 16–32Keep the worked Markov sequence together in M1. Added a caveat: a finite chain need not converge to a unique stationary distribution.
Lecture 9: 16, 19, 22, 26–31Omitted misleading interference language, interpretive overclaims, an erroneous Bloch example, and conflated measurement/decoherence material. Bruna placeholders specify the replacement foundations.
Lecture 9: 51–56Bell material requires a fresh worked derivation and careful assumptions. Incorrect set/inequality examples and misleading locality claims are omitted; Bruna owns the Q2 replacement. M3 retains Bell-state preparation and adds a no-signalling connection.
Lecture 9: 68–72, 75, 77, 90–91Old login/setup steps, unsupported output-based claims of hardware advantage, and dated hardware numbers are omitted. Current setup and code testing belong to Matthew at MQ; dated physical-platform comparison belongs to Bruna in Q4.
Lecture 9: 81, 85The early Deutsch example contains Qiskit and lacks a complete target-preparation explanation. It is omitted. The QFT cost comparison needs consistent input size and an output-access caveat, so it is omitted too.
Lecture 10: 5, 7–9Omitted misleading state/search statements and the ambiguous 2.2-step search comparison. Correct state/probability connections and a complete Grover worked-example placeholder replace these uses.
Lecture 12: 41–42Unfinished Hamiltonian material becomes an explicit Bruna development task in Q2.
Lecture 13: 10–22Do not carry forward overstatements about computability, simulation lower bounds, or factoring complexity. A concise corrected connection appears in MQ.
Original covers / numberingSome source covers have inconsistent lecture numbers. Revised covers identify quarter and topic; provenance uses file name and physical slide number, not an old title printed inside the slide.
Source outlines, Lectures 15–48Most are five-slide planning outlines. Selected relevant questions and experiment prompts are retained, but these are not complete lectures or worked solutions.

Readiness and verification limits

Verification: all 19 PowerPoint packages passed structural checks and import checks. All 270 delivered PDF pages rendered successfully. All 177 retained source-page occurrences matched the original PDF renders pixel for pixel. Source-slide object hashes were checked against the assembled PowerPoints.

Development tasks and exact slide order

Q2_01_Tensor_Products — Tensor products and system composition (20 slides)

Weeks 5–6

  1. Tensor products and system composition (new cover / course connection)
  2. Lecture 7, original slide 4
  3. Lecture 7, original slide 5
  4. Lecture 7, original slide 6
  5. Lecture 7, original slide 7
  6. Dimensions and physical states (new cover / course connection)
  7. Lecture 7, original slide 9
  8. Lecture 7, original slide 10
  9. Lecture 7, original slide 11
  10. Lecture 7, original slide 12
  11. Lecture 7, original slide 15
  12. Lecture 7, original slide 16
  13. Lecture 7, original slide 17
  14. Lecture 7, original slide 18
  15. Lecture 7, original slide 19
  16. Lecture 7, original slide 30
  17. Lecture 7, original slide 31
  18. Lecture 7, original slide 32
  19. Product states and nonseparable states — Bruna placeholder

    Add a worked tensor product with the basis order stated.

    Contrast it with a normalized two-system state that cannot factor into a product. Use state vectors without circuit programming.

  20. Physical meaning of a subsystem — Bruna placeholder

    Choose a physical two-level example. Identify the preparation and the measured observable for each subsystem.

    Explain which assumptions let us model the pair as a tensor product.

Q2_02_States_and_Measurement — Quantum states and measurement probabilities (15 slides)

Weeks 5–6

  1. Quantum states and measurement probabilities (new cover / course connection)
  2. Lecture 10, original slide 4
  3. Amplitudes and probabilities (new cover / course connection)
  4. Lecture 10, original slide 6
  5. Lecture 10, original slide 10
  6. Lecture 10, original slide 11
  7. Lecture 10, original slide 12
  8. Lecture 10, original slide 13
  9. Lecture 10, original slide 14
  10. Lecture 10, original slide 15
  11. Lecture 10, original slide 16
  12. Lecture 10, original slide 17
  13. Lecture 10, original slide 18
  14. Preparation versus statistical mixture — Bruna placeholder

    Develop one physical preparation of a superposition and one mixture with the same probabilities in a chosen basis.

    Use a second measurement basis to distinguish them.

  15. A complete Born-rule example — Bruna placeholder

    Specify a normalized state and a measurement basis. Calculate every outcome probability and the post-measurement state.

    Include a student checkpoint with a different basis.

Q2_03_Waves_and_Interference — Waves, amplitudes, and interference (15 slides)

Week 6

  1. Waves, amplitudes, and interference (new cover / course connection)
  2. Lecture 9, original slide 15
  3. Lecture 9, original slide 17
  4. Lecture 9, original slide 18
  5. Lecture 9, original slide 24
  6. Lecture 9, original slide 25
  7. Lecture 8, original slide 42
  8. Lecture 8, original slide 43
  9. Lecture 8, original slide 44
  10. Lecture 8, original slide 45
  11. Lecture 8, original slide 46
  12. Lecture 8, original slide 47
  13. Lecture 8, original slide 48
  14. Single-particle interference — Bruna placeholder

    Add the experiment, preparation, and detection procedure.

    Explain interference between indistinguishable alternatives for a single quantum system. Avoid describing it as photons needing to collide with one another.

  15. Which-path information and coherence — Bruna placeholder

    Compare coherent alternatives with distinguishable paths. Connect the observed distributions to amplitude addition and probability addition.

    Distinguish loss of local coherence from conditioning on a measurement outcome.

Q2_04_Observables — Observables and measurement (20 slides)

Week 6–7

  1. Observables and measurement (new cover / course connection)
  2. Lecture 11, original slide 2
  3. Lecture 11, original slide 3
  4. Lecture 11, original slide 4
  5. Lecture 11, original slide 5
  6. Lecture 11, original slide 7
  7. Lecture 11, original slide 8
  8. Lecture 11, original slide 9
  9. Lecture 11, original slide 11
  10. Lecture 11, original slide 12
  11. Lecture 11, original slide 13
  12. Lecture 11, original slide 14
  13. Lecture 11, original slide 15
  14. Lecture 11, original slide 16
  15. Lecture 11, original slide 17
  16. Lecture 11, original slide 18
  17. Lecture 11, original slide 19
  18. Lecture 11, original slide 21
  19. Stern–Gerlach measurement model — Bruna placeholder

    Develop the preparation, magnetic-field gradient, and readout.

    Separate the Pauli observable with eigenvalues ±1 from physical spin angular momentum with eigenvalues ±ℏ/2.

  20. Sequential measurements — Bruna placeholder

    Work through two measurement axes and conditional probabilities.

    Explain the change of state and the difference between an observable, apparatus setting, and observed value.

Q2_05_Dynamics — Unitary dynamics and physical evolution (11 slides)

Week 7

  1. Unitary dynamics and physical evolution (new cover / course connection)
  2. Lecture 12, original slide 4
  3. Lecture 12, original slide 5
  4. Lecture 12, original slide 6
  5. Lecture 12, original slide 7
  6. Lecture 12, original slide 8
  7. Lecture 12, original slide 9
  8. Lecture 12, original slide 10
  9. Hamiltonian and time evolution — Bruna placeholder

    Derive the connection between the Schrödinger equation and U(t) for a time-independent Hermitian Hamiltonian.

    State the assumptions and units. Replace the unfinished derivation in original Lecture 12, slides 41–42.

  10. Energy eigenstates and relative phase — Bruna placeholder

    Use a two-level energy spectrum to calculate phase accumulation.

    Distinguish a shared global phase from a relative phase observable in a suitable basis.

  11. Physics-to-computation boundary — Bruna placeholder

    Finish with a worked physical evolution and its unitary matrix.

    Q3 will treat selected transformations as allowed computational operations. Leave circuit software for M_Q.

Q2_06_Entanglement — Entanglement and physical correlations (6 slides)

Week 8

  1. Entanglement and physical correlations (new cover / course connection)
  2. Lecture 9, original slide 44
  3. Lecture 9, original slide 50
  4. Entanglement and local statistics — Bruna placeholder

    Define separability and entanglement with explicit joint states.

    Calculate joint probabilities and each subsystem’s marginal probabilities. Explain why correlations do not permit faster-than-light messaging.

  5. Bell assumptions and an experimental test — Bruna placeholder

    State the assumptions behind the chosen Bell inequality. Give measurement settings, a classical bound, and a quantum prediction.

    Explain experimental limitations without claiming that the result proves faster-than-light communication.

  6. Q2 synthesis exercise — Bruna placeholder

    Combine state preparation, tensor products, measurement bases, and physical evolution in one problem.

    Students should explain the predicted evidence before Q3 introduces computational models.

Q3_01_Models_and_M0 — Computational models and M₀ (19 slides)

Week 9 Tuesday

  1. Computational models and M₀ (new cover / course connection)
  2. States, rules, and outputs (new cover / course connection)
  3. Lecture 13, original slide 5
  4. Lecture 13, original slide 7
  5. Lecture 13, original slide 8
  6. Lecture 13, original slide 9
  7. Lecture 8, original slide 5
  8. Lecture 8, original slide 6
  9. Lecture 8, original slide 7
  10. Lecture 8, original slide 8
  11. Lecture 8, original slide 9
  12. Lecture 8, original slide 10
  13. Lecture 8, original slide 12
  14. Lecture 8, original slide 13
  15. Deterministic and reversible maps (new cover / course connection)
  16. Lecture 8, original slide 15
  17. Lecture 7, original slide 22
  18. Ancillas and reversible logic — Matthew placeholder

    Develop Toffoli and Fredkin truth tables, clean workspace bits, and uncomputation.

    Add a small reversible puzzle with its allowed operations and a proof that the final ancillas reset.

  19. A reversible oracle contract — Matthew placeholder

    Define input bits, output bits, and the reversible embedding of a Boolean function.

    Test the complete truth table. This oracle contract will support Deutsch and the later query algorithms.

Q3_02_M1 — M₁: Probabilistic computation (20 slides)

Week 9 Thursday

  1. M₁: Probabilistic computation (new cover / course connection)
  2. Lecture 8, original slide 16
  3. Lecture 8, original slide 17
  4. Lecture 8, original slide 18
  5. Lecture 8, original slide 19
  6. Lecture 8, original slide 20
  7. Lecture 8, original slide 21
  8. Lecture 8, original slide 22
  9. Lecture 8, original slide 23
  10. Lecture 8, original slide 24
  11. Lecture 8, original slide 25
  12. Lecture 8, original slide 26
  13. Lecture 8, original slide 27
  14. Lecture 8, original slide 28
  15. Lecture 8, original slide 29
  16. Lecture 8, original slide 30
  17. Lecture 8, original slide 31
  18. Lecture 8, original slide 32
  19. Scope of the steady-state example (new cover / course connection)
  20. Sampling and a classical baseline — Matthew placeholder

    Add a sampling puzzle with a declared success criterion and sample budget.

    Compare deterministic and randomized query strategies using the same oracle. Distinguish a distribution from an individual sampled state.

Q3_03_M2_Deutsch — M₂: Amplitudes and interference (16 slides)

Week 10 Tuesday

  1. M₂: Amplitudes and interference (new cover / course connection)
  2. The real-amplitude model (new cover / course connection)
  3. Lecture 12, original slide 29
  4. Lecture 12, original slide 30
  5. Lecture 12, original slide 31
  6. Lecture 12, original slide 32
  7. Lecture 12, original slide 33
  8. Lecture 12, original slide 34
  9. Lecture 12, original slide 35
  10. Lecture 12, original slide 36
  11. Lecture 7, original slide 28
  12. Lecture 9, original slide 39
  13. Lecture 9, original slide 80
  14. Lecture 16, original slide 2
  15. A sign-interference puzzle — Matthew placeholder

    Develop Z as a sign flip and compare H followed by H with H, Z, H.

    Trace amplitudes by hand and derive the final measurement probabilities.

  16. Deutsch with an explicit oracle register — Matthew placeholder

    Work through all four one-bit Boolean functions using the reversible oracle from M₀.

    Display the four-component state and phase kickback. Introduce the two-register bookkeeping here, then formalize tensor composition in M₃.

Q3_04_M3_Composite — M₃: Composite quantum systems (12 slides)

Week 10 Thursday

  1. M₃: Composite quantum systems (new cover / course connection)
  2. Lecture 7, original slide 9
  3. Lecture 7, original slide 10
  4. Lecture 7, original slide 11
  5. Lecture 9, original slide 35
  6. Lecture 9, original slide 36
  7. Lecture 9, original slide 40
  8. Lecture 9, original slide 46
  9. Lecture 9, original slide 50
  10. Bell correlations and communication (new cover / course connection)
  11. CNOT and Bell-state preparation — Matthew placeholder

    Define the four-by-four CNOT matrix in the declared basis order.

    Apply H to one input and then CNOT. Show the joint state after each step and prove that the result does not factor.

  12. Composite-system checkpoints — Matthew placeholder

    Compare a product state and an entangled state using amplitudes and joint probabilities.

    Add an exercise on operator order and a controlled operation. Reserve software implementation for M_Q.

Q3_05_M3_Interference — Computing with M₃: Multi-qubit interference (8 slides)

Week 11 Tuesday

  1. Computing with M₃: Multi-qubit interference (new cover / course connection)
  2. Lecture 17, original slide 2
  3. Lecture 9, original slide 83
  4. Lecture 9, original slide 84
  5. Lecture 18, original slide 2
  6. Deutsch–Jozsa derivation — Matthew placeholder

    Specify the constant-or-balanced promise and reversible oracle.

    Derive the all-zero amplitude, then trace one constant and one balanced two-bit example. Compare exact and randomized classical query baselines.

  7. Bernstein–Vazirani derivation — Matthew placeholder

    Define the hidden bit string and parity oracle.

    Show how phase kickback and the final Hadamards reveal the string. Include a hand-worked example and its classical query comparison.

  8. Oracle cost and model limits — Matthew placeholder

    State what counts as a query. Separate query complexity from the cost of constructing the oracle.

    Include a check that ancillas return to their intended state.

Q3_06_M3_Grover — Computing with M₃: Amplitude amplification (6 slides)

Week 11 Thursday

  1. Computing with M₃: Amplitude amplification (new cover / course connection)
  2. Lecture 20, original slide 2
  3. Lecture 21, original slide 2
  4. A complete four-item search — Matthew placeholder

    Choose one marked state and define the phase oracle.

    Write all four amplitudes before and after the oracle and diffuser. Derive the success probability without software.

  5. Grover rotation and stopping — Matthew placeholder

    Derive the two-dimensional rotation and an appropriate iteration count.

    Show over-rotation, multiple marked items, and the assumptions behind the quadratic query advantage.

  6. Search resources and limits — Matthew placeholder

    Separate oracle calls, oracle construction, state preparation, and measurement cost.

    Replace the ambiguous average-step and hardware-size claims in original Lecture 10, slides 8–9.

Q3_07_M4_Phase — M₄: Complex phase, QFT, and QPE (23 slides)

Week 12 Tuesday

  1. M₄: Complex phase, QFT, and QPE (new cover / course connection)
  2. From signs to complex phases (new cover / course connection)
  3. Lecture 12, original slide 12
  4. Lecture 12, original slide 13
  5. Lecture 12, original slide 14
  6. Lecture 12, original slide 15
  7. Lecture 12, original slide 16
  8. Lecture 12, original slide 17
  9. Lecture 12, original slide 18
  10. Lecture 12, original slide 19
  11. Lecture 12, original slide 20
  12. Lecture 12, original slide 21
  13. Lecture 12, original slide 22
  14. Lecture 12, original slide 23
  15. Lecture 12, original slide 24
  16. Lecture 12, original slide 25
  17. Lecture 12, original slide 26
  18. Lecture 12, original slide 27
  19. Lecture 12, original slide 28
  20. Lecture 23, original slide 2
  21. Lecture 9, original slide 86
  22. Phase gates and roots of unity — Matthew placeholder

    Define the phase gate and controlled phase operation.

    Use roots of unity to work through a small Fourier transform, including its normalization and basis-order convention.

  23. QFT and quantum phase estimation — Matthew placeholder

    Derive a small QFT and its inverse. Then specify an eigenstate input, controlled powers of U, and the QPE readout.

    Trace an exactly representable phase and explain finite-precision outcomes.

Q3_08_MQ_Qiskit — M_Q: Complete circuits and Qiskit (19 slides)

Week 12 Thursday

  1. M_Q: Complete circuits and Qiskit (new cover / course connection)
  2. The complete circuit model (new cover / course connection)
  3. Lecture 9, original slide 41
  4. Lecture 9, original slide 42
  5. Lecture 9, original slide 43
  6. Lecture 14, original slide 2
  7. Lecture 12, original slide 39
  8. Lecture 11, original slide 20
  9. Lecture 12, original slide 11
  10. Lecture 9, original slide 64
  11. Lecture 9, original slide 73
  12. Lecture 9, original slide 74
  13. A tested Qiskit lab — Matthew placeholder

    Specify supported package versions and test the examples in the actual teaching environment.

    Explain qubit order, statevectors, shots, and counts. Reproduce the earlier H/Z and Bell-state calculations before running an algorithm.

  14. Computability and efficiency (new cover / course connection)
  15. Lecture 22, original slide 2
  16. Lecture 22, original slide 4
  17. Lecture 24, original slide 2
  18. Lecture 24, original slide 4
  19. Period finding and Shor capstone — Matthew placeholder

    Trace a small modular-exponentiation example through order finding and classical factor recovery.

    Explain failed base choices, finite precision, and the difference between a demonstration circuit and a scalable implementation.

Q4_01_Information — Information in physical quantum systems (8 slides)

Week 13

  1. Information in physical quantum systems (new cover / course connection)
  2. Lecture 8, original slide 11
  3. Lecture 34, original slide 2
  4. Lecture 34, original slide 4
  5. Lecture 35, original slide 2
  6. Lecture 35, original slide 4
  7. Density matrices and reduced states — Bruna placeholder

    Develop pure states, statistical mixtures, and the partial trace with worked two-level examples.

    Show how a pure entangled joint state gives a mixed local state.

  8. Entropy and physical information — Bruna placeholder

    Calculate Shannon and von Neumann entropy in small examples.

    Connect the eigenvalues of a density matrix to uncertainty, purity, and correlations. Define all conventions.

Q4_02_Noise — Decoherence, noise, and mitigation (8 slides)

Week 14

  1. Decoherence, noise, and mitigation (new cover / course connection)
  2. Lecture 36, original slide 2
  3. Lecture 36, original slide 4
  4. Lecture 45, original slide 2
  5. Lecture 45, original slide 4
  6. A physical decoherence mechanism — Bruna placeholder

    Develop one system–environment coupling model. Calculate the reduced state and the loss of off-diagonal coherence.

    Distinguish decoherence, measurement conditioning, relaxation, and dephasing.

  7. Noise channels and time scales — Bruna placeholder

    Introduce T₁ and T₂ with physical preparation and readout procedures.

    Work through a simple channel and compare ideal and noisy output probabilities.

  8. Error mitigation and its limits — Bruna placeholder

    Choose a mitigation method and state its calibration assumptions.

    Compare bias, variance, and sampling overhead. Explain why mitigation alone does not provide fault tolerance.

Q4_03_Hardware — Physical qubits and error correction (14 slides)

Week 15

  1. Physical qubits and error correction (new cover / course connection)
  2. Lecture 9, original slide 58
  3. Lecture 9, original slide 59
  4. Lecture 9, original slide 60
  5. Lecture 9, original slide 61
  6. Lecture 9, original slide 62
  7. Lecture 9, original slide 63
  8. Lecture 44, original slide 2
  9. Lecture 44, original slide 4
  10. Lecture 46, original slide 2
  11. Lecture 46, original slide 4
  12. Current hardware comparison — Bruna placeholder

    Update the illustrative platform and vendor examples with dated primary sources.

    Compare encoding, control, readout, connectivity, coherence, and native operations. Separate physical and logical qubits.

  13. Logical qubits and syndrome measurement — Bruna placeholder

    Develop one small code, its encoding, and a syndrome table.

    Show which errors it corrects and which it cannot. Explain why syndrome measurement can preserve logical information.

  14. Fault tolerance and overhead — Bruna placeholder

    Connect physical error rates, code distance, and logical failure probability.

    State the assumptions behind a threshold claim and provide a worked resource example.

Q4_04_Limits — Physical limits and course synthesis (6 slides)

Week 16

  1. Physical limits and course synthesis (new cover / course connection)
  2. Lecture 47, original slide 2
  3. Lecture 47, original slide 4
  4. Lecture 48, original slide 2
  5. An evidence-based hardware case study — Bruna placeholder

    Choose a dated result from a primary source. Identify the task, classical comparison, accuracy, and total resources.

    Distinguish a simulator demonstration, a query advantage, and useful hardware performance.

  6. Final synthesis assessment — Bruna placeholder

    Trace one Q3 algorithm through state preparation, compilation, noisy execution, and readout.

    Ask students to explain what would have to improve for the demonstration to become useful.

Bruna_Q2_Q4_Placeholders — Bruna: Q2 and Q4 development placeholders (24 slides)

Authoring packet

  1. Product states and nonseparable states — Bruna placeholder

    Add a worked tensor product with the basis order stated.

    Contrast it with a normalized two-system state that cannot factor into a product. Use state vectors without circuit programming.

  2. Physical meaning of a subsystem — Bruna placeholder

    Choose a physical two-level example. Identify the preparation and the measured observable for each subsystem.

    Explain which assumptions let us model the pair as a tensor product.

  3. Preparation versus statistical mixture — Bruna placeholder

    Develop one physical preparation of a superposition and one mixture with the same probabilities in a chosen basis.

    Use a second measurement basis to distinguish them.

  4. A complete Born-rule example — Bruna placeholder

    Specify a normalized state and a measurement basis. Calculate every outcome probability and the post-measurement state.

    Include a student checkpoint with a different basis.

  5. Single-particle interference — Bruna placeholder

    Add the experiment, preparation, and detection procedure.

    Explain interference between indistinguishable alternatives for a single quantum system. Avoid describing it as photons needing to collide with one another.

  6. Which-path information and coherence — Bruna placeholder

    Compare coherent alternatives with distinguishable paths. Connect the observed distributions to amplitude addition and probability addition.

    Distinguish loss of local coherence from conditioning on a measurement outcome.

  7. Stern–Gerlach measurement model — Bruna placeholder

    Develop the preparation, magnetic-field gradient, and readout.

    Separate the Pauli observable with eigenvalues ±1 from physical spin angular momentum with eigenvalues ±ℏ/2.

  8. Sequential measurements — Bruna placeholder

    Work through two measurement axes and conditional probabilities.

    Explain the change of state and the difference between an observable, apparatus setting, and observed value.

  9. Hamiltonian and time evolution — Bruna placeholder

    Derive the connection between the Schrödinger equation and U(t) for a time-independent Hermitian Hamiltonian.

    State the assumptions and units. Replace the unfinished derivation in original Lecture 12, slides 41–42.

  10. Energy eigenstates and relative phase — Bruna placeholder

    Use a two-level energy spectrum to calculate phase accumulation.

    Distinguish a shared global phase from a relative phase observable in a suitable basis.

  11. Physics-to-computation boundary — Bruna placeholder

    Finish with a worked physical evolution and its unitary matrix.

    Q3 will treat selected transformations as allowed computational operations. Leave circuit software for M_Q.

  12. Entanglement and local statistics — Bruna placeholder

    Define separability and entanglement with explicit joint states.

    Calculate joint probabilities and each subsystem’s marginal probabilities. Explain why correlations do not permit faster-than-light messaging.

  13. Bell assumptions and an experimental test — Bruna placeholder

    State the assumptions behind the chosen Bell inequality. Give measurement settings, a classical bound, and a quantum prediction.

    Explain experimental limitations without claiming that the result proves faster-than-light communication.

  14. Q2 synthesis exercise — Bruna placeholder

    Combine state preparation, tensor products, measurement bases, and physical evolution in one problem.

    Students should explain the predicted evidence before Q3 introduces computational models.

  15. Density matrices and reduced states — Bruna placeholder

    Develop pure states, statistical mixtures, and the partial trace with worked two-level examples.

    Show how a pure entangled joint state gives a mixed local state.

  16. Entropy and physical information — Bruna placeholder

    Calculate Shannon and von Neumann entropy in small examples.

    Connect the eigenvalues of a density matrix to uncertainty, purity, and correlations. Define all conventions.

  17. A physical decoherence mechanism — Bruna placeholder

    Develop one system–environment coupling model. Calculate the reduced state and the loss of off-diagonal coherence.

    Distinguish decoherence, measurement conditioning, relaxation, and dephasing.

  18. Noise channels and time scales — Bruna placeholder

    Introduce T₁ and T₂ with physical preparation and readout procedures.

    Work through a simple channel and compare ideal and noisy output probabilities.

  19. Error mitigation and its limits — Bruna placeholder

    Choose a mitigation method and state its calibration assumptions.

    Compare bias, variance, and sampling overhead. Explain why mitigation alone does not provide fault tolerance.

  20. Current hardware comparison — Bruna placeholder

    Update the illustrative platform and vendor examples with dated primary sources.

    Compare encoding, control, readout, connectivity, coherence, and native operations. Separate physical and logical qubits.

  21. Logical qubits and syndrome measurement — Bruna placeholder

    Develop one small code, its encoding, and a syndrome table.

    Show which errors it corrects and which it cannot. Explain why syndrome measurement can preserve logical information.

  22. Fault tolerance and overhead — Bruna placeholder

    Connect physical error rates, code distance, and logical failure probability.

    State the assumptions behind a threshold claim and provide a worked resource example.

  23. An evidence-based hardware case study — Bruna placeholder

    Choose a dated result from a primary source. Identify the task, classical comparison, accuracy, and total resources.

    Distinguish a simulator demonstration, a query advantage, and useful hardware performance.

  24. Final synthesis assessment — Bruna placeholder

    Trace one Q3 algorithm through state preparation, compilation, noisy execution, and readout.

    Ask students to explain what would have to improve for the demonstration to become useful.

References for new conceptual connections

IBM: Multiple systems · IBM: Fundamentals of quantum algorithms · IBM: Grover’s algorithm