Related papers: Composition of PPT Maps
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
It is challenging task to detect and measure genuine multipartite entanglement. We investigate the problem by considering the average based positive partial transposition(PPT) criterion and the realignment criterion. Sufficient conditions…
In this paper we describe a new connection between UPB (unextendable product bases) and P (positive) maps which are not CP (completely positive). We show that inner automorphisms of the set of P maps which are not CP, produce extremal…
Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph $G$. Let $\omega(G)$ be the size of a maximum clique in $G$, and $\tw(G)$ be the treewidth of $G$. We prove that $ \lpt(G) \leq…
The study of the entanglement entropy and entanglement spectrum has proven to be very fruitful in identifying topological phases of matter. Typically, one performs numerical studies of finite-size systems. However, there are few rigorous…
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length…
Structure in quantum entanglement entropy is often leveraged to focus on a small corner of the exponentially large Hilbert space and efficiently parameterize the problem of finding ground states. A typical example is the use of matrix…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…
A merge tree is a fundamental topological structure used to capture the sub-level set (and similarly, super-level set) topology in scalar data analysis. The interleaving distance is a theoretically sound, stable metric for comparing merge…
Quantum entanglement is an important phenomenon in quantum information theory. To detect entanglement theoretically, positive but not completely positive maps are used. The Kadison-Schwarz (KS) inequality interpolates between positivity and…
A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.
The density matrix of composite spin system is discussed in relation to the adjoint representation of unitary group U(n). The entanglement structure is introduced as an additional ingredient to the description of the linear space carrying…
Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in…
We investigate the quantum nature of gravity in terms of the coherence of quantum objects. As a basic setting, we consider two gravitating objects each in a superposition state of two paths. The evolution of objects is described by the…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
Map matching is a common task when analysing GPS tracks, such as vehicle trajectories. The goal is to match a recorded noisy polygonal curve to a path on the map, usually represented as a geometric graph. The Fr\'echet distance is a…
We prove a multiplicative ergodic theorem for bistochastic completely positive (bcp) linear cocycles acting on finite-dimensional matrix algebras, giving an invariant splitting described explicitly in terms of the multiplicative domains of…
A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…
We investigate the structure of $k$-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetries. Specifically, we consider (1) linear maps on $M_d(\mathbb{C})$ which are…