Quantum maxflow/mincut conjecture for tensor-network maps
Quantum maxflow/mincut conjecture for tensor-network maps
Let be a -valent graph with input cut edges and output cut edges, with the incoming edges at each vertex locally ordered. For a -index tensor on a vector space , let be the linear map obtained by placing a copy of at every vertex according to the local edge ordering and contracting along internal edges. Quantum maxflow/mincut conjecture. The map is injective for generic if and only if admits edge-disjoint paths from the input to the output. Moreover, its image is generic with respect to any fixed basis of : if basis vectors are inserted into output slots not lying on the edge-disjoint paths, then the resulting map is also injective for generic . This proposed quantum analogue of maxflow/mincut concerns injectivity and genericity of tensor-network maps; the supplied context gives no evidence that it has been resolved.
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
Danny Calegari, Michael Freedman and Kevin Walker, “Positivity of the universal pairing in 3 dimensions”, arXiv:0802.3208 (2009).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.