The bridge-graph quantum max-flow conjecture below the cut threshold

About 4 years old · traced to

Let ww be a positive integer and let (a,b)(a,b) and (a′,b′)(a',b') lie in Uw∪Vw∪Ww\mathbf{U}_w\cup\mathbf{V}_w\cup\mathbf{W}_w, with ab′≤a′bab'\leq a'b. Consider the corresponding bridge graph with bond dimension ww. Bridge-graph threshold conjecture. Its quantum max-flow equals its quantum min-cut and is ab′ab':

QMaxFlow⁡=QMinCut⁡=ab′.\operatorname{QMaxFlow}=\operatorname{QMinCut}=ab'.

This is the conjectural case singled out among the regions not covered by the paper's proved results. The inequality selects the smaller of the two evident cut values, and the claim is presented as open.

References

Primary source

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.