Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups
量子物理
2007-05-23 v2
摘要
We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups , where is any odd prime number and is any integer such that . We also address the HSP in the group , where is an integer with a special prime factorization. These quantum algorithms are exponentially faster than any classical algorithm for the same purpose.
引用
@article{arxiv.quant-ph/0703223,
title = {Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups},
author = {Carlos Magno M. Cosme and Renato Portugal},
journal= {arXiv preprint arXiv:quant-ph/0703223},
year = {2007}
}
备注
5 pages, no figures