Session 09 - Integration: Reading the Research Map

Status: planned.

Prerequisites And Diagnostics

Ask the learner to explain the proof chain:

good QLDPC parameters -> expansion demand -> hardware cut bottleneck -> syndrome-depth lower bound

Then ask where the chain becomes non-obvious.

Lesson Scope

• Trace the lower-bound proof chain through the current research graph.
• Locate which results settle the minimal static 2D target.
• Distinguish the stabilizer-measurement model from full compiler-native CD(T_n,G).
• Explain congestion-dilation versus stabilizer cut rank.
• Practice reading one research card independently.
• Position the next course around matroid connectivity and compiler-native semantics.

Source Anchors

• ../../../../index.md
• ../../../../research/graph-audit.md
• quantum-tanner-good-family-presentation-invariant-2d-barrier.md
• stabilizer-cut-rank-defines-canonical-submodular-cd-object.md
• submodular-cut-congestion-lower-bounds-swap-only-compiler-depth.md
• generic-submodular-demand-does-not-force-classical-routing-realization.md

Active Recall

• Which theorem settles the minimal static 2D target for theorem-level Quantum Tanner families?
• Why does an ordinary guest graph fail to capture stabilizer cut-rank demand in general?
• What is the next mathematical layer after this course?

Next-Step Handoff

The next course should focus on matroid connectivity, stabilizer cut rank, and the compiler-native CD frontier.