| 摘要 |
PROBLEM TO BE SOLVED: To provide a technique that can solve a coset problem of a dihedral group faster than Kuperberg algorithm.SOLUTION: A coset state (shown in the figure) is assumed to be given, where n is a positive integer, d<2is the number to be determined, and x is the random unknown number of n bits, and the third register being the register of m cubit is added to the coset state. In the second register, 2dimension quantum Fourier conversion is performed, the second register is observed and the obtained observation result of n bits is assumed as k, r is assumed as the lower n-m bits of k, and the quantum rotating operation is performed in the third register, and thereby a pseudo-coset state (shown in the figure) is obtained.SELECTED DRAWING: None |
