Related papers: An extremal result for geometries in the one-way m…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…
Among the models of quantum computation, the One-way Quantum Computer is one of the most promising proposals of physical realization, and opens new perspectives for parallelization by taking advantage of quantum entanglement. Since a…
We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the…
This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of…
Consider a routing problem consisting of a demand graph H and a supply graph G. If the pair obeys the cut condition, then the flow-cut gap for this instance is the minimum value C such that there is a feasible multiflow for H if each edge…
The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome…
Let $M=X/\Gamma$ be a geometrically finite negatively curved manifold with fundamental group $\Gamma$ acting on $X$ by isometries. The purpose of this paper is to study the mixing property of the geodesic flow on $T^1M$, the asymptotic…
We are presented with a graph, $G$, on $n$ vertices with $m$ edges whose edge set is unknown. Our goal is to learn the edges of $G$ with as few queries to an oracle as possible. When we submit a set $S$ of vertices to the oracle, it tells…
We give an algorithm for computing exact maximum flows on graphs with $m$ edges and integer capacities in the range $[1, U]$ in $\widetilde{O}(m^{\frac{3}{2} - \frac{1}{328}} \log U)$ time. For sparse graphs with polynomially bounded…
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…
We show that every directed graph $G$ with $n$ vertices and $m$ edges admits a directed acyclic graph (DAG) with $m^{1+o(1)}$ edges, called a DAG projection, that can either $(1+1/\text{polylog} (n))$-approximate distances between all pairs…
A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a…
We consider motion by anisotropic curvature of a network of three curves immersed in the plane meeting at a triple junction and with the other ends fixed. We show existence, uniqueness and regularity of a maximal geometric solution and we…
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
Let $r \geq 2$ be a real number. A complex nowhere-zero $r$-flow on a graph $G$ is an orientation of $G$ together with an assignment $\varphi\colon E(G)\to \mathbb{C}$ such that, for all $e \in E(G)$, the modulus of the complex number…
We prove for $C^\infty$ non-singular flows on three-dimensional compact manifolds with positive entropy, there are at most finitely many ergodic measures of maximal entropy. This result extends the notable work of Buzzi-Crovisier-Sarig…
We generalize Tutte's integer flows and the $d$-dimensional Euclidean flows of Mattiolo, Mazzuoccolo, Rajn\'{i}k, and Tabarelli to \emph{$d$-dimensional $p$-normed nowhere-zero flows} and define the corresponding flow index $\phi_{d,p}(G)$…
A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\'asz showed that…