Simultaneous Block Diagonalization of Matrices of Finite Order

• URL: http://arxiv.org/abs/2012.14440v1
• Date: Mon, 28 Dec 2020 19:00:06 GMT
• Title: Simultaneous Block Diagonalization of Matrices of Finite Order
• Authors: Ingolf Bischer, Christian D\"oring, Andreas Trautner
• Abstract summary: It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. Here we give an efficient algorithm to explicitly compute a transfer matrix which realizes the simultaneous block diagonalization. Our main motivation lies in particle physics, where the resulting transfer matrix must be known explicitly in order to unequivocally determine the action of outer automorphisms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. In the case of non-commuting matrices, the best that can be achieved is simultaneous block diagonalization. Here we give an efficient algorithm to explicitly compute a transfer matrix which realizes the simultaneous block diagonalization of unitary matrices whose decomposition in irreducible blocks (common invariant subspaces) is known from elsewhere. Our main motivation lies in particle physics, where the resulting transfer matrix must be known explicitly in order to unequivocally determine the action of outer automorphisms such as parity, charge conjugation, or time reversal on the particle spectrum.

Related papers

• Perturbative power series for block diagonalisation of Hermitian matrices [0.0]
  We show that two conditions, least action" vs. block-off-diagonality of the generator, lead to identical transformations. We derive the perturbative power series of the least action", exhibiting explicitly the loss of block-off-diagnoality.
  arXiv  Detail & Related papers  (2024-08-26T21:05:26Z)
• 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 cyclic non-MDS matrices [3.069335774032178]
  In $1998,$ Daemen it et al. introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher. This block cipher is now universally acclaimed as the AES block cipher. In $2016,$ Liu and Sim introduced cyclic matrices by modifying the permutation of circulant matrices.
  arXiv  Detail & Related papers  (2024-06-20T06:05: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)
• 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)
• 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)
• 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)
• Adversarially-Trained Nonnegative Matrix Factorization [77.34726150561087]
  We consider an adversarially-trained version of the nonnegative matrix factorization. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices.
  arXiv  Detail & Related papers  (2021-04-10T13:13:17Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• J-matrix method of scattering in one dimension: The relativistic theory [0.0]
  We make a relativistic extension of the one-dimensional J-matrix method of scattering. The relativistic potential matrix is a combination of vector, scalar, and pseudo-scalar components.
  arXiv  Detail & Related papers  (2020-01-14T19:02:15Z)

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.