Related papers: Quantum symmetry in multigraphs (part I)
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
Quantum groups and quantum homogeneous spaces - developed by several authors since the 80's - provide a large class of examples of algebras which for many reasons we interpret as `coordinate algebras' over noncommutative spaces. This…
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
This is the first paper in a series devoted to understanding the classical and quantum nature of edge modes and symmetries in gravitational systems. The goal of this analysis is to: i) achieve a clear understanding of how different…
Joint measurability of sharp quantum observables is determined pairwise, and so can be captured in a graph. We prove the converse: any graph, whose vertices represent sharp observables, and whose edges represent joint measurability, is…
Symmetric states are defined in the kinematical sector of loop quantum gravity and applied to spherical symmetry and homogeneity. Consequences for the physics of black holes and cosmology are discussed.
In this paper we review recent work that has been done on quantum many-particle systems on metric graphs. Topics include the implementation of singular interactions, Bose-Einstein condensation, sovable models and spectral properties of some…
The paper discusses quantum graphs with a vertex coupling which interpolates between the common one of the $\delta$ type and a coupling introduced recently by two of the authors which exhibits a preferred orientation. Describing the…
Inhomogeneous quantum groups are shown to be an effective algebraic tool in the study of integrable systems and to provide solutions equivalent to the Bethe ansatz. The method is illustrated on the 1D Heisenberg ferromagnet whose symmetry…
Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently…
We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We…
Symmetry plays a central role in many areas of modern physics. Here we show that it also underpins the dual particle and wave nature of quantum systems. We begin by noting that a classical point particle breaks translational symmetry…
A new link between tetrahedra and the group SU(2) is pointed out: by associating to each face of a tetrahedron an irreducible unitary SU(2) representation and by imposing that the faces close, the concept of quantum tetrahedron is seen to…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
In this article, we study quantum automorphism groups of distance-transitive graphs. We show that the odd graphs, the Hamming graphs $H(n,3)$, the Johnson graphs $J(n,2)$ and the Kneser graphs $K(n,2)$ do not have quantum symmetry. We also…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…