Related papers: Quantum Max-flow/Min-cut

The max-flow min-cut theorem is a cornerstone result in combinatorial optimization. Calegari et al. (arXiv:0802.3208) initialized the study of quantum max-flow min-cut conjecture, which connects the rank of a tensor network and the min-cut.…

The quantum max-flow min-cut conjecture relates the rank of a tensor network to the minimum cut in the case that all tensors in the network are identical\cite{mfmc1}. This conjecture was shown to be false in Ref. \onlinecite{mfmc2} by an…

The \emph{max-flow min-cut theorem} has been recently used in the theory of random tensor networks in quantum information theory, where it is helpful for computing the behavior of important physical quantities, such as the entanglement…

The Max-Flow Min-Cut theorem is the classical duality result for the Max-Flow problem, which considers flow of a single commodity. We study a multiple commodity generalization of Max-Flow in which flows are composed of real-valued k-vectors…

The quantum max-flow quantifies the maximal possible entanglement between two regions of a tensor network state for a fixed graph and fixed bond dimensions. In this work, we calculate the quantum max-flow exactly in the case of the bridge…

Intrigued by the capacity of random networks, we start by proving a max-flow min-cut theorem that is applicable to any random graph obeying a suitably defined independence-in-cut property. We then show that this property is satisfied by…

This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…

We discover the quantum analog of the well-known classical maximum power transfer theorem. Our theoretical framework considers the continuous steady-state problem of coherent energy transfer through an N-node bosonic network coupled to an…

Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these…

Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…

The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…

The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work,…

The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum $s$-$t$ cut (or just its value) for all pairs of vertices $s,t$. We study this problem in directed graphs with unit edge/vertex capacities (corresponding to…

We discuss quantum capacities for two types of entanglement networks: $\mathcal{Q}$ for the quantum repeater network with free classical communication, and $\mathcal{R}$ for the tensor network as the rank of the linear operation represented…

We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one…

The purpose of this paper is to exhibit a quantum network phenomenon - the anti-core---that goes against the classical network concept of congestion core. Classical networks idealized as infinite, Gromov hyperbolic spaces with least-cost…

Motivated by applications to holography and Teichm\"uller theory, we prove a continuous analogue of the max flow/min cut theorem which also takes the topology of the domain into account.