Related papers: Weight of quadratic forms and graph states
We derive an explicit expression for geometric measure of entanglement for spin and other quantum system. A relation of entanglement in pure state with the mean value of spin is given, thus, at the experimental level the local measurement…
Following the quantisation of a graph with the Dirac operator (spin-1/2) we explain how additional weights in the spectral form factor K(\tau) due to spin propagation around orbits produce higher order terms in the small-\tau asymptotics in…
Measures of rank correlation are commonly used in statistics to capture the degree of concordance between two orderings of the same set of items. Standard measures like Kendall's tau and Spearman's rho coefficient put equal emphasis on each…
We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give a affirmative answer to the analogue in this setting of a famous conjecture of…
Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…
We functorially identify similarity classes of line-bundle-valued quadratic forms on rank two vector bundles with isomorphism classes of pairs consisting of the degree zero and the degree one parts of the associated generalized Clifford…
Weighted graph states extend standard graph states by associating phases with entangling edges, and may serve as resources for measurement-based quantum computation (MBQC). We analyze how the two main fusion operations, Type-I and Type-II,…
Estimation of graph parameters based on a collection of graphs is essential for a wide range of graph inference tasks. In practice, weighted graphs are generally observed with edge contamination. We consider a weighted latent position graph…
Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are only available in few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
We study geometrical aspects of entanglement, with the Hilbert--Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a ``relativistic'' formulation leads…
For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…
We consider the second weighted Bartholdi zeta function of a graph $G$, and present weighted versions for the result of Li and Hou's on the partial derivatives of the determinant part in the determinant expression of the Bartholdi zeta…
We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction…
Quantum states can be written in infinitely many ways depending on the choices of basis. Schmidt decomposition of a quantum state has a lot of properties useful in the study of entanglement. All bipartite states admit Schmidt decomposition,…
In this paper, we study the fractal dimension of the graph of a fractal transformation and also determine the quantization dimension of a probability measure supported on the graph of the fractal transformation. Moreover, we estimate the…
Within the framework of Einstein-Cartan gravity we consider an action, containing up to quadratic terms of the Ricci scalar and the Holst invariant, coupled non-minimally to a scalar field, including couplings of its derivatives to…
Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…
We prove a lower bound for Schmidt numbers of bipartite mixed states. This lower bound can be applied easily to low rank bipartite mixed states. From this lower bound it is known that generic low rank bipartite mixed states have relatively…
To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…