Matrix representation of the resolvent operator in square-integrable basis and physical application

• URL: http://arxiv.org/abs/2411.17736v1
• Date: Sat, 23 Nov 2024 14:25:57 GMT
• Title: Matrix representation of the resolvent operator in square-integrable basis and physical application
• Authors: A. D. Alhaidari,
• Abstract summary: We obtain simple formulas for the matrix elements of the resolvent operator (the Green's function) in any finite set of square integrable basis.<n>A byproduct of our findings is an expression for the normalized eigenvectors of a matrix in terms of its eigenvalues.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We obtain simple formulas for the matrix elements of the resolvent operator (the Green's function) in any finite set of square integrable basis. These formulas are suitable for numerical computations whether the basis elements are orthogonal or not. A byproduct of our findings is an expression for the normalized eigenvectors of a matrix in terms of its eigenvalues. We give a physical application as an illustration of how useful these results can be.

Related papers

• Spectral Estimation with Free Decompression [47.81955761814048]
  We introduce a novel method of "free decompression" to estimate the spectrum of very large (impalpable) matrices.<n>Our method can be used to extrapolate from the empirical spectral densities of small submatrices to infer the eigenspectrum of extremely large (impalpable) matrices.
  arXiv  Detail & Related papers  (2025-06-13T17:49:25Z)
• Matrix Ordering through Spectral and Nilpotent Structures in Totally Ordered Complex Number Fields [2.2533084621250143]
  We develop a total ordering relation for complex numbers, enabling comparisons of the spectral components of general matrices with complex eigenvalues. We establish a theoretical framework for majorization ordering with complex-valued functions. We characterize Jordan blocks of matrix functions using a generalized dominance order for nilpotent components.
  arXiv  Detail & Related papers  (2025-01-17T23:34:17Z)
• Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues [0.0]
  We propose a novel approach for estimating the eigenvalues of non-normal matrices based on the matrix resolvent formalism. We construct the first efficient algorithm for estimating the phases of the unit-norm eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix.
  arXiv  Detail & Related papers  (2024-10-07T08:51:05Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• $h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain [0.0]
  We find a subset of generalized vector coherent states in the matrix domain. For a special choice of the matrix eigenvalue parameters we found the so-called vector coherent states with matrices associated to the Heisenberg-Weyl group.
  arXiv  Detail & Related papers  (2023-01-25T18:10:01Z)
• NISQ algorithm for the matrix elements of a generic observable [0.0]
  We present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian.
  arXiv  Detail & Related papers  (2022-05-20T10:07:55Z)
• The eigenvalues and eigenfunctions of the toroidal dipole operator in a mesoscopic system [0.0]
  We find the quantization rules for the eigenvalues, which are essential for describing measurements of $hatT_3$. While these kernels appear to be problematic at first glance due to singularities, they can actually be used in practical computations.
  arXiv  Detail & Related papers  (2022-03-19T17:49:20Z)
• Level compressibility of certain random unitary matrices [0.0]
  The value of spectral form factor at the origin, called level compressibility, is an important characteristic of random spectra. The paper is devoted to analytical calculations of this quantity for different random unitary matrices describing models with intermediate spectral statistics.
  arXiv  Detail & Related papers  (2022-02-22T21:31:24Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• Optimal radial basis for density-based atomic representations [58.720142291102135]
  We discuss how to build an adaptive, optimal numerical basis that is chosen to represent most efficiently the structural diversity of the dataset at hand. For each training dataset, this optimal basis is unique, and can be computed at no additional cost with respect to the primitive basis. We demonstrate that this construction yields representations that are accurate and computationally efficient.
  arXiv  Detail & Related papers  (2021-05-18T17:57:08Z)
• Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems [107.3868459697569]
  We introduce an eigendecomposition-free approach to training a deep network. We show that our approach is much more robust than explicit differentiation of the eigendecomposition. Our method has better convergence properties and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2020-04-15T04:29:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.