Matrix decompositions in Quantum Optics: Takagi/Autonne,
Bloch-Messiah/Euler, Iwasawa, and Williamson
- URL: http://arxiv.org/abs/2403.04596v2
- Date: Wed, 13 Mar 2024 15:55:37 GMT
- Title: Matrix decompositions in Quantum Optics: Takagi/Autonne,
Bloch-Messiah/Euler, Iwasawa, and Williamson
- Authors: Martin Houde, Will McCutcheon, Nicol\'as Quesada
- Abstract summary: We present four important matrix decompositions commonly used in quantum optics.
The first two of these decompositions are specialized versions of the singular-value decomposition.
The third factors any symplectic matrix in a unique way in terms of matrices that belong to different subgroups of the symplectic group.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this note we summarize four important matrix decompositions commonly used
in quantum optics, namely the Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and
Williamson decompositions. The first two of these decompositions are
specialized versions of the singular-value decomposition when applied to
symmetric or symplectic matrices. The third factors any symplectic matrix in a
unique way in terms of matrices that belong to different subgroups of the
symplectic group. The last one instead gives the symplectic diagonalization of
real, positive definite matrices of even size. While proofs of the existence of
these decompositions exist in the literature, we focus on providing explicit
constructions to implement these decompositions using standard linear algebra
packages and functionalities such as singular-value, polar, Schur and QR
decompositions, and matrix square roots and inverses.
Related papers
- High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces [47.83974626445763]
We construct path matrices for decomposition of Cartesian tensors up to rank $n=9$ with reduced and affordable complexity.
We prove and leverage that the concatenation of path matrices is an orthonormal change-of-basis matrix between the tensor product space and the spherical direct sum spaces.
We extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry.
arXiv Detail & Related papers (2024-12-24T08:25:38Z) - Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.
This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
arXiv Detail & Related papers (2024-07-15T07:11:44Z) - 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) - Generalized unistochastic matrices [0.4604003661048266]
We measure a class of bistochastic matrices generalizing unistochastic matrices.
We show that the generalized unistochastic matrices is the whole Birkhoff polytope.
arXiv Detail & Related papers (2023-10-05T10:21:54Z) - Mutually-orthogonal unitary and orthogonal matrices [6.9607365816307]
We show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
As an application in quantum information theory, we show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
arXiv Detail & Related papers (2023-09-20T08:20:57Z) - 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) - Matrix Decomposition and Applications [8.034728173797953]
In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition.
matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network.
arXiv Detail & Related papers (2022-01-01T08:13:48Z) - Conjectured $DXZ$ decompositions of a unitary matrix [0.0]
We conjecture that these two decompositions are merely special cases of a set of decompositions.
For lack of a proof, we provide an iterative Sinkhorn algorithm to find an approximate numerical decomposition.
arXiv Detail & Related papers (2021-12-01T01:59:15Z) - Identifiability in Exact Two-Layer Sparse Matrix Factorization [0.0]
Sparse matrix factorization is the problem of approximating a matrix Z by a product of L sparse factors X(L) X(L--1).
This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed.
arXiv Detail & Related papers (2021-10-04T07:56:37Z) - Non-PSD Matrix Sketching with Applications to Regression and
Optimization [56.730993511802865]
We present dimensionality reduction methods for non-PSD and square-roots" matrices.
We show how these techniques can be used for multiple downstream tasks.
arXiv Detail & Related papers (2021-06-16T04:07:48Z) - 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.