Lesson 09 - Route-D Hidden-Vertex Frontier

Goal

Understand Route D: the attempt to recover a classical or auxiliary-variable semantics for stabilizer cut rank after ordinary terminal routing semantics fail.

Prerequisites And Diagnostic Checks

1. What is a terminal cut function?
2. What is the difference between visible terminals and hidden auxiliary variables?
3. Why would hidden variables make a cut-function representation more expressive?
4. Why is expressibility not automatically compiler meaning?

Concrete Motivation

After Lessons 05 and 06, the state is:

• submodular cut congestion is a theorem-level compiler lower-bound object;
• ordinary graph or hypergraph terminal routing semantics fail in general;
• binary matroid cut rank has algebraic graph cut-rank realizations, but not classical edge-capacity semantics.

Route D asks whether a richer auxiliary-variable representation can recover something useful.

The central warning is:

exact auxiliary representability may be algebraically true but semantically too weak for compiler routing.

Worked Example Before Abstraction

Consider a function on visible qubits. A hidden-vertex graph-cut representation lets you add auxiliary variables and minimize over them. This can represent functions that no terminal-only graph cut can represent.

But a compiler lower bound needs more than representation. It needs a reason the auxiliary variables correspond to something physical, routable, or serviceable.

If hidden vertices have no physical meaning, the representation may be only a mathematical encoding.

Route-D State

The current key nodes are:

• connected-hidden-vertex-realizability-still-fails-terminal-routing-semantics.md
• route-d-semantic-separation-now-dominates-the-remaining-cd-frontier.md
• current-sourced-classical-auxiliary-semantics-still-add-no-new-compiler-meaning-beyond-cdsub.md

The graph ranks the subroutes as:

\[ D2>D1>D3. \]

In words:

• D1: terminal and basis-robust impossibility results are important but boundary-like;
• D2: the main semantic question is whether auxiliary hidden-vertex representations mean anything compiler-native;
• D3: positive expressibility for larger connected families is secondary unless it brings a new semantics.

Connected Witness Lesson

A connected 5-qubit stabilizer example can be hidden-vertex graph-cut representable while failing exact terminal nonnegative hypergraph semantics.

This separates two ideas:

• hidden-variable expressibility;
• routing-style terminal semantics.

That is the current Route-D lesson. Even connected examples can be representable in a hidden-variable algebraic sense without becoming packet-routing demand on the physical qubits.

Boundary Packages

Several nodes keep the boundary precise:

• six-qubit-stabilizer-cut-rank-escapes-modular-plus-fan-cone.md
• six-qubit-witness-is-hidden-vertex-graph-cut-representable.md
• parallel-class-affine-basis-family-is-hidden-vertex-graph-cut-representable.md
• multiple-parallel-classes-on-one-circuit-give-connected-cut-rank-at-least-three-family.md
• selected-or-selector-is-not-hidden-vertex-graph-cut-expressible.md

The lesson is not that hidden-vertex representation always fails. The lesson is that the current positive and negative evidence does not yet produce a compiler-meaningful CD semantics beyond the settled submodular cut object.

Conjecture Linkage

Route D is relevant only because Conjecture 3 originally wants a CD(T_n,G)-style statement. If CD means classical routing, then stabilizer cut rank must be connected to routing semantics. The graph says that connection is subtle.

The current safe statement is:

submodular CD gives a theorem-level lower-bound object; hidden-vertex and auxiliary semantics remain frontier work unless they acquire physical compiler meaning.

What This Does And Does Not Prove

This proves:

• hidden-variable expressibility is distinct from terminal routing semantics;
• connected witness examples already separate these notions;
• Route D's main frontier is semantic, not merely representational.

This does not prove:

• no hidden-variable representation can ever be useful;
• no whole-family Route-D theorem exists;
• the original CD(T_n,G) statement is impossible.

Active Recall

1. Why is hidden-variable expressibility more permissive than terminal cut semantics?
2. Why is that not automatically useful for compilers?
3. What is the meaning of the Route-D ranking \(D2>D1>D3\)?
4. What does the connected 5-qubit witness separate?
5. What would a successful Route-D theorem need to add?

Next-Step Handoff

Next lesson: integrate all routes into a personal alignment checklist and choose the next research action.