Related papers: Optimizing the Fundamental Eigenvalue Gap of Quant…

The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…

This work studies geometrical characterizations of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on graphs. Especially we focus on generalizing characterizations which are given in terms of the concept of right…

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

Convex optimization is the powerhouse behind the theory and practice of optimization. We introduce a quantum analogue of unconstrained convex optimization: computing the minimum eigenvalue of a Schr\"odinger operator $h = -\Delta + V $ with…

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…

We provide a purely variational proof of the existence of eigenvalues below the bottom of the essential spectrum for the Schr\"odinger operator with an attractive $\delta$-potential supported by a star graph, i.e. by a finite union of rays…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schr\"odinger operator with convex potential and Dirichlet boundary data on a convex domain is…

The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work,…

Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…

We study the problem of constructing $k$-spectral minimal partitions of domains in $d$ dimensions, where the energy functional to be minimized is a $p$-norm ($1 \le p \le \infty$) of the infimum of the spectrum of a suitable Schr\"odinger…

We show that the spectrum of a discrete two-dimensional periodic Schr\"odinger operator on a square lattice with a sufficiently small potential is an interval, provided the period is odd in at least one dimension. In general, we show that…

We work in the setting of infinite, not necessarily locally finite, weighted graphs. We give a sufficient condition for the essential self-adjointness of (discrete) Schr\"odinger operators $\mathcal{L}_{V}$ that are not necessarily lower…

We consider a Schr\"odinger particle on a graph consisting of $\,N\,$ links joined at a single point. Each link supports a real locally integrable potential $\,V_j\,$; the self--adjointness is ensured by the $\,\delta\,$ type boundary…

Schr\"odinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely,…

We consider Schr\"odinger operators in $L^2(\mathrm{R}^\nu),\, \nu=2,3$, with the interaction in the form on an array of potential wells, each on them having rotational symmetry, arranged along a curve $\Gamma$. We prove that if $\Gamma$ is…

We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…

Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…