The bridge-graph quantum max-flow conjecture below the cut threshold
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.