$h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain

• URL: http://arxiv.org/abs/2301.10747v1
• Date: Wed, 25 Jan 2023 18:10:01 GMT
• Title: $h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain
• Authors: Nibaldo-Edmundo Alvarez-Moraga
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A new set of $ h(1) \oplus su(2)$ vector algebra eigenstates on the matrix domain is obtained by defining them as eigenstates of a generalized annihilation operator formed from a linear combination of the generators of this algebra which eigenvalues are distributed as the elements of a square complex normal matrix. A combined method is used to compute these eigenstates, namely, the method of exponential operators and that of a system of first-order linear differential equations. We compute these states for all possible combination of generators and classify them in different categories according to a generalized commutation relation as well as according to the value of a characteristic parameter related to the $su(2)$ algebra eigenvalues. Proceeding in this way, we found a subset of generalized vector coherent states in the matrix domain which can be easily separated from the general set of Schr\"odinger-Robertson minimum uncertainty intelligent states. In particular, 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 as well as a generalized version of them, and also a direct connection with the coherent state quantization of quaternions.

Related papers

• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• A Result About the Classification of Quantum Covariance Matrices Based on Their Eigenspectra [0.0]
  We find a non-trivial class of eigenspectra with the property that the set of quantum covariance matrices corresponding to any eigenspectrum in this class are related by symplectic transformations. We show that all non-degenerate eigenspectra with this property must belong to this class, and that the set of such eigenspectra coincides with the class of non-degenerate eigenspectra.
  arXiv  Detail & Related papers  (2023-08-07T09:40:09Z)
• A class of 2 X 2 correlated random-matrix models with Brody spacing distribution [0.0]
  A class of 2 X 2 random-matrix models is introduced for which the Brody distribution is the eigenvalue spacing distribution. The random matrices introduced here differ from those of the Gaussian Orthogonal Ensemble (GOE) in three important ways.
  arXiv  Detail & Related papers  (2023-08-03T03:11:54Z)
• 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)
• An Equivalence Principle for the Spectrum of Random Inner-Product Kernel Matrices with Polynomial Scalings [21.727073594338297]
  This study is motivated by applications in machine learning and statistics. We establish the weak limit of the empirical distribution of these random matrices in a scaling regime. Our results can be characterized as the free additive convolution between a Marchenko-Pastur law and a semicircle law.
  arXiv  Detail & Related papers  (2022-05-12T18:50:21Z)
• 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)
• When Random Tensors meet Random Matrices [50.568841545067144]
  This paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. We show that the analysis of the considered model boils down to the analysis of an equivalent spiked symmetric textitblock-wise random matrix.
  arXiv  Detail & Related papers  (2021-12-23T04:05:01Z)
• 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)
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations [0.0]
  We propose several extensions of the parametric-shift-rule to formulating gradients as linear combinations of expectation values for generators with general eigen-spectrum. Our approaches are exact and do not use any auxiliary qubits, instead they rely on a generator eigen-spectrum analysis.
  arXiv  Detail & Related papers  (2021-07-16T21:37:31Z)
• A QUBO Algorithm to Compute Eigenvectors of Symmetric Matrices [0.0]
  We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices, can compute the eigenvector/eigenvalue pair to essentially arbitrary precision, and with minor modifications can also solve the generalized eigenvalue problem.
  arXiv  Detail & Related papers  (2021-04-22T20:41:57Z)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
  We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
  arXiv  Detail & Related papers  (2015-04-26T13:12:16Z)

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.