Original Articles |
|
|
|
|
A New Searching Problem Solved by Quantum Computers |
YAN Hai-Yang |
Department of Physics, Tsinghua University, Beijing 100084
Key Laboratory for Quantum Information and Measurements, Ministry of Education of China, Beijing 100084
|
|
Cite this article: |
YAN Hai-Yang 2002 Chin. Phys. Lett. 19 460-462 |
|
|
Abstract It is well known that a quantum computer can search more quickly than a classical computer in 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 of Grover's problem.
|
Keywords:
03.65.Bz
03.67.Lx
|
|
Published: 01 April 2002
|
|
|
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|