The three-bond-dimension reduction for the bridge-graph conjecture

From papers

Let (a,b)(a,b) and (a,b)(a',b') lie in U3V3W3\mathbf{U}_3\cup\mathbf{V}_3\cup\mathbf{W}_3, and consider the bridge graph with bond dimension 33 and boundary dimensions a,b,b,aa,b,b',a'. Three-bond-dimension reduction conjecture. One has

QMinCut=QMaxFlow=min{ab,ab}.\operatorname{QMinCut}=\operatorname{QMaxFlow}=\min\{a'b,ab'\}.

The paper proves a reduction showing that the preceding general bridge-graph conjecture is equivalent to this specialization at w=3w=3. Thus this displayed statement is the remaining three-bond-dimension case rather than an independent stronger assertion; its resolution would settle the general conjecture through the reduction.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Fulvio Gesmundo, Vladimir Lysikov and Vincent Steffan, “Quantum max-flow in the bridge graph”, arXiv:2212.09794 (2026).

Solutions 0

No solutions have been posted yet.