Related papers: Inverse problems in quantum graphs and accidental …

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property…

We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number…

We investigate the dynamical symmetry superalgebras of the one-dimensional Matrix Superconformal Quantum Mechanics with inverse-square potential. They act as spectrum-generating superalgebras for the systems with the addition of the de…

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…

Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…

An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

A classical particle in a constant magnetic field undergoes cyclotron motion on a circular orbit. At the quantum level, the fact that all classical orbits are closed gives rise to degeneracies in the spectrum. It is well-known that the…

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

We investigate a quantum annealing approach based on real-time quantum dynamics for graph coloring. In this approach, a driving Hamiltonian is chosen so that constraints are naturally satisfied without penalty terms, and the dimension of…

We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…

In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…

We study non-invertible topological symmetry operators in massive quantum field theories in (1+1) dimensions. In phases where this symmetry is spontaneously broken we show that the particle spectrum often has degeneracies dictated by the…