Group Theoretical Classification of SIC-POVMs (2401.11026v1)
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(106)$ and $O(105)$ Gram matrices in dimensions 4 and 5, respectively and $O(102)$ 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 $3n2$ 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.
- The lie algebraic significance of symmetric informationally complete measurements, Journal of Mathematical Physics 52(2): 022202.
- [] Appleby, D. M. (2005). Symmetric informationally complete–positive operator valued measures and the extended Clifford group, Journal of Mathematical Physics 46(5): 052107.
- Dimension towers of SICs. i. aligned SICs and embedded tight frames, Journal of Mathematical Physics 58(11): 112201.
- Finite normalized tight frames, Advances in Computational Mathematics 18: 357–385.
- Quantum measurements with prescribed symmetry, Physical Review A 96(2): 022105.
- [] Busch, P. (1991). Informationally complete sets of physical quantities, International Journal of Theoretical Physics 30: 1217–1227.
- Wigner tomography of two-qubit states and quantum cryptography, Physical Review A 78(4): 042338.
- [] Flammia, S. (n.d.). Exact SIC fiducial vectors, http://www.physics.usyd.edu.au/ sflammia/SIC/ .
- [] Fuchs, C. A. (2010). QBism, the perimeter of quantum Bayesianism, arXiv preprint arXiv:1003.5209 .
- The SIC question: History and state of play, Axioms 6(3): 21.
- Surveying points in the complex projective plane, Advances in Mathematics 286: 1017–1052.
- Quantum computation and quantum information, Cambridge university press.
- [] Prugovečki, E. (1977). Information-Theoretical aspects of quantum measurement, International Journal of Theoretical Physics 16(5): 321–331.
- Symmetric informationally complete quantum measurements, Journal of Mathematical Physics 45(6): 2171–2180.
- [] Scott, A. J. (2006). Tight informationally complete quantum measurements, Journal of Physics A: Mathematical and General 39(43): 13507.
- [] Scott, A. J. (2017). SICs: Extending the list of solutions, arXiv preprint arXiv:1703.03993 .
- Symmetric informationally complete positive-operator-valued measures: A new computer study, Journal of Mathematical Physics 51(4): 042203.
- [] Waldron, S. F. (2018). An introduction to finite tight frames, Springer.
- [] Welch, L. (1974). Lower bounds on the maximum cross correlation of signals (corresp.), IEEE Transactions on Information theory 20(3): 397–399.
- [] Zauner, G. (2011). Quantum designs: Foundations of a noncommutative design theory, International Journal of Quantum Information 9(01): 445–507.
- [] Zhu, H. (2010). SIC POVMs and Clifford groups in prime dimensions, Journal of Physics A: Mathematical and Theoretical 43(30): 305305.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.