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

      Systems of Imprimitivity for the Clifford Group

      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

          It is known that if the dimension is a perfect square the Clifford group can be represented by monomial matrices. Another way of expressing this result is to say that when the dimension is a perfect square the standard representation of the Clifford group has a system of imprimitivity consisting of one dimensional subspaces. We generalize this result to the case of an arbitrary dimension. Let k be the square-free part of the dimension. Then we show that the standard representation of the Clifford group has a system of imprimitivity consisting of k-dimensional subspaces. To illustrate the use of this result we apply it to the calculation of SIC-POVMs (symmetric informationally complete positive operator valued measures), constructing exact solutions in dimensions 8 (hand-calculation) as well as 12 and 28 (machine-calculation).

          Related collections

          Most cited references33

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

          Measurement-based quantum computation with cluster states

          , , (2003)
          We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            A Theory of Fault-Tolerant Quantum Computation

            In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant operations based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-qubit code.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              High-Resolution Radar via Compressed Sensing

              , (2008)
              A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming the number of targets K is small (i.e., K much less than N^2), then we can transmit a sufficiently "incoherent" pulse and employ the techniques of compressed sensing to reconstruct the target scene. A theoretical upper bound on the sparsity K is presented. Numerical simulations verify that even better performance can be achieved in practice. This novel compressed sensing approach offers great potential for better resolution over classical radar.
                Bookmark

                Author and article information

                Journal
                03 October 2012
                Article
                1210.1055
                1e18013c-2134-4ea2-9872-e6d4aa6a37b7

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Quantum Information and Computation, Vol. 14, No. 3 & 4, 0339-0360 (2014)
                28 pages, AMS latex
                quant-ph

                Comments

                Comment on this article