相关论文: Quantum graphs as holonomic constraints
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this…
The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…
Quantum $L_\infty$ algebras are a generalization of $L_\infty$ algebras with a scalar product and with operations corresponding to higher genus graphs. We construct a minimal model of a given quantum $L_\infty$ algebra via the homological…
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…
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
In the last 20 years, loop quantum gravity, a background independent approach to unify general relativity and quantum mechanics, has been widely investigated. The aim of loop quantum gravity is to construct a mathematically rigorous,…
We present quantum holonomy theory, which is a non-perturbative theory of quantum gravity coupled to fermionic degrees of freedom. The theory is based on a C*-algebra that involves holonomy-diffeomorphisms on a 3-dimensional manifold and…
Any canonical quantum theory can be understood to arise from the compatibility of the statistical geometry of distinguishable observations with the canonical Poisson structure of Hamiltonian dynamics. This geometric perspective offers a…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
Manifestly non-Hermitian quantum graphs with real spectra are introduced and shown tractable as a new class of phenomenological models with several appealing descriptive properties. For illustrative purposes, just equilateral star-graphs…
We prove an approximation result showing how operators of the type $-\Delta -\gamma \delta (x-\Gamma)$ in $L^2(\mathbb{R}^2)$, where $\Gamma$ is a graph, can be modeled in the strong resolvent sense by point-interaction Hamiltonians with an…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
We introduce various notions of quantum symmetry in a directed or undirected multigraph with no isolated vertex and explore relations among them. If the multigraph is single edged (that is, a simple graph where loops are allowed), all our…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
We show that the classical mechanics of an algebraic model are implied by its quantizations. An algebraic model is defined, and the corresponding classical and quantum realizations are given in terms of a spectrum generating algebra.…