Related papers: The Quantum Homomorphism Orders are Universal
A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…
The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…
We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…
In this article we further investigate the construction of graph coherent states, first introduced in [1], in the context of loop quantum gravity. We specifically investigate the possibility of defining a family of graph coherent states…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
We generalize the result of Brandenbursky and Marcinkowski for the bounded cohomology of transformation groups to infinite volume case. To state the result, we introduce the notion of norm controlled cohomology as a generalization of…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
A concept -- quantum order -- is introduced to describe a new kind of orders that generally appear in quantum states at zero temperature. Quantum orders that characterize universality classes of quantum states (described by {\em complex}…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.
A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…
We investigate the universality of correlation functions of chaotic and disordered quantum systems as an external parameter is varied. A new, general scaling procedure is introduced which makes the theory invariant under reparametrizations.…
Quantum relations in the sense of Weaver are $M'$-bimodules, for a von Neumann algebra $M$, these generalising actual relations on a set $X$ when $M=\ell^\infty(X)$. Similarly, relations between two sets can be generalised as bimodules over…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
We investigate universal features of measurement-and-feedback control of quantum chaotic dynamics by examining the quantum Arnold cat map, a paradigmatic model of quantum chaos. Inspired by probabilistic control of classical chaos, our…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…