相关论文: Finding flows in the one-way measurement model

Space complexity is a critical factor in various computational models, including streaming, parallel/distributed computing, and communication complexity. We study the space complexity of the minimum-cost flow problem, a generalization of…

The goal of load balancing (grid partitioning) is to minimize overall computations and communications, and to make sure that all processors have a similar workload. Geometric methods divide a grid by using a location of a cell while…

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be…

In this note, we propose a case study of freeway traffic flow modeled as a hybrid system. We describe two general classes of networks that model flow along a freeway with merging onramps. The admission rate of traffic flow from each onramp…

Quantum classifiers are trainable quantum circuits used as machine learning models. The first part of the circuit implements a quantum feature map that encodes classical inputs into quantum states, embedding the data in a high-dimensional…

We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case,…

Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this…

We propose Functional Flow Matching (FFM), a function-space generative model that generalizes the recently-introduced Flow Matching model to operate in infinite-dimensional spaces. Our approach works by first defining a path of probability…

We present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows,…

We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…

To better understand the overlapping modular organization of large networks with respect to flow, here we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between…

Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area-decreasing map…

In this article we study Chen's flow of curves from theoreical and numerical perspectives. We investigate two settings: that of closed immersed $\omega$-circles, and immersed lines satisfying a cocompactness condition. In each of the…

As an alternative but unified and more fundamental description for quantum physics, Feynman path integrals generalize the classical action principle to a probabilistic perspective, under which the physical observables' estimation translates…

A one-way quantum computer works by only performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic…

We show that the clustering coefficient, a standard measure in network theory, when applied to flow networks, i.e. graph representations of fluid flows in which links between nodes represent fluid transport between spatial regions,…

We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time O(n^2 (sqrt{m/n} + log n) log n), and finding a maximal flow…

In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…

We propose a new model of one-dimensional traffic flow using a coupled map lattice. In the model, each vehicle is assigned a map and changes its velocity according to it. A single map is designed so as to represent the motion of a vehicle…