相关论文: Quantum Max-flow/Min-cut
We initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold.…
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge…
In the Quantum-Train (QT) framework, mapping quantum state measurements to classical neural network weights is a critical challenge that affects the scalability and efficiency of hybrid quantum-classical models. The traditional QT framework…
Circuit knitting is the process of partitioning large quantum circuits into smaller subcircuits such that the result of the original circuits can be deduced by only running the subcircuits. Such techniques will be crucial for near-term and…
We consider the problem of finding the value of a maximum flow over time in a network with uniform edge lengths where the edge capacities change at specific time instants. To solve this problem, we show how to construct a condensed version…
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…
A method to optimize the cost of a quantum channel is developed. The goal is to determine the cheapest channel that produces prescribed output states for a given set of input states. This is essentially a quantum version of optimal…
Though there has been substantial progress in developing quantum algorithms to study classical datasets, the cost of simply \textit{loading} classical data is an obstacle to quantum advantage. When the amplitude encoding is used, loading an…
Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic…
Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling…
Transport through correlated nanoscale systems underpins the operation of quantum-dot and molecular-scale devices, yet accurate simulations of large open quantum systems remain computationally challenging as system size increases.…
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur…
These lecture notes survey some joint work with Samson Abramsky. Somewhat informally I will discuss the main results in a pedestrian not too technical way. These include: (1) `The logic of entanglement', that is, the identification and…
Many combinatorial optimization problems admit a maximin fairness variant, where the aim is to find a distribution over possible solutions which maximizes an expected worst-case outcome. However, the support for an optimal distribution may…
The recognition that large classes of quantum many-body systems have limited entanglement in the ground and low-lying excited states led to dramatic advances in their numerical simulation via so-called tensor networks. However, global…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The energy landscape has a number of local minima,…
The relationship between the sparsest cut and the maximum concurrent multi-flow in graphs has been studied extensively. For general graphs with $k$ terminal pairs, the flow-cut gap is $O(\log k)$, and this is tight. But when topological…
Several concepts borrowed from graph theory are routinely used to better understand the inner workings of the (human) brain. To this end, a connectivity network of the brain is built first, which then allows one to assess quantities such as…
The Max-Flow/Min-Cut problem is a fundamental tool in graph theory, with applications in many domains, including data mining, image segmentation, transportation planning, and many types of assignment problems, in addition to being an…