Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids

• URL: http://arxiv.org/abs/2010.02344v1
• Date: Mon, 5 Oct 2020 21:31:30 GMT
• Title: Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids
• Authors: Arya Bangun, Arash Behboodi, and Rudolf Mathar
• Abstract summary: We relate the mutual coherence analysis for sensing matrices to angular momentum analysis in quantum mechanics. For a class of regular sampling patterns, we provide a lower bound for the inner product of columns of the sensing matrix that can be analytically computed.
• Score: 6.499706858965409
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many practical sampling patterns for function approximation on the rotation group utilizes regular samples on the parameter axes. In this paper, we relate the mutual coherence analysis for sensing matrices that correspond to a class of regular patterns to angular momentum analysis in quantum mechanics and provide simple lower bounds for it. The products of Wigner d-functions, which appear in coherence analysis, arise in angular momentum analysis in quantum mechanics. We first represent the product as a linear combination of a single Wigner d-function and angular momentum coefficients, otherwise known as the Wigner 3j symbols. Using combinatorial identities, we show that under certain conditions on the bandwidth and number of samples, the inner product of the columns of the sensing matrix at zero orders, which is equal to the inner product of two Legendre polynomials, dominates the mutual coherence term and fixes a lower bound for it. In other words, for a class of regular sampling patterns, we provide a lower bound for the inner product of the columns of the sensing matrix that can be analytically computed. We verify numerically our theoretical results and show that the lower bound for the mutual coherence is larger than Welch bound. Besides, we provide algorithms that can achieve the lower bound for spherical harmonics.

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)
• Exponentiation of Parametric Hamiltonians via Unitary interpolation [0.8399688944263842]
  We introduce two ideas for the time-efficient approximation of matrix exponentials of linear multi-parametric Hamiltonians. We modify the Suzuki-Trotter product formula from an approximation to an compilation scheme to improve both accuracy and computational time.
  arXiv  Detail & Related papers  (2024-02-02T15:29:55Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Quantitative deterministic equivalent of sample covariance matrices with a general dependence structure [0.0]
  We prove quantitative bounds involving both the dimensions and the spectral parameter, in particular allowing it to get closer to the real positive semi-line. As applications, we obtain a new bound for the convergence in Kolmogorov distance of the empirical spectral distributions of these general models.
  arXiv  Detail & Related papers  (2022-11-23T15:50:31Z)
• Cubic-Regularized Newton for Spectral Constrained Matrix Optimization and its Application to Fairness [9.649070872824957]
  Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems. A new convergence analysis is provided for cubic-regularized Newton for matrix vector spaces.
  arXiv  Detail & Related papers  (2022-09-02T18:11:05Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• 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)
• Identifying Quantum Correlations Using Explicit SO(3) to SU(2) Maps [2.578242050187029]
  An exact formula is given for determining the local unitaries for some given rotation on the Bloch sphere. The solution allows for easy manipulation of two-qubit quantum states with a single definition that is programmable.
  arXiv  Detail & Related papers  (2022-05-06T02:51:49Z)
• Direct solution of multiple excitations in a matrix product state with block Lanczos [62.997667081978825]
  We introduce the multi-targeted density matrix renormalization group method that acts on a bundled matrix product state, holding many excitations. A large number of excitations can be obtained at a small bond dimension with highly reliable local observables throughout the chain.
  arXiv  Detail & Related papers  (2021-09-16T18:36:36Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

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.