Related papers: Structure Calculations Without Effective Interacti…
We derive out a complete series expression of Hamiltonian eigenvalues without any approximation and cut in the general quantum systems based on Wang's formal framework \cite{wang1}. In particular, we then propose a calculating approach of…
An algebraic Riccati equation for linear operators is studied, which arises in systems theory. For the case that all involved operators are unbounded, the existence of infinitely many selfadjoint solutions is shown. To this end, invariant…
Many shape analysis methods treat the geometry of an object as a metric space that can be captured by the Laplace-Beltrami operator. In this paper, we propose to adapt the classical Hamiltonian operator from quantum mechanics to the field…
A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a…
We demonstrate that quantum Hamiltonian operator for a free transverse field within the framework of the second quantization reveals an alternative set of states satisfying the eigenstate functional equations. The construction is based upon…
We explore the relationship between approximate symmetries of a gapped Hamiltonian and the structure of its ground space. We start by showing that approximate symmetry operators---unitary operators whose commutators with the Hamiltonian…
We present an efficient program for the exact diagonalization solution of the pairing Hamiltonian in spherical systems with rotational invariance based on the SU(2) quasi-spin algebra. The basis vectors with quasi-spin symmetry considered…
We discuss a remarkable property of an iterative algorithm for eigenvalue problems recently advanced by Waxman that constitutes a clear advantage over other iterative procedures. In quantum mechanics, as well as in other fields, it is often…
We propose and study an algorithm for computing a nearest passive system to a given non-passive linear time-invariant system (with much freedom in the choice of the metric defining `nearest', which may be restricted to structured…
In analogy with classical results in Riemannian geometry, we establish estimates for the first eigenvalue of the Laplace-de Rham operator on complete balanced Hermitian manifolds in terms of either the holomorphic Ricci curvature or the…
Ladder operators are useful, if not essential, in the analysis of some given physical system since they can be used to find easily eigenvalues and eigenvectors of its Hamiltonian. In this paper we extend our previous results on abstract…
This work introduces a method for determining the energy spectrum of lattice quantum chromodynamics (LQCD) by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to…
We consider computing the $k$-th eigenvalue and its corresponding eigenvector of a generalized Hermitian eigenvalue problem of $n\times n$ large sparse matrices. In electronic structure calculations, several properties of materials, such as…
An application of an effective numerical algorithm for solving eigenvalue problems which arise in modelling electronic properties of quantum disordered systems is considered. We study the electron states at the localization-delocalization…
We report an attempt to calculate energy eigenvalues of large quantum systems by the diagonalization of an effectively truncated Hamiltonian matrix. For this purpose we employ a specific way to systematically make a set of orthogonal states…
For many-particle systems defined on lattices we investigate the global structure of effective Hamiltonians and observables obtained by means of a suitable basis transformation. We study transformations which lead to effective Hamiltonians…
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an…
Partitioning a graph into three pieces, with two of them large and connected, and the third a small ``separator'' set, is useful for improving the performance of a number of combinatorial algorithms. This is done using the second…
We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe--Salpeter equation without Tamm--Dancoff approximation. The new algorithm is based on a structure…
A common approach to approximating quadratic forms of matrix functions is to use a quadrature rule derived from the Lanczos process, known as a Lanczos quadrature. Although symmetric quadrature rules are computationally favorable, it has…