• DocumentCode
    2955878
  • Title

    Quantum t-designs: t-wise Independence in the Quantum World

  • Author

    Ambainis, Andris ; Emerson, Joseph

  • Author_Institution
    Univ. of Waterloo, Waterloo
  • fYear
    2007
  • fDate
    13-16 June 2007
  • Firstpage
    129
  • Lastpage
    140
  • Abstract
    A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a state. We give efficient constructions for approximate quantum t-designs for arbitrary t. We then show that an approximate 4-design provides a derandomization of the statedistinction problem considered by Sen (quant-ph/0512085), which is relevant to solving certain instances of the hidden subgroup problem.
  • Keywords
    quantum theory; statistical distributions; Haar-measure; approximate quantum t-designs; finite set; hidden subgroup problem; quantum states; statedistinction problem derandomization; t-wise independence; Combinatorial mathematics; Computational complexity; Distributed computing; Information theory; Mathematical analysis; Measurement units; Probability distribution; Quantum computing; Quantum mechanics; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2780-9
  • Type

    conf

  • DOI
    10.1109/CCC.2007.26
  • Filename
    4262758