科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is well known that a quantum computer can search more quickly than a classical computer while solving the so-called Grover-searching problem. We present a new searching problem which cannot be classified into Grover's problem and can be solved by using the modified searching iterations with the same efficiency as for Grover's problem.
- 出版日期2002-4
- 单位清华大学
