15
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Symmetric Informationally Complete Quantum Measurements

      Preprint
      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We consider the existence in arbitrary finite dimensions d of a POVM comprised of d^2 rank-one operators all of whose operator inner products are equal. Such a set is called a ``symmetric, informationally complete'' POVM (SIC-POVM) and is equivalent to a set of d^2 equiangular lines in C^d. SIC-POVMs are relevant for quantum state tomography, quantum cryptography, and foundational issues in quantum mechanics. We construct SIC-POVMs in dimensions two, three, and four. We further conjecture that a particular kind of group-covariant SIC-POVM exists in arbitrary dimensions, providing numerical results up to dimension 45 to bolster this claim.

          Related collections

          Most cited references9

          • Record: found
          • Abstract: not found
          • Article: not found

          Information-theoretical aspects of quantum measurement

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Grassmannian Frames with Applications to Coding and Communication

            For a given class \({\cal F}\) of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation \(| |\) among all frames \(\{f_k\}_{k \in {\cal I}} \in {\cal F}\). We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These bounds yield a simple condition under which Grassmannian frames coincide with uniform tight frames. We exploit connections to graph theory, equiangular line sets, and coding theory in order to derive explicit constructions of Grassmannian frames. Our findings extend recent results on uniform tight frames. We then introduce infinite-dimensional Grassmannian frames and analyze their connection to uniform tight frames for frames which are generated by group-like unitary systems. We derive an example of a Grassmannian Gabor frame by using connections to sphere packing theory. Finally we discuss the application of Grassmannian frames to wireless communication and to multiple description coding.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              All Teleportation and Dense Coding Schemes

              R. Werner (2000)
              We establish a one-to-one correspondence between (1) quantum teleportation schemes, (2) dense coding schemes, (3) orthonormal bases of maximally entangled vectors, (4) orthonormal bases of unitary operators with respect to the Hilbert-Schmidt scalar product, and (5) depolarizing operations, whose Kraus operators can be chosen to be unitary. The teleportation and dense coding schemes are assumed to be ``tight'' in the sense that all Hilbert spaces involved have the same finite dimension d, and the classical channel involved distinguishes d^2 signals. A general construction procedure for orthonormal bases of unitaries, involving Latin Squares and complex Hadamard Matrices is also presented.
                Bookmark

                Author and article information

                Journal
                13 October 2003
                Article
                10.1063/1.1737053
                quant-ph/0310075
                7374ca4d-e0e5-4e47-8578-ca935c2209f8
                History
                Custom metadata
                J. Math. Phys. 45, 2171 (2004)
                8 pages
                quant-ph cs.IT math.FA math.IT

                Comments

                Comment on this article