相关论文: Quantum graphs whose spectra mimic the zeros of th…

We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…

In the correspondence between spectral problems and topological strings, it is natural to consider complex values for the string theory moduli. In the spectral theory side, this corresponds to non-Hermitian quantum curves with complex…

We study a subtle inequity in the distribution of unnormalized differences between imaginary parts of zeros of the Riemann zeta function. We establish a precise measure which explains the phenomenon, that the location of each Riemann zero…

In this paper we propose a quantum gauge system from which we construct generalized Wilson loops which will be as quantum knots. From quantum knots we give a classification table of knots where knots are one-to-one assigned with an integer…

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…

We present drawings on the complex plane of the lines Im(zeta(s))=0 and Re(zeta(s))=0. This allow to illustrate many properties of the zeta function of Riemann. This is an expository paper. It does not pretend to prove any new result about…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

We initiate the study of spectral zeta functions $\zeta_{X}$ for finite and infinite graphs $X$, instead of the Ihara zeta function, with a perspective towards zeta functions from number theory and connections to hypergeometric functions.…

In these lectures we first review the important properties of the Riemann $\zeta$-function that are necessary to understand the nature and importance of the Riemann hypothesis (RH). In particular this first part describes the analytic…

We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…

Harmonic maps from Riemann surfaces arise from a conformally invariant variational problem. Therefore, on one hand, they are intimately connected with moduli spaces of Riemann surfaces, and on the other hand, because the conformal group is…

During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to…

We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…

We revisit the construction of quantum Riemannian geometries on graphs starting from a hermitian metric compatible connection, which always exists. We use this method to find quantum Levi-Civita connections on the $n$-leg star graph for…

We prove an equivalent of the Riemann hypothesis in terms of the functional equation (in its asymmetrical form) and the $a$-points of the zeta-function, i.e., the roots of the equation $\zeta(s)=a$, where $a$ is an arbitrary fixed complex…

A Hamiltonian operator $\hat H$ is constructed with the property that if the eigenfunctions obey a suitable boundary condition, then the associated eigenvalues correspond to the nontrivial zeros of the Riemann zeta function. The classical…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…

Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.