Papers
Topics
Authors
Recent
Search
2000 character limit reached

SIC-POVMs and the Knaster's Conjecture

Published 27 May 2024 in quant-ph | (2405.16733v1)

Abstract: Symmetric Informationally Complete Positive Operator-Valued Measures (SIC-POVMs) have been constructed in many dimensions using the Weyl-Heisenberg group. In the quantum information community, it is commonly believed that SCI-POVMs exist in all dimensions; however, the general proof of their existence is still an open problem. The Bloch sphere representation of SIC-POVMs allows for a general geometric description of the set of operators, where they form the vertices of a regular simplex oriented based on a continuous function. We use this perspective of the SIC-POVMs to prove the Knaster's conjecture for the geometry of SIC-POVMs and prove the existence of a continuous family of generalized SIC-POVMs where $(n2-1)$ of the matrices have the same value of $Tr(\rhok)$. Furthermore, by using numerical methods, we show that a regular simplex can be constructed such that all its vertices map to the same value of $Tr(\rho3)$ on the Bloch sphere of $3$ and $4$ dimensional Hilbert spaces. In the $3$-dimensional Hilbert space, we generate $104$ generalized SIC-POVMs for randomly chosen $Tr(\rho3)$ values such that all the elements are equivalent up to unitary transformations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (22)
  1. [] Appleby, D. (2007). Symmetric informationally complete measurements of arbitrary rank, Optics and Spectroscopy 103: 416–428.
  2. The lie algebraic significance of symmetric informationally complete measurements, Journal of Mathematical Physics 52(2): 022202.
  3. Sic-povms from stark units: Prime dimensions n2+ 3, Journal of Mathematical Physics 63(11).
  4. Sic-povms from stark units: Dimensions n^ 2+ 3= 4p, p prime, arXiv preprint arXiv:2403.02872 .
  5. Bloch vectors for qudits, Journal of Physics A: Mathematical and Theoretical 41: 235303.
  6. [] Bloch, F. (1946). Nuclear induction, Physical Review 70: 460.
  7. [] Borsuk, K. (1933). Drei sätze über die n-dimensionale euklidische sphäre, Fundamenta Mathematicae 20(1): 177–190.
  8. [] Duda, R. (1987). Life and work of bronislaw knaster (1893–1980), Colloquium Mathematicae 51(1): 85–102.
  9. Wigner tomography of two-qubit states and quantum cryptography, Physical Review A 78(4): 042338.
  10. [] Dyson, F. J. (1951). Continuous functions defined on spheres, Annals of Mathematics pp. 534–536.
  11. [] Flammia, S. (2017). Exact SIC fiducial vectors, http://www.physics.usyd.edu.au/ sflammia/SIC/ .
  12. [] Fuchs, C. A. (2010). QBism, the perimeter of quantum Bayesianism, arXiv preprint arXiv:1003.5209 .
  13. Construction of all general symmetric informationally complete measurements, Journal of Physics A: Mathematical and Theoretical 47(33): 335302.
  14. [] Hoggar, S. G. (1981). Two quaternionic 4-polytopes, The Geometric Vein: The Coxeter Festschrift, Springer, pp. 219–230.
  15. [] Kakutani, S. (1942). A proof that there exists a circumscribing cube around any bounded closed convex set in r 3, Annals of Mathematics pp. 739–741.
  16. [] Kimura, G. (2003). The bloch vector for n-level systems, Physics Letters A 314(5-6): 339–349.
  17. [] PROBLÈMES vol. 1, Fasc. 1. (1947). Colloquium Mathematicae 1(1): 29–36.
  18. Symmetric informationally complete quantum measurements, Journal of Mathematical Physics 45(6): 2171–2180.
  19. [] Scott, A. J. (2006). Tight informationally complete quantum measurements, Journal of Physics A: Mathematical and General 39(43): 13507.
  20. [] Scott, A. J. (2017). SICs: Extending the list of solutions, arXiv preprint arXiv:1703.03993 .
  21. Symmetric informationally complete positive-operator-valued measures: A new computer study, Journal of Mathematical Physics 51(4): 042203.
  22. [] Zauner, G. (2011). Quantum designs: Foundations of a noncommutative design theory, International Journal of Quantum Information 9(01): 445–507.
Citations (1)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.