Related papers: Optimizing the Fundamental Eigenvalue Gap of Quant…
We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
This paper deals with spectral inequalities for one-dimensional Schr\"odinger operators with potentials bounded between two increasing functions (weights). The spectral inequality allows one to estimate the norm of a function with bounded…
In the space $L_2(R^d)$ we consider the Schr\"odinger operator $H_\gamma=-\Delta+ V(x)\cdot+\gamma W(x)\cdot$, where $V(x)=V(x_1,x_2,\dots,x_d)$ is a periodic function with respect to all the variables, $\gamma$ is a small real coupling…
We establish new necessary and sufficient conditions for the discreteness of spectrum and strict positivity of magnetic Schr\"odinger operators with a positive scalar potential. They extend earlier results by Maz'ya and Shubin (2005), which…
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…
This note is devoted to Keller-Lieb-Thirring spectral estimates for Schr\"odinger operators on infinite cylinders: the absolute value of the ground state level is bounded by a function of a norm of the potential. Optimal potentials with…
The approximation of the eigenvalues and eigenfunctions of an elliptic operator is a key computational task in many areas of applied mathematics and computational physics. An important case, especially in quantum physics, is the computation…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
We present a polynomial-time $(\alpha_{GW} + \varepsilon)$-approximation algorithm for the Maximum Cut problem on interval graphs and split graphs, where $\alpha_{GW} \approx 0.878$ is the approximation guarantee of the Goemans-Williamson…
The spectra of the Schr\"odinger operators with periodic potentials are studied. When the potential is real and periodic, the spectrum consists of at most countably many line segments (energy bands) on the real line, while when the…
We consider decaying oscillatory perturbations of periodic Schr\"odinger operators on the half line. More precisely, the perturbations we study satisfy a generalized bounded variation condition at infinity and an $L^p$ decay condition. We…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm…
We study the optimization of Steklov eigenvalues with respect to a boundary density function $\rho$ on a bounded Lipschitz domain $\Omega \subset \mathbb{R}^N$. We investigate the minimization and maximization of $\lambda_k(\rho)$, the…
We consider the problem of geometric optimization for the lowest eigenvalue of the two-dimensional Schr\"odinger operator with an attractive $\delta$-interaction supported on an open arc with two free endpoints. Under a constraint of fixed…
We introduce computational strategies for measuring the ``size'' of the spectrum of bounded self-adjoint operators using various metrics such as the Lebesgue measure, fractal dimensions, the number of connected components (or gaps), and…
We consider the spin-$J$ XXZ-Hamiltonian on general graphs $\mathcal{G}$ and show its equivalence to a direct sum of discrete many-particle Schr\"odinger type operators on what we call "$N$-particle graphs with maximal local occupation…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We consider Schr\"odinger operators on periodic discrete graphs. It is known that the spectrum of these operators has band structure. We obtain a localization of spectral bands in terms of eigenvalues of Dirichlet and Neumann operators on a…