Related papers: Finding flows in the one-way measurement model
We provide a new universal real flow of the Hilbert-cubical type. We prove that any real flow can be equivariantly embedded in the translation on $L(\mathbb{R})^\mathbb{N}$, where $L(\mathbb{R})$ denotes the space of $1$-Lipschitz functions…
We show that solutions to certain higher-order intrinsic geometric flows on a compact manifold, including some flows generated by the ambient obstruction tensor, are unique. With the goal of providing a complete self-contained proof,…
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
Finding the mean of sampled data is a fundamental task in machine learning and statistics. However, in cases where the data samples are graph objects, defining a mean is an inherently difficult task. We propose a novel framework for…
Networks of interconnected resistors, springs and beams, or pores are standard models of studying scalar and vector transport processes in heterogeneous materials and media, such as fluid flow in porous media, and conduction, deformations,…
Deciding if a graph is a Hamilton graph, also named the Hamilton cycle problem, is important for discrete mathematics and computer science. Due to no characterization to identify Hamilton graphs effectively, there are no tractable…
In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…
The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
We consider the 1-harmonic flow of maps from a bounded domain into a submanifold of a Euclidean space, i.e. the gradient flow of the total variation functional restricted to maps taking values in the manifold. We restrict ourselves to…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
We study a flow of $G_2$ structures which induce the same Riemannian metric which is the negative gradient flow of an energy functional. We prove Shi-type estimates for the torsion tensor along the flow. We show that at a finite-time…
Some microfluidic lab-on-chip devices contain modules whose function is to mix two fluids, called reactant and buffer, in desired proportions. In one of the technologies for fluid mixing the process can be represented by a directed acyclic…
An important problem in terrain analysis is modeling how water flows across a terrain creating floods by forming channels and filling depressions. In this paper we study a number of \emph{flow-query} related problems: Given a terrain…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time,…
Topological order of a topological phase of matter in two spacial dimensions is encoded by a unitary modular (tensor) category (UMC). A group symmetry of the topological phase induces a group symmetry of its corresponding UMC. Gauging is a…
Fluid simulations, especially at high Reynolds numbers, are computationally expensive on classical computers, making them promising application targets for quantum computing. Recent studies have combined the lattice Boltzmann method (LBM)…
We study dynamic measure transport for generative modeling, focusing on transport maps that connect a source measure $P_0$ to a target measure $P_1$ by integrating a velocity field of the form $v_t(x) = \mathbb{E}[\dot X_t \mid X_t = x]$,…