The bridge-graph quantum max-flow conjecture below the cut threshold
The bridge-graph quantum max-flow conjecture below the cut threshold
Let be a positive integer and let and lie in , with . Consider the corresponding bridge graph with bond dimension . Bridge-graph threshold conjecture. Its quantum max-flow equals its quantum min-cut and is :
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.
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
Sign in to submit a solution.
No solutions have been posted yet.