• Title of article

    The quantum query complexity of the hidden subgroup problem is polynomial

  • Author/Authors

    Mark Ettinger، نويسنده , , Peter H?yer، نويسنده , , Emanuel Knill، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2004
  • Pages
    6
  • From page
    43
  • To page
    48
  • Keywords
    Algorithms , Quantum computation , Hidden subgroups , Query complexity
  • Journal title
    Information Processing Letters
  • Serial Year
    2004
  • Journal title
    Information Processing Letters
  • Record number

    129924

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129924