相关论文: Finding flows in the one-way measurement model
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
We describe a general procedure for mapping arbitrary $n$-qubit states to two-dimensional (2D) vector fields. The mappings use complex rational function representations of individual qubits, producing classical vector field configurations…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
Modern transportation network modeling increasingly involves the integration of diverse methodologies including sensor-based forecasting, reinforcement learning, classical flow optimization, and demand modeling that have traditionally been…
Flow models are a cornerstone of modern machine learning. They are generative models that progressively transform probability distributions according to learned dynamics. Specifically, they learn a continuous-time Markov process that…
This paper is a review on recently found connection between geodesically equivalent metrics and integrable geodesic flows. Suppose two different metrics on one manifold have the same geodesics. We show that then the geodesic flows of these…
This paper discusses new analytic algorithms and software for the enumeration of all integer flows inside a network. Concrete applications abound in graph theory \cite{Jaeger}, representation theory \cite{kirillov}, and statistics…
A Normalizing Flow computes a bijective mapping from an arbitrary distribution to a predefined (e.g. normal) distribution. Such a flow can be used to address different tasks, e.g. anomaly detection, once such a mapping has been learned. In…
It is a well-known result of T.\,Kato that given a continuous path of square matrices of a fixed dimension, the eigenvalues of the path can be chosen continuously. In this paper, we give an infinite-dimensional analogue of this result,…
An invariant measure for a flow is, of course, an invariant measure for any of its time-t maps. But the converse is far from being true. Hence, one may naturally ask: What is the obstruction for an invariant measure for the time-one map to…
In this note, we discuss the mean curvature flow of graphs of maps between Riemannian manifolds. Special emphasis will be placed on estimates of the flow as a non-linear parabolic system of differential equations. Several global existence…
Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…
The notion of the flow introduced by Kitaev is a manifestly topological formulation of the winding number on a real lattice. First, we show in this paper that the flow is quite useful for practical numerical computations for systems without…
Wegner's method of flow equations offers a useful tool for diagonalizing a given Hamiltonian and is widely used in various branches of quantum physics. Here, generalizing this method, a condition is derived, under which the corresponding…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
Optimal-order uniform-in-time $H^1$-norm error estimates are given for semi- and full discretizations of mean curvature flow of surfaces in arbitrarily high codimension. The proposed and studied numerical method is based on a parabolic…
Michor and Mumford showed that the mean curvature flow is a gradient flow on a Riemannian structure with a degenerate geodesic distance. It is also known to destroy the uniform density of gridpoints on the evolving surfaces. We introduce a…
The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions. We extend this idea to the quantum realm and introduce the Quantum Flow…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…