Related papers: Positivstellens\"atze for Quantum Multigraphs
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
The paper is concerned with various types of noncommutative Positivstellens\"atze for the matrix algebra $M_n(\cA)$, where $\cA$ is an algebra of operators acting on a unitary space, a path algebra, a cyclic algebra or a formally real…
Motivated by applications in background-independent quantum gravity, we discuss the quantization of labeled and unlabeled finite multigraphs with a maximum edge count. We provide a unified way to represent quantum multigraphs with labeled…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
This paper investigates Positivstellens\"atze for polynomial matrices subject to universally quantified polynomial matrix inequality constraints. We first establish a matrix-valued Positivstellensatz under the Archimedean condition,…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
We describe recent work on positive descriptions of the structure constants of the cohomology of homogeneous spaces such as the Grassmannian, by degenerations and related methods. We give various extensions of these rules, some new and…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…
Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…
In a broad sense, positivstellens\"atze are results about representations of polynomials which are strictly positive on a given set. We give constructive and, to a large extent, elementary proofs of some known positivstellens\"atze for…
Data analysts commonly utilize statistics to summarize large datasets. While it is often sufficient to explore only the summary statistics of a dataset (e.g., min/mean/max), Anscombe's Quartet demonstrates how such statistics can be…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…
Motivated by scheme theory, we introduce strong nonnegativity on real varieties, which has the property that a sum of squares is strongly nonnegative. We show that this algebraic property is equivalent to nonnegativity for nonsingular real…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…