Related papers: Obstructions to universality in globally controlle…
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, { which acts on the spin network states modifying both…
We explore the notion of approximate global symmetries in quantum field theory and quantum gravity. We show that a variety of conjectures about quantum gravity, including the weak gravity conjecture, the distance conjecture, and the…
Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…
A theorem from control theory relating the Lie algebra generated by vector fields on a manifold to the controllability of the dynamical system is shown to apply to Holonomic Quantum Computation. Conditions for deriving the holonomy algebra…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
In general quantum field theories (QFTs), ordinary (0-form) global symmetries and 1-form symmetries can combine into 2-group global symmetries. We describe this phenomenon in detail using the language of symmetry defects. We exhibit a…
A quantum system subject to external fields is said to be controllable if these fields can be adjusted to guide the state vector to a desired destination in the state space of the system. Fundamental results on controllability are reviewed…
We prove the existence of a universal gap for minimum time controllability of finite dimensional quantum systems, except for some basic representations of spin groups. This is equivalent to the existence of a gap in the diameter of orbit…
The question whether global symmetries can be realized in quantum-gravity-matter-systems has far-reaching phenomenological consequences. Here, we collect evidence that within an asymptotically safe context, discrete global symmetries of the…
If holography is an equivalence between quantum theories, one might expect it to be described by a map that is a bijective isometry between bulk and boundary Hilbert spaces, preserving the hamiltonian and symmetries. Holography has been…
The notion of families of quantum invertible maps ($C^*$-algebra homomorphisms satisfying Podle\'s condition) is employed to strengthen and reinterpret several results concerning universal quantum groups acting on finite quantum spaces. In…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
The scaling properties of quantum gravity are discussed by employing a class of proper-time regulators in the functional flow equation for the conformal factor within the formalism of the background field method. Renormalization group…
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction…
We show how a universal gate set for topological quantum computation in the Ising TQFT, the non-Abelian sector of the putative effective field theory of the $\nu=5/2$ fractional quantum Hall state, can be implemented. This implementation…
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to…