Group Theoretical Classification of SIC-POVMs

• URL: http://arxiv.org/abs/2401.11026v1
• Date: Fri, 19 Jan 2024 20:55:52 GMT
• Title: Group Theoretical Classification of SIC-POVMs
• Authors: Solomon B. Samuel and Zafer Gedik
• Abstract summary: We show that SIC-POVM Gram matrices exist on critical points of surfaces formed by the two functions on a subspace of symmetric matrices. In dimensions 4 and 5, the absence of a solution with a smaller symmetry strongly suggests that non-group covariant SIC-POVMs cannot be constructed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Symmetric Informationally Complete Positive Operator-Valued Measures (SIC-POVMs) are known to exist in all dimensions $\leq 151$ and few higher dimensions as high as $1155$. All known solutions with the exception of the Hoggar solutions are covariant with respect to the Weyl-Heisenberg group and in the case of dimension 3 it has been proven that all SIC-POVMs are Weyl-Heisenberg group covariant. In this work, we introduce two functions with which SIC-POVM Gram matrices can be generated without the group covariance constraint. We show analytically that the SIC-POVM Gram matrices exist on critical points of surfaces formed by the two functions on a subspace of symmetric matrices and we show numerically that in dimensions 4 to 7, all SIC-POVM Gram matrices lie in disjoint solution "islands". We generate $O(10^6)$ and $O(10^5)$ Gram matrices in dimensions 4 and 5, respectively and $O(10^2)$ Gram matrices in dimensions 6 and 7. For every Gram matrix obtained, we generate the symmetry groups and show that all symmetry groups contain a subgroup of $3n^2$ elements. The elements of the subgroup correspond to the Weyl-Heisenberg group matrices and the order-3 unitaries that generate them. All constructed Gram matrices have a unique generating set. Using this fact, we generate permutation matrices to map the Gram matrices to known Weyl-Heisenberg group covariant solutions. In dimensions 4 and 5, the absence of a solution with a smaller symmetry, strongly suggests that non-group covariant SIC-POVMs cannot be constructed.

Related papers

• SIC-POVMs and the Knaster's Conjecture [0.0]
  We use the Bloch sphere representation of SIC-POVMs to prove the Knaster's conjecture for the geometry of SIC-POVMs. We also prove the existence of a continuous family of generalized SIC-POVMs where $(n2-1)$ of the matrices have the same value of $Tr(rhok)$.
  arXiv  Detail & Related papers  (2024-05-27T00:31:03Z)
• Two-Unitary Complex Hadamard Matrices of Order $36$ [0.0]
  A family of two-unitary complex Hadamard matrices (CHM) stemming from a particular matrix, of size $36$ is constructed. Every matrix in this orbit remains unitary after operations of partial transpose and reshuffling. It provides a novel solution to the quantum version of the Euler problem, in which each field of the Graeco-Latin square of size six contains a symmetric superposition of all $36$ officers.
  arXiv  Detail & Related papers  (2024-01-03T11:10:00Z)
• Approximate orthogonality of permutation operators, with application to quantum information [0.9790236766474201]
  Consider the $n!$ different unitary matrices that permute $n$ $d$-dimensional quantum systems. If $dgeq n$ then they are linearly independent. This simple point has several applications in quantum information and random matrix theory.
  arXiv  Detail & Related papers  (2023-09-01T19:45:30Z)
• Accelerated Discovery of Machine-Learned Symmetries: Deriving the Exceptional Lie Groups G2, F4 and E6 [55.41644538483948]
  This letter introduces two improved algorithms that significantly speed up the discovery of symmetry transformations. Given the significant complexity of the exceptional Lie groups, our results demonstrate that this machine-learning method for discovering symmetries is completely general and can be applied to a wide variety of labeled datasets.
  arXiv  Detail & Related papers  (2023-07-10T20:25:44Z)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• 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)
• Matrix quantum groups as matrix product operator representations of Lie groups [0.0]
  We show that the matrix quantum group $SL_q(2)$ gives rise to nontrivial matrix product operator representations of the Lie group $SL(2)$. We argue that the combination of this data with the well known $q$-deformed Clebsch-Gordan coefficients and 6j-symbols is consistent with a description of this quantum group in terms of bimodule categories.
  arXiv  Detail & Related papers  (2022-02-14T18:53:38Z)
• $H_2$-reducible matrices in six-dimensional mutually unbiased bases [9.320472997908771]
  Finding four six-dimensional mutually unbiased bases (MUBs) containing the identity matrix is a long-standing open problem in quantum information. We show that if they exist, then the $H$-reducible matrix in the four MUBs has exactly nine $2times2$ Hadamard submatrices. Our results represent the latest progress on the existence of six-dimensional MUBs.
  arXiv  Detail & Related papers  (2021-10-23T12:24:35Z)
• 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)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
  Bilinear pooling achieves great success in fine-grained visual recognition (FGVC) Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features. We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
  arXiv  Detail & Related papers  (2020-03-30T08:40:35Z)

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.