Seminar: Xingshan Cui
Quantum Max-flow/Min-cut
Xingshan Cui, University of California, Santa Barbara
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating a tensor to each node in an integral flow network, we can also interpret it as a tensor network, and more specifically, as a linear map.