Orthosymplectic diagonalization in Williamson's theorem

• URL: http://arxiv.org/abs/2403.11609v2
• Date: Wed, 20 Mar 2024 19:45:13 GMT
• Title: Orthosymplectic diagonalization in Williamson's theorem
• Authors: Hemant K. Mishra,
• Abstract summary: We provide a condition on any $2n times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we provide an algebraic condition on any $2n \times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix in the sense of Williamson's theorem.

Related papers

• 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)
• A note on MDS Property of Circulant Matrices [3.069335774032178]
  In $2014$, Gupta and Ray proved that the circulant involutory matrices over the finite field $mathbbF_2m$ can not be maximum distance separable (MDS) This article delves into circulant matrices possessing these characteristics over the finite field $mathbbF_2m$.
  arXiv  Detail & Related papers  (2024-06-22T16:00:00Z)
• Multipartite entanglement in the diagonal symmetric subspace [41.94295877935867]
  For diagonal symmetric states, we show that there is no bound entanglement for $d = 3,4 $ and $N = 3$. We present a constructive algorithm to map multipartite diagonal symmetric states of qudits onto bipartite symmetric states of larger local dimension.
  arXiv  Detail & Related papers  (2024-03-08T12:06:16Z)
• Matrix decompositions in Quantum Optics: Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and Williamson [0.0]
  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.
  arXiv  Detail & Related papers  (2024-03-07T15:43:17Z)
• On Simultaneous Symplectic Diagonalization in the sense of Williamson's Theorem [0.0]
  We re-derive some of the cases of Williamson's theorem for symmetric positive-semi definite matrices. We prove theorems that guarantee conditions under which two symmetric positive-definite matrices can be simultaneously diagonalized.
  arXiv  Detail & Related papers  (2023-07-05T11:27:01Z)
• 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)
• Symplectic decomposition from submatrix determinants [0.0]
  An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Inspired by a recently presented technique for finding the eigenvectors of a Hermitian matrix from certain submatrix eigenvalues, we derive a similar method for finding the diagonalising symplectic from certain submatrix determinants.
  arXiv  Detail & Related papers  (2021-08-11T18:00:03Z)
• 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)
• On symmetries of a matrix and its isospectral reduction [0.0]
  diagonalizable matrices in terms of their so-called isospectral reduction represent a versatile approach to the underlying eigenvalue problem. We show in the present work that it is possible to construct a corresponding symmetry of the original matrix.
  arXiv  Detail & Related papers  (2021-05-25T17:52:27Z)
• Deep Two-way Matrix Reordering for Relational Data Analysis [41.60125423028092]
  Matrix reordering is a task to permute rows and columns of a given observed matrix. We propose a new matrix reordering method, Deep Two-way Matrix Reordering (DeepTMR), using a neural network model. We demonstrate the effectiveness of proposed DeepTMR by applying it to both synthetic and practical data sets.
  arXiv  Detail & Related papers  (2021-03-26T01:31:24Z)
• 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.