Related papers: Quantum Mycielski Graphs
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
We study the change of multiparticle entanglement if one particle becomes classical, in the sense that this particle is destructed by a measurement, but the gained information is encoded into a new register. We present an estimation of this…
It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect. Claw-free perfect graphs can be decomposed via…
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…
Motivated by a recent application of quantum graphs to model the anomalous Hall effect we discuss quantum graphs the vertices of which exhibit a preferred orientation. We describe an example of such a vertex coupling and analyze the…
We argue that the quantized non-Abelian gauge theory can be obtained as the infrared limit of the corresponding classical gauge theory in a higher dimension. We show how the transformation from classical to quantum field theory emerges, and…
The correspondence principle bridges the quantum and classical worlds by establishing a direct link between their dynamics. This well-accepted tenant of quantum physics has been explored in quantum systems wherein the number of particles is…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.
The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but…
We develop a heuristic graph coloring approximation algorithm that uses the D-Wave 2X as an independent set sampler and evaluate its performance against a fully classical implementation. A randomly generated set of small but hard graph…
We study cliques in graphs arising from quadratic forms where the vertices are the elements of the module of the quadratic form and two vertices are adjacent if their difference represents some fixed scalar. We determine structural…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
We develop further the new versions of quantum chromatic numbers of graphs introduced by the first and fourth authors. We prove that the problem of computation of the commuting quantum chromatic number of a graph is solvable by an SDP…