Related papers: Splitting Quantum Graphs
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several well-known eigenvalue bounds. In this work we…
A method for computing lower bounds to eigenvalues of sums of lower semibounded self-adjoint operators is presented. We apply the method to one-electron Hamiltonians. To improve the lower bounds we consider symmetry of molecules and use…
In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary…
Basing on analogy between the three-body scattering problem and the diffraction problem of the plane wave (for the case of the short range pair potentials) by the system of six half transparent screens, we presented a new approach to the…
The Evans function is an analytic function that encodes information about the intersection of certain subspaces in ODE boundary value problems. As such it is a useful tool for computing the spectrum of boundary value problems arising in the…
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…
An infinite sequence of potential well functions is considered. A numerical method is used for the Schr$\ddot{\text{o}}$dinger equation to obtain the energy eigenvalue spectra for a number of these potential well functions. The results for…
We develop a general approach to study three-dimensional Schroedinger operators with confining potentials depending on the distance to a surface. The main idea is to apply parallel coordinates based on the surface but outside its cut locus…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
We consider the problem of how to compute eigenvalues of a self-adjoint operator when a direct application of the Galerkin (finite-section) method is unreliable. The last two decades have seen the development of the so-called quadratic…
We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…
We calculate eigenvalues of one-dimensional quantum-systems by the exact numerical solution of the Lippmann-Schwinger equation, analogous to the scattering problem. To illustrate our method, we treat elementary problems: the harmonic and…
We discuss properties of $L^2$-eigenfunctions of Schr\"odinger operators and elliptic partial differential operators. The focus is set on unique continuation principles and equidistribution properties. We review recent results and announce…
We analyze the singular spectrum of selfadjoint operators which arise from pasting a finite number of boundary relations with a standard interface condition. A model example for this situation is a Schroedinger operator on a star-shaped…
In this paper we analyze and solve eigenvalue programs, which consist of the task of minimizing a function subject to constraints on the "eigenvalues" of the decision variable. Here, by making use of the FTvN systems framework introduced by…
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…
We consider Schr\"odinger operators on sparse graphs. The geometric definition of sparseness turn out to be equivalent to a functional inequality for the Laplacian. In consequence, sparseness has in turn strong spectral and functional…
Hypergraph partitioning is a fundamental optimization problem with applications in data management and other domains involving higher-order relations. In this paper, we study balanced hypergraph partitioning from the perspective of quantum…
We employ kernel-based approaches that use samples from a probability distribution to approximate a Kolmogorov operator on a manifold. The self-tuning variable-bandwidth kernel method [Berry & Harlim, Appl. Comput. Harmon. Anal.,…
We present a method to calculate the asymptotic behavior of eigenfunctions of Schr\"odinger operators that also works at the threshold of the essential spectrum. It can be viewed as a higher order correction to the well-known WKB method…