Related papers: Optimizing the Fundamental Eigenvalue Gap of Quant…
We consider an inverse spectral problem on a quantum graph associated with the square lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the Dirichlet-to-Neumann map for a boundary value…
We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…
A characterization of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on infinite graphs is derived involving the concept of $\mathcal{R}$-limits. This concept, which was introduced previously for operators on…
We study spectra of alloy-type random Schr\"odinger operators on metric graphs. For finite edge subsets of general graphs we prove a Wegner estimate which is linear in the volume (i.e. the number of edges) and the length of the considered…
A significant challenge in quantum annealing is to map a real-world problem onto a hardware graph of limited connectivity. If the maximum degree of the problem graph exceeds the maximum degree of the hardware graph, one employs minor…
The Multimarginal Schr\"odinger Bridge (MSB) finds the optimal coupling among a collection of random vectors with known statistics and a known correlation structure. In the MSB formulation, this correlation structure is specified \emph{a…
The Quantum Approximate Optimization Algorithm can be applied to search problems on graphs with a cost function that is a sum of terms corresponding to the edges. When conjugating an edge term, the QAOA unitary at depth p produces an…
We consider Schr\"odinger operators on a class of periodic quantum graphs with randomly distributed Kirchhoff coupling constants at all vertices. Using the technique of self-adjoint extensions we obtain conditions for localization on…
We prove and apply two theorems: First, a quantitative, scale-free unique continuation estimate for functions in a spectral subspace of a Schr\"odinger operator on a bounded or unbounded domain, second, a perturbation and lifting estimate…
Recently, Apers and Piddock [TQC '23] strengthened the connection between quantum walks and electrical networks via Kirchhoff's Law and Ohm's Law. In this work, we develop a new multidimensional electrical network by defining Alternative…
We consider normalized Laplacians and their perturbations by periodic potentials (Schr\"odinger operators) on periodic discrete graphs. The spectrum of the operators consists of an absolutely continuous part (a union of a finite number of…
We give a lower estimate of the gap of the first two eigenvalues of the Schrodinger operator with a nonconvex potential in terms of a distance associated with the potential. The results here can be applied to the double well potential.
We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…
In the $0$-Extension problem, we are given an edge-weighted graph $G=(V,E,c)$, a set $T\subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$, and the goal is to find an assignment $f$ of each non-terminal vertex to a…
For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$,…
The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
Given a finite sequence of vectors $\mathcal F_0$ in $\C^d$ we characterize in a complete and explicit way the optimal completions of $\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is…
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
Random quantum circuits are a central concept in quantum information theory with applications ranging from demonstrations of quantum computational advantage to descriptions of scrambling in strongly-interacting systems and black holes. The…