Related papers: Composition of PPT Maps
Following recent work of Beigi and Shor, we investigate PPT states that are "heavily entangled." We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
We address the problem of existence of completely positive trace preserving (CPTP) maps between two sets of density matrices. We refine the result of Alberti and Uhlmann and derive a necessary and sufficient condition for the existence of a…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
We argue that in the case of identical particles the most natural identification of separability, that is of absence of non-classical correlations, is via the factorization of mean values of commuting observables. It thus follows that…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
Maps that preserve adjacency on the set of all invertible hermitian matrices over a finite field are characterized. It is shown that such maps form a group that is generated by the maps $A\mapsto PAP^{\ast}$, $A\mapsto A^{\sigma}$, and…
The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number…
The pentagram map, introduced by R. Schwartz, is defined by the following construction: given a polygon as input, draw all of its "shortest" diagonals, and output the smaller polygon which they cut out. We employ the machinery of cluster…
Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…
Let $R$ be a compact, connected, orientable surface of genus $g$ with $n$ boundary components with $g \geq 2$, $n \geq 0$. Let $\mathcal{N}(R)$ be the nonseparating curve graph, $\mathcal{C}(R)$ be the curve graph and $\mathcal{HT}(R)$ be…
Using pure entangled Schmidt states, we show that m-positivity of a map is bounded by the ranks of its negative Kraus matrices. We also give an algebraic condition for a map to be m-positive. We interpret these results in the context of…
Entanglement is resolved in conformal field theory (CFT) with respect to conformal families to all orders in the UV cutoff. To leading order, symmetry-resolved entanglement is connected to the quantum dimension of a conformal family, while…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
Completely positive and trace preserving (CPT) maps are important for Quantum Information Theory, because they describe a broad class of of transformations of quantum states. There are also two other related classes of maps, the unital…
Renteln proved that the eigenvalues of the distance matrix of a Cayley graph of a real reflection group with respect to the set of all reflections are integral and provided a combinatorial formula for some such spectra. We prove the…