Related papers: Triangle-free quantum graphs
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
Let $C$ be a smooth plane curve of degree $d$ defined over an algebraically closed field $k$. A base point free complete very special linear system $g^r_n$ on $C$ is trivial if there exists an integer $m\ge 0$ and an effective divisor $E$…
Beyond future applications, quantum networks open interesting fundamental perspectives, notably novel forms of quantum correlations. In this work we discuss quantum correlations in networks from the perspective of the underlying quantum…
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. As an application of these results we can deduce a complete…
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free…
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…
On a metric graph we introduce the notion of a free divisor as a replacement for the notion of a base point free complete linear system on a curve. By means of an example we show that the Clifford inequality is the only obstruction for the…
The basic framework for a systematic construction of a quantum theory of Riemannian geometry was introduced recently. The quantum versions of Riemannian structures --such as triad and area operators-- exhibit a non-commutativity. At first…
We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic $(n_3)$ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability.…
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4,…
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…
We investigate the relationship between mapping cones and matrix ordered *-vector spaces (i.e., abstract operator systems). We show that to every mapping cone there is an associated operator system on the space of n-by-n complex matrices,…
The representation of the resolvent as an integral operator, the $m$ function, and the associated spectral representation are fundamental topics in the spectral theory of self-adjoint ordinary differential operators. Versions of these are…
The celebrated Mantel's theorem states that any triangle-free graph on $n$ vertices contains at most $\left\lfloor n^2/4\right\rfloor$ edges. It is natural to ask how many triangles must exist in a graph with more than $\left\lfloor…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
Motivated by Chudnovsky's structure theorem of bull-free graphs, Abu-Khzam, Feghali, and M\"uller have recently proved that deciding if a graph has a vertex partition into disjoint cliques and a triangle-free graph is NP-complete for five…
Differential operators of Schrodinger type are considered on metric Cayley graphs of free groups with a minimal set of M generators. The potential and edge lengths may vary with the M edge types. Using novel methods, a set of M multipliers…
In this paper, we provide necessary and sufficient conditions for the existence of a cyclic $m$-cycle system of $K_n-I$ when $m$ and $n$ are even and $m \mid n$.