One of the most important characteristics of a quantum graph is the average density of resonances, ρ=(L/π), where L denotes the length of the graph. This is a very robust measure. It does not depend on the number of vertices in a graph and holds also for most of the boundary conditions at the vertices. Graphs obeying this characteristic are called Weyl graphs. Using microwave networks that simulate quantum graphs we show that there exist graphs that do not adhere to this characteristic. Such graphs are called non-Weyl graphs. For standard coupling conditions we demonstrate that the transition from a Weyl graph to a non-Weyl graph occurs if we introduce a balanced vertex. A vertex of a graph is called balanced if the numbers of infinite leads and internal edges meeting at a vertex are the same. Our experimental results confirm the theoretical predictions of [E. B. Davies and A. Pushnitski, Analysis and PDE 4, 729 (2011)] and are in excellent agreement with the numerical calculations yielding the resonances of the networks.
One of the most important characteristics of a quantum graph is the average density of resonances, ρ=(L/π), where L denotes the length of the graph. This is a very robust measure. It does not depend on the number of vertices in a graph and holds also for most of the boundary conditions at the vertices. Graphs obeying this characteristic are called Weyl graphs. Using microwave networks that simulate quantum graphs we show that there exist graphs that do not adhere to this characteristic. Such graphs are called non-Weyl graphs. For standard coupling conditions we demonstrate that the transition from a Weyl graph to a non-Weyl graph occurs if we introduce a balanced vertex. A vertex of a graph is called balanced if the numbers of infinite leads and internal edges meeting at a vertex are the same. Our experimental results confirm the theoretical predictions of [E. B. Davies and A. Pushnitski, Analysis and PDE 4, 729 (2011)] and are in excellent agreement with the numerical calculations yielding the resonances of the networks.
This chapter demonstrates that using a simple experimental setup consisting of microwave networks, one may successfully simulate quantum graphs. Quantum graphs are often used as idealizations of physical networks in the limit where the widths of the wires are much smaller than their lengths, assuming that the propagating waves remain in a single transversal mode. The analogy between quantum graphs and microwave networks is based on the equivalency of the Schrodinger equation describing a quantum system and the telegraph equation describing an ideal microwave circuit. In the case of two dimensions, the Schrödinger equation for quantum billiards is equivalent to the Helmholtz equation for microwave cavities of corresponding shape. The experimentally measured fully connected hexagon networks were described in numerical calculations by fully connected quantum hexagon graphs with one lead attached to the 6-joint vertex. The microwave networks with broken time reversal symmetry were constructed using microwave circulators.
The recently developed concept of germ graphs (P. Kurasov {\it et al.}, Phys. Rev. Research {\bf 7}, L022071 (2025)) is employed to construct families of isocattering, non-isospectral graphs that exhibit dissipation. More specifically, a new pair of isoscattering non-isospectral graphs is constructed by connecting the existing isoscattering non-isospectral graphs, so called attachments, to the different contact vertices of the germ graph. The existing isoscattering non-isospectral graphs contained a two-loop graph labelled ΓA2 and a three-loop graph labelled ΓA3. These graphs have an equal total metric length, but different topologies. The resulting graphs Γ3 and Γ4 are verified as non-isospectral using their Euler characteristics, while their isoscattering properties are investigated by calculating the one-port scattering matrices numerically.
The scattering amplitude in simple quantum graphs is a well-known process which may be highly complex. In this work, motivated by the Shannon entropy, we propose a methodology that associates a graph with a scattering entropy, which we call the average scattering entropy. It is defined by taking into account the period of the scattering amplitude which we calculate using the Green's function procedure. We first describe the methodology on general grounds and then exemplify our findings considering several distinct groups of graphs. We go on and investigate other possibilities, one that contains groups of graphs with the same number of vertices, with the same degree, and the same number of edges, with the same length, but with distinct topologies and with different entropies. Another possibility we investigate contains graphs of the fishbone type, where the scattering entropy depends on the boundary conditions on the vertices of degree 1, with the corresponding values decreasing and saturating very rapidly as we increase the number of elementary structures in the graphs.
The present paper sets out a general method for extending the isoscattering, non-isospectral quantum graphs. The methodology is illustrated by considering two graphs, denoted by Γ1 and Γ2, which have the same total metric length but different topologies. It is demonstrated that, despite the fact that their scattering matrices are identical, their eigenvalues, denoted by kn, and Euler characteristics differ from one another. The next step in the process is to extend both graphs by affixing the same star graph to each of them. Utilising the Titchmarsh-Weyl M-function formalism, it is proven that the newly constructed, extended graphs are also isoscattering and non-isospectral.
Greenberger-Horne-Zeilinger (GHZ) states are multipartite entangled quantum states that play a central role in quantum information theory, with applications in quantum communication, cryptography, and distributed quantum computing. A major experimental goal is to create high-dimensional GHZ states using multiple entangled parties. Krenn, Gu and Zeilinger discovered a surprising bridge between these quantum-optical experiments and graph theory: certain photonic experiments can be represented by edge-coloured, edge-weighted graphs, and the dimension of the produced GHZ state equals the number of feasible monochromatic inherited vertex colourings. This led Krenn and Gu to conjecture that every GHZ graph with more than four vertices has dimension at most 2. A counterexample would give a new high-dimensional multipartite GHZ construction, while a proof would clarify fundamental resource limitations in quantum optics. It is known that the conjecture holds for graphs of vertex connectivity at most 2 [MFCS 2024], and that simple GHZ graphs with n>4 vertices have dimension less than n/2 [Quantum 2024]. However, no general upper bound depending only on vertex connectivity was known. We prove that every simple connected GHZ graph G with at least four vertices has dimension at most 2κ(G)−1+(2κ(G)), where κ(G) is the vertex connectivity of G. We also prove new bounds in terms of edge connectivity and maximum degree.