Related papers: Laplacians on quantum hypergraphs
The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary,…
A sample of some relevant developments that have taken place during the last twenty years in classical and quantum tomography are displayed. We will present a general conceptual framework that provides a simple unifying mathematical picture…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
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…
In the present article magnetic Laplacians on a graph are analyzed. We provide a complete description of the set of all operators which can be obtained from a given self-adjoint Laplacian by perturbing it by magnetic fields. In particular,…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
A chain of quantum subgroups of the quantum automorphism group of finite graphs has been introduced. It generalizes the construction of J. Bichon (see [3]) in a sense. A better bound of the non zero eigenvalues of the graph Laplacian has…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
Recently, efforts have been made in the community to design new Graph Neural Networks (GNN), as limitations of Message Passing Neural Networks became more apparent. This led to the appearance of Graph Transformers using global graph…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
For quantum computer circuits, it is proposed that they have, besides the presently used compact graphs, an expanded system of subgraphs, in line with the quantum mechanics superposition axiom. The representation of each process by these…
Adapting a method developed for the study of quantum chaos on {\it quantum (metric)} graphs \cite {KS}, spectral $\zeta$ functions and trace formulae for {\it discrete} Laplacians on graphs are derived. This is achieved by expressing the…
These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…
The properties of a hypergraph explored through the spectrum of its unified matrix was made by the authors in [26]. In this paper, we introduce three different hypergraph matrices: unified Laplacian matrix, unified signless Laplacian…
The article surveys quantization schemes for metric graphs with spin. Typically quantum graphs are defined with the Laplace or Schrodinger operator which describe particles whose intrinsic angular momentum (spin) is zero. However, in many…
We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…