Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
<|reference_start|>Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups: We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.<|reference_end|>
@article{roetteler1998polynomial-time,
    title={Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of
  non-abelian Groups},
    author={Martin Roetteler, and Thomas Beth},
    journal={arXiv preprint arXiv:quant-ph/9812070},
    year={1998},
    archivePrefix={arXiv},
    eprint={quant-ph/9812070},
    primaryClass={quant-ph cs.ET}
}