The hidden subgroup problem (HSP) plays an important role in quantum computing because many quantum algorithms that are exponentially faster than classical algorithms are special cases of the HSP. In this paper we show that there exists a new efficient quantum algorithm for the HSP on groups Z N a?? Z q s where N is an integer with a special prime factorization, q prime number and s any positive integer.
展开▼
机译:隐藏子组问题(HSP)在量子计算中起着重要作用,因为许多比经典算法快几倍的量子算法是HSP的特例。在本文中,我们证明了存在一种新的高效的量子算法,用于H Z组上的HSP? Z q s,其中N是具有特殊素数分解的整数,q素数,s是任何正整数。
展开▼